Termination proofs for systems code
Top Cited Papers
- 11 June 2006
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 415-426
- https://doi.org/10.1145/1133981.1134029
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Cogent: Accurate Theorem Proving for Program VerificationPublished by Springer Nature ,2005
- Termination of Polynomial ProgramsPublished by Springer Nature ,2005
- Shape Analysis by Predicate AbstractionPublished by Springer Nature ,2005
- Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite ProgrammingPublished by Springer Nature ,2005
- Abstraction Refinement for TerminationPublished by Springer Nature ,2005
- A Complete Method for the Synthesis of Linear Ranking FunctionsPublished by Springer Nature ,2004
- Automated Termination Proofs with AProVEPublished by Springer Nature ,2004
- A semantic basis for the termination analysis of logic programsThe Journal of Logic Programming, 1999
- TermiLog: A system for checking termination of queries to logic programsPublished by Springer Nature ,1997
- Assigning meanings to programsPublished by American Mathematical Society (AMS) ,1967