( en | de | ru )

 

Disambiguation of "Meseguer, José"

Author of the publication

copydeleteadd this publication to your clipboard
A Verification Logic for Rewriting Logic.

, , , , and . J. Log. Comput., 15 (3): 317-352 (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

José Sánchez Meseguer

Humberto Jorge José

Nadine José Gonzalez

José Navarrete

José Putharikal

 

Other publications of authors with the same name

Folding variant narrowing and optimal variant termination., , and . J. Log. Algebraic Methods Program., 81 (7-8): 898-928 (2012)On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories., and . J. Log. Algebraic Methods Program., 81 (7-8): 816-850 (2012)Twenty years of rewriting logic.. J. Log. Algebraic Methods Program., 81 (7-8): 721-781 (2012)Order-sorted equational generalization algorithm revisited., , , and . Ann. Math. Artif. Intell., 90 (5): 499-522 (2022)Operational termination of conditional term rewriting systems., , and . Inf. Process. Lett., 95 (4): 446-453 (2005)Proving operational termination of membership equational programs., , , , and . High. Order Symb. Comput., 21 (1-2): 59-88 (2008)Specification of real-time and hybrid systems in rewriting logic., and . Theor. Comput. Sci., 285 (2): 359-405 (2002)Conditioned Rewriting Logic as a United Model of Concurrency.. Theor. Comput. Sci., 96 (1): 73-155 (1992)Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations., and . Theor. Comput. Sci., 105 (2): 217-273 (1992)Complete symbolic reachability analysis using back-and-forth narrowing., and . Theor. Comput. Sci., 366 (1-2): 163-179 (2006)