Keyword:termination

Publications
Automated Theorem Proving for Prolog Verification Fred Mesnard, Thierry Marianne and Etienne Payet In:LPAR 2024 Complementary Volume
Polynomial Loops: Beyond Termination Marcel Hark, Florian Frohn and Jürgen Giesl In:LPAR23. LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
Loop Analysis by Quantification over Iterations Bernhard Gleiss, Laura Kovács and Simon Robillard In:LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
Graph Path Orderings Nachum Dershowitz and Jean-Pierre Jouannaud In:LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
Transforming Prefix-constrained or Controlled Rewrite Systems Nirina Andrianarivelo, Vivien Pelletier and Pierre Réty In:SCSS 2017. The 8th International Symposium on Symbolic Computation in Software Science 2017
Local Driving in Higher-Order Positive Supercompilation via the Omega-theorem Geoff Hamilton and Morten Heine Sørensen In:VPT 2014. Second International Workshop on Verification and Program Transformation
On the Termination of Positive Supercompilation Geoff Hamilton In:VPT 2013. First International Workshop on Verification and Program Transformation
LOOPUS - A Tool for Computing Loop Bounds for C Programs Moritz Sinn and Florian Zuleger In:WING 2010. Workshop on Invariant Generation 2010
Extending Non-Termination Proof Techniques to Asynchronously Communicating Concurrent Programs Matthias Kuntz, Stefan Leue and Christoph Scheben In:WING 2010. Workshop on Invariant Generation 2010
MiniAgda: Integrating Sized and Dependent Types Andreas Abel In:PAR-10. Partiality and Recursion in Interactive Theorem Provers