All-Termination(T)
From MaRDI portal
Publication:3617771
DOI10.1007/978-3-642-00768-2_33zbMath1234.68079OpenAlexW1583921451MaRDI QIDQ3617771
Panagiotis Manolios, Aaron Joseph Turon
Publication date: 31 March 2009
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00768-2_33
Related Items
Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion, All-Termination(T)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- AProVE
- On computing minimal models
- Termination of term rewriting using dependency pairs
- ACL2s: “The ACL2 Sedan”
- Proving non-termination
- Proving Conditional Termination
- Certified Size-Change Termination
- All-Termination(T)
- Ranking Functions for Size-Change Termination II
- A semantic basis for the termination analysis of logic programs
- The size-change principle for program termination
- Computer Aided Verification
- Verification, Model Checking, and Abstract Interpretation
- Termination Analysis with Calling Context Graphs
- On Computable Numbers, with an Application to the Entscheidungsproblem