A semantic basis for termination analysis of logic programs and its realization using symbolic norm constraints
- 1 January 1997
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Inferring argument size relationships with CLP( $$\mathcal{R}$$ )Published by Springer Nature ,1997
- Generalized semantics and abstract interpretation for constraint logic programsThe Journal of Logic Programming, 1995
- Analyzing logic programs using “prop”-ositional logic programs and a magic wandThe Journal of Logic Programming, 1995
- Constraint logic programming: a surveyThe Journal of Logic Programming, 1994
- Suspension analyses for concurrent logic programsACM Transactions on Programming Languages and Systems, 1994
- Goal independency and call patterns in the analysis of logic programsPublished by Association for Computing Machinery (ACM) ,1994
- Deriving constraints among argument sizes in logic programsAnnals of Mathematics and Artificial Intelligence, 1991
- Declarative modeling of the operational behavior of logic languagesTheoretical Computer Science, 1989
- Automatic discovery of linear restraints among variables of a programPublished by Association for Computing Machinery (ACM) ,1978
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977