Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Toward a declarative semantics for infinite objects in logic programming
Journal of Logic Programming
Inference of monotonicity constraints in datalog programs
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Termination proofs for logic programs
Termination proofs for logic programs
Handbook of theoretical computer science (vol. B)
Strong termination of logic programs
Journal of Logic Programming
Reasoning about termination of pure Prolog programs
Information and Computation
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Automatic inference of norms: a missing link in automatic termination analysis
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
An abstract interpretation framework which accurately handles prolog search-rule and the cut
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Modular termination proofs for logic and pure PROLOG programs
Advances in logic programming theory
Nondeterminism and infinite computations in constraint programming
Selected papers of the workshop on Topology and completion in semantics
From logic programming to Prolog
From logic programming to Prolog
Compositionality properties of SLD-derivations
Theoretical Computer Science
Deriving constraints among argument sizes in logic programs (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Goal independency and call patterns in the analysis of logic programs
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
∃ -Universal termination of logic programs
Theoretical Computer Science
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Theory of observables for logic programs
Information and Computation
On the Interpretation of Infinite Computations in Logic Programming
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Proving Termination of Logic Programs by Exploiting Term Properties
TAPSOFT '91 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Developmemnt (CCPSD)
Inferring Argument Size Relationships with CLP(R)
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
Infinite Behaviour and Fairness in Concurrent Constraint Programming
Proceedings of the REX Workshop on Sematics: Foundations and Applications
Concurrent constraint programming languages
Concurrent constraint programming languages
How to Transform an Analyzer into a Verifier
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Using parametric set constraints for locating errors in CLP programs
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
In this paper we define a semantic foundation for an abstract interpretation approach to universal termination and we develop a new abstract domain useful for termination analysis. Based on this approximation we define a method which is able to detect classes of goals which universally terminate (with a fair selection rule). We also define a method which is able to characterize classes of programs and goals for which depth-first search is fair.