Inferring and Compiling Termination for Constraint Logic Programs

Authors:
Sébastien Hoarau;Frédéric Mesnard
Affiliations:
-;-
Venue:
LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation
Year:
1998

Citing 5
Cited 0

Termination detection in logic programs using argument sizes (extended abstract)

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Abstract interpretation and application to logic programs

Journal of Logic Programming
Reasoning about termination of pure Prolog programs

Information and Computation
Termination Analysis for Mercury

SAS '97 Proceedings of the 4th International Symposium on Static Analysis
A Semantic Basis for Termination Analysis of Logic Programs and Its Realization Using Symbolic Norm Constraints

ALP '97-HOA '97 Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an automated method that deals with termination of constraint logic programs in two steps. First, from the text of a program, the method infers a set of potentially terminating classes using abstract interpretation and boolean mu-calculus. By "potentially", we roughly mean that for each of these classes, one can find a static order over the literals of the clauses of the program to ensure termination. Then, given a terminating class among those computed at the first step, the second step consists of a "compilation" (or transformation) of the original program to another one by reordering literals. For this new program, the universal left-termination of any query of the considered class is guaranteed. The method has been implemented.