Author of the publication

Automatically disproving fair termination of higher-order functional programs.

, , , and . ICFP, page 243-255. ACM, (2016)

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

Complexity of Model-Checking Call-by-Value Programs., and . FoSSaCS, volume 8412 of Lecture Notes in Computer Science, page 180-194. Springer, (2014)Two-Level Game Semantics, Intersection Types, and Recursion Schemes., and . ICALP (2), volume 7392 of Lecture Notes in Computer Science, page 325-336. Springer, (2012)Automated Synthesis of Functional Programs with Auxiliary Functions., , and . APLAS, volume 11275 of Lecture Notes in Computer Science, page 223-241. Springer, (2018)CPS transformation with affine types for call-by-value implicit polymorphism., and . Proc. ACM Program. Lang., 5 (ICFP): 1-30 (2021)Optimal CHC Solving via Termination Proofs., , and . Proc. ACM Program. Lang., 7 (POPL): 604-631 (January 2023)Software Model-Checking as Cyclic-Proof Search., and . CoRR, (2021)Termination Analysis for the π-Calculus by Reduction to Sequential Program Termination., , , , , and . CoRR, (2021)Termination Analysis for the $$$$-Calculus by Reduction to Sequential Program Termination., , , , , and . APLAS, volume 13008 of Lecture Notes in Computer Science, page 265-284. Springer, (2021)A Categorical Model of an i/o -typed -calculus., and . ESOP, volume 11423 of Lecture Notes in Computer Science, page 640-667. Springer, (2019)On Average-Case Hardness of Higher-Order Model Checking., , , , and . FSCD, volume 167 of LIPIcs, page 21:1-21:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)