Weakest preconditions for pure Prolog programs

doi:10.1016/S0020-0190(98)00098-2

Information Processing Letters

Volume 67, Issue 3, 17 August 1998, Pages 145-150

https://doi.org/10.1016/S0020-0190(98)00098-2 Get rights and content

Abstract

We introduce a characterization of weakest preconditions and weakest liberal preconditions of pure Prolog programs P and postconditions Post in terms of ordinal closures of a natural operator based on P and Post.

References (13)

P. Deransart
Proof methods of declarative properties of definite programs
Theoret. Comput. Sci.
(1993)
W. Drabent et al.
Inductive assertion method for logic programs
Theoret. Comput. Sci.
(1988)
K.R. Apt
Ten years of Hoare's logic: a survey—Part I
ACM Trans. Program. Languages Systems
(1981)
K.R. Apt
From Logic Programming to Prolog
(1996)
A. Bossi et al.
Verifying correctness of logic programs
L. Colussi et al.
Proving correctness of logic programs using axiomatic semantics

There are more references available in the full text version of this article.

Cited by (5)

A weakest precondition calculus for BUnity
2013, Science of Computer Programming
Verification of logic programs
1999, Journal of Logic Programming
We present a proof method in the style of Hoare's logic, aimed at providing a unifying framework for the verification of total correctness of logic and Prolog programs. The method, which relies on purely declarative reasoning, has been designed as a trade-off between expresiveness and ease of use. On the basis of a few simple principles, we reason uniformly on several properties of logic and Prolog programs, including partial correctness, call patterns, absence of run-time errors, safe omission of the occur-check, computed instances, termination and modula program development. We finally generalize the method to general programs.
Backward Pair Sharing Analysis
2004, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Analysing logic programs by reasoning backwards
2004, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Backward type inference generalises type checking
2002, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

View full text

Weakest preconditions for pure Prolog programs

Abstract

Theoret. Comput. Sci.

Theoret. Comput. Sci.

Ten years of Hoare's logic: a survey—Part I

ACM Trans. Program. Languages Systems

From Logic Programming to Prolog

Verifying correctness of logic programs

Proving correctness of logic programs using axiomatic semantics