Inferring Termination Conditions for Logic Programs Using Backwards Analysis
- 20 November 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 685-694
- https://doi.org/10.1007/3-540-45653-8_47
Abstract
No abstract availableKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- A semantic basis for the termination analysis of logic programsThe Journal of Logic Programming, 1999
- A logical model for relational abstract domainsACM Transactions on Programming Languages and Systems, 1998
- Inferring argument size relationships with CLP( $$\mathcal{R}$$ )Lecture Notes in Computer Science, 1997
- Deriving linear size relations for logic programs by abstract interpretationNew Generation Computing, 1995
- Precise and efficient groundness analysis for logic programsACM Letters on Programming Languages and Systems, 1993
- Abstract interpretation and application to logic programsThe Journal of Logic Programming, 1992
- Inference of monotonicity constraints in datalog programsPublished by Association for Computing Machinery (ACM) ,1989
- Foundations of Logic ProgrammingPublished by Springer Nature ,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
- Affine relationships among variables of a programActa Informatica, 1976