Author of the publication

Proving operational termination of membership equational programs.

, , , , and . High. Order Symb. Comput., 21 (1-2): 59-88 (2008)

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.

 

Other publications of authors with the same name

Completeness of context-sensitive rewriting.. Inf. Process. Lett., 115 (2): 87-92 (2015)Strong and NV-sequentiality of constructor systems.. Inf. Process. Lett., 89 (4): 191-201 (2004)Redundancy Analyses in Term Rewriting., , and . WFLP, page 309-323. (2000)Operational termination of conditional term rewriting systems., , and . Inf. Process. Lett., 95 (4): 446-453 (2005)On-demand strategy annotations revisited: An improved on-demand evaluation strategy., , , and . Theor. Comput. Sci., 411 (2): 504-541 (2010)Termination of On-Demand Rewriting and Termination of OBJ Programs.. PPDP, page 82-93. ACM, (2001)Termination of Context-Sensitive Rewriting by Rewriting.. ICALP, volume 1099 of Lecture Notes in Computer Science, page 122-133. Springer, (1996)Polynomials over the reals in proofs of termination: from theory to practice.. RAIRO Theor. Informatics Appl., 39 (3): 547-586 (2005)mu-term: Verify Termination Properties Automatically (System Description)., and . IJCAR (2), volume 12167 of Lecture Notes in Computer Science, page 436-447. Springer, (2020)mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting.. RTA, volume 3091 of Lecture Notes in Computer Science, page 200-209. Springer, (2004)