Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs

Mesnard, Frédéric; Neumerkel, Ulrich

doi:10.1007/3-540-47764-0_6

Cited by 32 publications

(69 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Concerning automation of our method, the problems are not so different from the ones encountered when proving left-termination: we have to reason about infinite models -to do so, abstract interpretation approaches, where terms are abstracted as their norms, may be useful [11,16]. It seems that in our case automation is additionally complicated because we have to consider infinitely many simply-local substitutions.…”

Section: Resultsmentioning

confidence: 99%

“…Termination of logic programs has been widely studied for the LD selection rule, i.e., derivations where the leftmost atom in a query is selected [1,4,[8][9][10][11]16]. This rule is adequate for many applications, but there are situations, e.g., in the context of parallel executions or the test-and-generate paradigm, that require dynamic scheduling, i.e., some mechanism to determine at runtime which atom is selected.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Termination of Logic Programs Using Various Dynamic Selection Rules

Smaus¹

2004

Logic Programming

View full text Add to dashboard Cite

Abstract. We study termination of logic programs with dynamic scheduling, as it can be realised using delay declarations. Following previous work, our minimum assumption is that derivations are input-consuming, a notion introduced to define dynamic scheduling in an abstract way. Since this minimum assumption is sometimes insufficient to ensure termination, we consider here various additional assumptions on the permissible derivations. In one dimension, we consider derivations parametrised by any property that the selected atoms must have, e.g. being ground in the input positions. In another dimension, we consider both local and non-local derivations. In all cases, we give sufficient criteria for termination. The dimensions can be combined, yielding the most comprehensive approach so far to termination of logic programs with dynamic scheduling. For non-local derivations, the termination criterion is even necessary.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Termination of Logic Programs Using Various Dynamic Selection Rules

Smaus¹

2004

Logic Programming

View full text Add to dashboard Cite

show abstract

“…Under this classification, this survey paper has been mainly concerned with the first type. While we do not even try to survey the large amount of literature on automatic or semi-automatic approaches [14,21,29,23,44,52,53,71], it must be observed that existing tools typically implement conditions for checking proof obligations of the characterisations we surveyed. As an example, a challenging topic of the research in automatic termination inference consists in finding standard forms of level mappings and models, so that the solution of the resulting proof obligations can be reduced to known problems for which efficient algorithms exist.…”

Section: Related Workmentioning

confidence: 99%

“…Recently, the approaches of Mesnard and Ruggieri have been merged into a unified framework [54], for which an implementation is described in [52].…”

Section: Extensions Of Lp: Constraint Logic Programsmentioning

confidence: 99%

Characterisations of Termination in Logic Programming

Pedreschi

Ruggieri

Smaus

2004

Program Development in Computational Logic

View full text Add to dashboard Cite

Abstract. The procedural interpretation of logic programs and queries is parametric to the selection rule, i.e. the rule that determines which atom is selected in each resolution step. Termination of logic programs and queries depends critically on the selection rule. In this survey, we present a unified view and comparison of seven notions of universal termination considered in the literature, and the corresponding classes of programs. For each class, we focus on a sufficient, and in most cases even necessary, declarative characterisation for determining that a program is in that class. By unifying different formalisms and making appropriate assumptions, we are able to establish a formal hierarchy between the different classes and their respective declarative characterisations.

show abstract

“…We note the TermiLog system described in (Lindenstrauss and Sagiv 1997) and the system based on the binary clause semantics described in (Codish and Taboch 1999). Termination inference is considered previously by Mesnard and coauthors in (Mesnard 1996;Mesnard and Neumerkel 2001;Mesnard and Ruggieri 2001). Here, we make the observation that the missing link which relates termination checking and termination inference is backwards analysis.…”

Section: Introductionmentioning

confidence: 99%

Inferring Termination Conditions for Logic Programs Using Backwards Analysis

Genaim

Codish

2001

Logic for Programming, Artificial Intelligence, and Reasoning

View full text Add to dashboard Cite

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.

show abstract

Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs

Cited by 32 publications

References 21 publications

Termination of Logic Programs Using Various Dynamic Selection Rules

Termination of Logic Programs Using Various Dynamic Selection Rules

Characterisations of Termination in Logic Programming

Inferring Termination Conditions for Logic Programs Using Backwards Analysis

Contact Info

Product

Resources

About