Author of the publication

Verifying Procedural Programs via Constrained Rewriting Induction.

, , and . ACM Trans. Comput. Log., 18 (2): 14:1-14:50 (2017)

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

WANDA - a Higher Order Termination Tool (System Description).. FSCD, volume 167 of LIPIcs, page 36:1-36:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Higher-order Cons-free Interpreters., and . CoRR, (2017)Higher-Order LCTRSs and Their Termination., and . CoRR, (2023)Cost-Size Semantics for Call-By-Value Higher-Order Rewriting., and . FSCD, volume 260 of LIPIcs, page 15:1-15:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On Basic Feasible Functionals and the Interpretation Method., , , and . FoSSaCS (2), volume 14575 of Lecture Notes in Computer Science, page 70-91. Springer, (2024)Polymorphic Higher-Order Termination., and . FSCD, volume 131 of LIPIcs, page 12:1-12:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Cons-free Programming with Immutable Functions.. CoRR, (2017)Termination of LCTRSs.. CoRR, (2016)A Higher-Order Iterative Path Ordering., and . LPAR, volume 5330 of Lecture Notes in Computer Science, page 697-711. Springer, (2008)Subclasses of Ptime Interpreted by Programming Languages., , and . Theory Comput. Syst., 67 (3): 437-472 (June 2023)