Inferring termination conditions for logic programs using backwards analysis

Authors:
Samir Genaim;Michael Codish
Affiliations:
Dipartimento di Informatica, Università degli Studi di Verona, Verona, Italy (e-mail: genaim@sci.univr.it);Department of Computer Science, Ben-Gurion University, Israel (e-mail: mcodish@cs.bgu.ac.il)
Venue:
Theory and Practice of Logic Programming
Year:
2005

Citing 8
Cited 7

Inference of monotonicity constraints in datalog programs

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic programming

Handbook of theoretical computer science (vol. B)
Abstract interpretation and application to logic programs

Journal of Logic Programming
A logical model for relational abstract domains

ACM Transactions on Programming Languages and Systems (TOPLAS)
Two classes of Boolean functions for dependency analysis

Science of Computer Programming
Automatic discovery of linear restraints among variables of a program

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Inferring Argument Size Relationships with CLP(R)

LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation

Inverting abstract unification for set-sharing

PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Termination analysis of logic programs through combination of type-based norms

ACM Transactions on Programming Languages and Systems (TOPLAS)
Inferring non-suspension conditions for logic programs with dynamic scheduling

ACM Transactions on Computational Logic (TOCL)
Using CLP Simplifications to Improve Java Bytecode Termination Analysis

Electronic Notes in Theoretical Computer Science (ENTCS)
A termination analyzer for Java bytecode based on path-length

ACM Transactions on Programming Languages and Systems (TOPLAS)
Termination prediction for general logic programs

Theory and Practice of Logic Programming
Determinacy inference for logic programs

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalises traditional termination analysis where an analyser tries to verify termination for a specified mode. Our contribution is a methodology in which components of traditional termination analysis are combined with backwards analysis to obtain an analyser for termination inference. We identify a condition on the components of the analyser which guarantees that termination inference will infer all modes which can be checked to terminate. The application of this methodology to enhance a traditional termination analyser to perform also termination inference is demonstrated.