Author of the publication

Confluence Criteria for Logically Constrained Rewrite Systems.

, and . CADE, volume 14132 of Lecture Notes in Computer Science, page 474-490. Springer, (2023)

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

Modularity of Confluence: A Simplified Proof., , , and . Inf. Process. Lett., 49 (2): 101-109 (1994)AC-KBO Revisited., , , and . FLOPS, volume 8475 of Lecture Notes in Computer Science, page 319-335. Springer, (2014)A Complete Selection Function for Lazy Conditional Narrowing., and . FLOPS, volume 2024 of Lecture Notes in Computer Science, page 201-215. Springer, (2001)Proving Termination of Rewrite Systems Using Bounds., and . RTA, volume 4533 of Lecture Notes in Computer Science, page 273-287. Springer, (2007)Simple Termination is Difficult., and . RTA, volume 690 of Lecture Notes in Computer Science, page 228-242. Springer, (1993)Tyrolean Termination Tool 2., , , and . RTA, volume 5595 of Lecture Notes in Computer Science, page 295-304. Springer, (2009)Revisiting Matrix Interpretations for Proving Termination of Term Rewriting., and . RTA, volume 10 of LIPIcs, page 251-266. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Leftmost Outermost Revisited., , and . RTA, volume 36 of LIPIcs, page 209-222. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Conditional Complexity., , and . RTA, volume 36 of LIPIcs, page 223-240. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Beyond Peano Arithmetic - Automatically Proving Termination of the Goodstein Sequence., , and . RTA, volume 21 of LIPIcs, page 335-351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)