Practical Methods for Proving Program Termination
- 20 September 2002
- book chapter
- Published by Springer Nature
- p. 442-454
- https://doi.org/10.1007/3-540-45657-0_36
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Synthesis of Linear Ranking FunctionsPublished by Springer Nature ,2001
- Verifying Temporal Properties of Reactive Systems: A STeP TutorialFormal Methods in System Design, 2000
- Approximating the domains of functional and imperative programsScience of Computer Programming, 1999
- Termination Analysis for Functional ProgramsPublished by Springer Nature ,1998
- Double description method revisitedPublished by Springer Nature ,1996
- Temporal Verification of Reactive SystemsPublished by Springer Nature ,1995
- Generating polynomial orderings for termination proofsPublished by Springer Nature ,1995
- Termination of rewritingJournal of Symbolic Computation, 1987
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977
- Quantifier elimination for real closed fields by cylindrical algebraic decompostionPublished by Springer Nature ,1975