The size-change principle for program termination
- 1 January 2001
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 36 (3), 81-92
- https://doi.org/10.1145/373243.360210
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Calculating sized typesPublished by Association for Computing Machinery (ACM) ,1999
- Proving innermost normalisation automaticallyLecture Notes in Computer Science, 1997
- A semantic basis for termination analysis of logic programs and its realization using symbolic norm constraintsPublished by Springer Science and Business Media LLC ,1997
- Computability and ComplexityPublished by MIT Press ,1997
- Termination analysis for functional programs using term orderingsLecture Notes in Computer Science, 1995
- Automatic termination proofs with transformation orderingsLecture Notes in Computer Science, 1995
- Termination Proofs for Logic ProgramsPublished by Springer Science and Business Media LLC ,1990
- On the complexity of omega -automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- 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