Program verification is the idea that properties of programs can be precisely stated and proved in the mathematical sense. In this paper, some simple heuristics combining evaluation and mathematical induction are described, which the authors have implemented in a program that automatically proves a wide variety of theorems about recursive LISP functions. The method the program uses to generate induction formulas is described at length. The theorems proved by the program include that REVERSE is its own inverse and that a particular SORT program is correct. A list of theorems proved by the program is given. key words and phrases: LISP, automatic theorem-proving, structural induction, program verification cr categories: 3.64, 4.22, 5.21 1 I...
Three studies in the machine assisted proof of recursion implementation are described. The verifica...
This is one of a series of memos concerning a logical system for proof-checking. It is not self-cont...
AbstractInductive methods are basic to program proving and this paper presents the formal part of a ...
Program verication is the idea that properties of programs can be precisely stated and proved in the...
We describe work in progress on an automatic theorem prover for recursive function theory that we in...
Centre for Intelligent Systems and their ApplicationsThis thesis describes the results of two studie...
We present a technique for the mechanical proof of correctness properties of programs. We define a l...
Static analysis of program semantics can be used to provide strong guarantees about the correctness ...
Several induction theorem provers were developed to verify functional programs mechanically. Unfortu...
Abstract: Sparkle is a proof assistant designed for the lazy evaluating functional programming langu...
This paper reconstructs and extends the automatic verification technique of Le Metayer, Proving prop...
The original publication is available at www.springerlink.com. Abstract. In order to support the ver...
Abstract. We consider the problem of automated program verification with emphasis on reasoning about...
The object of this paper is to study the mechanism of recursion in a simple, LISP-like programming l...
We describe a proof by a computer program of the Turing completeness of a computational paradigm aki...
Three studies in the machine assisted proof of recursion implementation are described. The verifica...
This is one of a series of memos concerning a logical system for proof-checking. It is not self-cont...
AbstractInductive methods are basic to program proving and this paper presents the formal part of a ...
Program verication is the idea that properties of programs can be precisely stated and proved in the...
We describe work in progress on an automatic theorem prover for recursive function theory that we in...
Centre for Intelligent Systems and their ApplicationsThis thesis describes the results of two studie...
We present a technique for the mechanical proof of correctness properties of programs. We define a l...
Static analysis of program semantics can be used to provide strong guarantees about the correctness ...
Several induction theorem provers were developed to verify functional programs mechanically. Unfortu...
Abstract: Sparkle is a proof assistant designed for the lazy evaluating functional programming langu...
This paper reconstructs and extends the automatic verification technique of Le Metayer, Proving prop...
The original publication is available at www.springerlink.com. Abstract. In order to support the ver...
Abstract. We consider the problem of automated program verification with emphasis on reasoning about...
The object of this paper is to study the mechanism of recursion in a simple, LISP-like programming l...
We describe a proof by a computer program of the Turing completeness of a computational paradigm aki...
Three studies in the machine assisted proof of recursion implementation are described. The verifica...
This is one of a series of memos concerning a logical system for proof-checking. It is not self-cont...
AbstractInductive methods are basic to program proving and this paper presents the formal part of a ...