Results 1 
2 of
2
Proving Theorems about LISP Functions
, 1975
"... 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 ..."
Abstract

Cited by 53 (2 self)
 Add to MetaCart
(Show Context)
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 theoremproving, structural induction, program verification cr categories: 3.64, 4.22, 5.21 1 Introduction We are concerned with proving theorems in a firstorder theory of lists, akin to the elementary theory of numbers. We use a subset of LISP as our language because recursive list processing functions are easy to write in LISP and because ...
On Automatically Generating and Using Examples in a Computational Logic System @shortTitle(Generating and Using Examples)
, 1987
"... appeared as the author’s dissertation. foo Throw this page away. It’s here solely for the numbering. 1 ..."
Abstract
 Add to MetaCart
(Show Context)
appeared as the author’s dissertation. foo Throw this page away. It’s here solely for the numbering. 1