Results 1 
3 of
3
It Is Declarative  On Reasoning About LOGIC PROGRAMS
"... 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 consid ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
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 LDresolution. 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...
On the Spreadsheet Presentation of Proof Obligations
"... . A compact and structured format for presenting proof obligations is described. The format places the formulas and proof obligations in the form of a spreadsheet, where rows are formulas, columns are obligations, and cells record whether and how a formula appears in an obligation. This spreadsheet ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. A compact and structured format for presenting proof obligations is described. The format places the formulas and proof obligations in the form of a spreadsheet, where rows are formulas, columns are obligations, and cells record whether and how a formula appears in an obligation. This spreadsheet presentation frees the proof system from some interfacerelated restrictions, and allows users to follow a more natural style of problem solving. It can be applied to either sequent or tableau logics, and can be used by most theorem proving systems. An initial implementation is discussed, some recommendations are made for future effort, and a graphical user interface design is proposed based on the spreadsheet model. 1 Introduction When we want to prove a theorem using a proof assistant, we the users are faced with the task of processing a large amount of complex information. The single, small theorem we wanted to prove may expand, during the course of the proof, into many "proof obligation...
Reasoning about Pointer Structures in Java
, 2006
"... 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 ..."
Abstract
 Add to MetaCart
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.