The size-change principle for program termination
Authors:
Open Access
- 1 January 2001
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 36 (3) , 81-92
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Calculating sized types1999
- Computability and Complexity1997
- Proving innermost normalisation automatically1997
- A semantic basis for termination analysis of logic programs and its realization using symbolic norm constraints1997
- Termination analysis for functional programs using term orderings1995
- Automatic termination proofs with transformation orderings1995
- Termination Proofs for Logic Programs1990
- On the complexity of omega -automata1988
- The complementation problem for Büchi automata with applications to temporal logicTheoretical Computer Science, 1987
- An axiomatic basis for computer programmingCommunications of the ACM, 1969