We advocate using the declarative reading of logic programs in proving partial correctness, when the properties of interest are declarative. Some publications present unnecessarily complicated methods for proving such properties. These approaches refer to the operational semantics, as they consider calls and successes of the predicates of the program during LD-resolution. We show that this is an unnecessary complication and that a straightforward proof method is simpler and in some sense more general. Our approach is based solely on the property that "whatever is computed is a logical consequence of the program". This approach is not new and can be traced back to the work of Clark in 1979. However it seems that it has been - to a certain extent - forgotten. We believe in its importance in teaching logic programming. The paper deals with partial correctness, we complement it with an outline of a method for proving completeness. In this paper we recall a simple and straightf...

Java programs often use pointer structures for normal computations. A verification system for Java should have good proof support for reasoning about those structures. However, the literature for pointer verification almost always uses specifications and definitions that are tailored to the problem under consideration. We propose a generic specification for Java pointer structures that allows to express many important properties, and is easy to use in proofs. The specification is part of the Java calculus [22] in the KIV [15] prover.