Automating control for logic programs
Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Control generation for logic programs
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
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
LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation
A Transformational Methodology for Proving Termination of Logic Programs
CSL '91 Proceedings of the 5th Workshop on Computer Science Logic
| Hi-index | 0.00 |
This paper presents several verification methods for logic programs with delay declarations. It is shown how type and instantiation errors related to built-ins can be prevented, and how termination can be ensured. Three features are distinctive of this work: it is assumed that predicates can be used in several modes; it is shown that block declarations, which are a very simple delay construct, are sufficient to ensure the desired properties; the selection rule is taken into account, assuming it to be the rule of most Prolog implementations. The methods can be used both to verify existing programs and to assist in writing new programs.