Author of the publication

Certified Equational Reasoning via Ordered Completion.

, and . CADE, volume 11716 of Lecture Notes in Computer Science, page 508-525. Springer, (2019)

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

Reachability Analysis for Termination and Confluence of Rewriting., and . TACAS (1), volume 11427 of Lecture Notes in Computer Science, page 262-278. Springer, (2019)nonreach - A Tool for Nonreachability Analysis., and . TACAS (1), volume 11427 of Lecture Notes in Computer Science, page 337-343. Springer, (2019)A New and Formalized Proof of Abstract Completion., , and . ITP, volume 8558 of Lecture Notes in Computer Science, page 292-307. Springer, (2014)Certifying the Weighted Path Order (Invited Talk)., , , and . FSCD, volume 167 of LIPIcs, page 4:1-4:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Imperative Insertion Sort.. Arch. Formal Proofs, (2014)Well-Quasi-Orders.. Arch. Formal Proofs, (2012)Certified Kruskal's Tree Theorem.. CPP, volume 8307 of Lecture Notes in Computer Science, page 178-193. Springer, (2013)Transforming SAT into Termination of Rewriting., , and . WFLP, volume 246 of Electronic Notes in Theoretical Computer Science, page 199-214. Elsevier, (2008)Getting Started with Isabelle/jEdit. CoRR, (2012)Certified Kruskal's Tree Theorem.. J. Formaliz. Reason., 7 (1): 45-62 (2014)