Abstract. This extended abstract describes work in progress on termination analysis of strongly typed logic programs. A basic dierence with existing work on the topic is that in our approach we use the type of a term to derive a number of basic measures { rather than a single sophisticated measure { by which the size of a term can be measured. The basic idea is to characterise the size of a term by counting the number of subterms of a particular type it has. This characterisation allows to compare the sizes of terms of dierent but related types and to construct size relations between such terms in a straightforward way. Precisely the construction of such size relations has been a major point of diculty in other type-based approaches. 1
|
1660
|
Foundations of Logic Programming
– Lloyd
- 1987
|
|
393
|
Introduction to Logic Programming
– Apt
- 1990
|
|
364
|
Automatic discovery of linear restraints among variables of a program
– Cousot, Halbwachs
- 1978
|
|
112
|
Deriving descriptions of possible values of program variables by means of abstract interpretation
– Bruynooghe, Janssens
- 1992
|
|
64
|
E cient tests for top-down termination of logical rules
– Ullman, Gelder
- 1988
|
|
62
|
The execution algorithm of Mercury, an ecient purely declarative logic programming language
– Somogyi, Henderson, et al.
- 1996
|
|
39
|
Inferring argument size relationships with CLP(R
– Benoy, King
- 1997
|
|
27
|
A general framework for automatic termination analysis of logic programs
– Dershowitz, Lindenstrauss, et al.
|
|
25
|
Estimating the computational cost of logic programs
– Debray, Garcia, et al.
- 1994
|
|
20
|
Abstract Interpretation over Non-Deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs
– Gallagher, Puebla
- 2002
|
|
20
|
Some Issues in Analysis and Specialization of Modular Ciao-Prolog Programs
– Puebla, Hermenegildo
- 1999
|
|
19
|
Applying static analysis techniques for inferring termination conditions of logic programs
– Mesnard, Neumerkel
- 2001
|
|
15
|
Mode analysis domains for typed logic programs
– Smaus, Hill, et al.
- 2000
|
|
13
|
Typed norms
– Bossi, Cocco, et al.
- 1992
|
|
13
|
A framework for analysis of typed logic programs
– Lagoon, Stuckey
- 2001
|
|
11
|
Typed norms for typed logic programs
– Martin, King, et al.
- 1996
|
|
9
|
A framework for analysing the termination of de logic programs with respect to call patterns
– Schreye, Verschaetse, et al.
- 1992
|
|
9
|
Schreye and Stefaan Decorte. Termination of logic programs: the neverending story
– De
- 1994
|
|
8
|
Exploiting the power of typed norms in automatic inference of interargument relations
– Decorte, Schreye, et al.
- 1997
|
|
7
|
Codish and Cohavit Taboch. A semantic basis for the termination analysis of logic programs
– Michael
- 1999
|
|
7
|
Binding-Time Annotations Without Binding-Time Analysis
– Vanhoof, Bruynooghe
- 2001
|
|
5
|
Pos(t): Analyzing dependencies in typed logic programs
– Bruynooghe, Vanhoof, et al.
- 2001
|
|
5
|
Constraint based automatic termination analysis of Logic Programs
– Decorte, Schreye, et al.
- 1999
|
|
5
|
Analyzing dependencies in typed logic programs
– Pos
- 2001
|
|
4
|
de Schreye, and Massimo Fabris. Automatic inference of norms: A missing link in automatic termination analysis
– Decorte, Danny
- 1993
|
|
3
|
Garc ia de la
– Bueno, Maria
- 1994
|
|
3
|
Lindenstrauss and Yehoshua Sagiv. Automatic termination analysis of logic programs
– Naomi
- 1997
|
|
3
|
Cohavit Taboch \A Semantic Basis for Termination Analysis of Logic Programming and its Realization using Symbolic Norm Constraints
– Codish
- 1997
|
|
2
|
A methodology for granularitybased control of parallelism in logic programs
– Lopez, Hermenegildo, et al.
- 1996
|
|
1
|
Vitaly Lagoon. Combining norms to prove termination
– Genaim, Codish, et al.
- 2002
|
|
