Verifying termination and error-freedom of logic programs with block declarations

Authors:
Jan-Georg Smaus;Patricia M. Hill;Andy King
Affiliations:
CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands (e-mail: jan.smaus@cwi.nl);School of Computer Studies, University of Leeds, Leeds LS2 9JT, UK (e-mail: hill@scs.leeds.ac.uk);University of Kent at Canterbury, Canterbury, CT2 7NF, UK (e-mail: a.m.king@ukc.ac.uk)
Venue:
Theory and Practice of Logic Programming
Year:
2001

Citing 12
Cited 5

Automating control for logic programs

Journal of Logic Programming
Termination of rewriting

Journal of Symbolic Computation
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Strong termination of logic programs

Journal of Logic Programming
Control generation for logic programs

ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
On the occur-check-free PROLOG programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
The Go¨del programming language

The Go¨del programming language
From logic programming to Prolog

From logic programming to Prolog
On the Unification Free Prolog Programs

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Verification of Logic Programs with Delay Declarations

AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Termination of Logic Programs with block Declarations Running in Several Modes

PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Generating Efficient, Terminating Logic Programs

TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development

On logic programs that always succeed

Science of Computer Programming
Classes of terminating logic programs

Theory and Practice of Logic Programming
Termination of simply moded logic programs with dynamic scheduling

ACM Transactions on Computational Logic (TOCL)
Input-termination of logic programs

LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Fast and accurate strong termination analysis with an application to partial evaluation

WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present verification methods for logic programs with delay declarations. The verified properties are termination and freedom from errors related to built-ins. Concerning termination, we present two approaches. The first approach tries to eliminate the well-known problem of speculative output bindings. The second approach is based on identifying the predicates for which the textual position of an atom using this predicate is irrelevant with respect to termination. Three features are distinctive of this work: it allows for predicates to be used in several modes; it shows that block declarations, which are a very simple delay construct, are sufficient to ensure the desired properties; it takes the selection rule into account, assuming it to be as in most Prolog implementations. The methods can be used to verify existing programs and assist in writing new programs.