Termination analysis for Mercury

Speirs, Chris; Somogyi, Zoltán; Søndergaard, Harald

doi:10.1007/bfb0032740

Cited by 26 publications

(48 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our method may help in designing more powerful automatic systems for verifying termination (De Schreye et al 1992, Speirs, Somogyi and Søndergaard. 1997, Decorte et al 1999, Codish and Taboch 1999.…”

Section: Discussionmentioning

confidence: 99%

On modular termination proofs of general logic programs

Bossi

Cocco

Rossi

et al. 2002

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

We propose a modular method for proving termination of general logic programs (i.e., logic programs with negation). It is based on the notion of acceptable programs, but it allows us to prove termination in a truly modular way. We consider programs consisting of a hierarchy of modules and supply a general result for proving termination by dealing with each module separately. For programs which are in a certain sense well-behaved, namely well-moded or well-typed programs, we derive both a simple verification technique and an iterative proof method. Some examples show how our system allows for greatly simplified proofs.

show abstract

Section: Discussionmentioning

confidence: 99%

On modular termination proofs of general logic programs

Bossi

Cocco

Rossi

et al. 2002

Theory and Practice of 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%

“…The inference of an appropriate permutation has been proposed by Speirs et al [71] and by Hoarau & Mesnard [39]. In [71], mode and type information provided by the programmer are used to reorder the body atoms.…”

Section: Permutation Terminating Programsmentioning

confidence: 99%

See 1 more Smart Citation

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

“…Several automated methods to prove termination have been developed for first-order functional and logic programs in the past years (for example [3,20,9,18,31,35]). One typical approach is to transform the program into a term rewriting system (TRS) such that the termination property is preserved.…”

Section: Introductionmentioning

confidence: 99%

Verifying Termination and Reduction Properties about Higher-Order Logic Programs

Pientka

2005

J Autom Reasoning

View full text Add to dashboard Cite

Abstract. We describe two checkers for verifying termination and reduction properties about higher-order logic programs. The reduction checker verifies that the result of a program execution is structurally smaller (or equal) than the inputs to the program. The termination checker guarantees that the inputs of the recursive calls are structurally smaller than the inputs of the original call taking into account reduction properties. At the heart of both checkers lies an inference system to reason about structural properties which are described by higher-order subterm relations. This approach provides a logical foundation for proving properties such as termination and reduction and factors the effort required for each one of them. Moreover, it allows the study of proof-theoretical properties, soundness and completeness and different optimizations. The termination and reduction checker are implemented as part of the Twelf system and have been used on a wide variety of examples, including proofs about typed assembly language and those in the area of proof-carrying code.

show abstract

Termination analysis for Mercury

Cited by 26 publications

References 8 publications

On modular termination proofs of general logic programs

On modular termination proofs of general logic programs

Characterisations of Termination in Logic Programming

Verifying Termination and Reduction Properties about Higher-Order Logic Programs

Contact Info

Product

Resources

About