Proving theorems about LISP functions

Authors:
Robert S. Boyer;J. Strother Moore
Affiliations:
Department of Computational Logic, University of Edinburgh, Scotland;Department of Computational Logic, University of Edinburgh, Scotland
Venue:
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Year:
1973

Citing 4
Cited 4

Implementation and applications of Scott's logic for computable functions

Proceedings of ACM conference on Proving assertions about programs
Toward a man-machine system for proving program correctness

Toward a man-machine system for proving program correctness
A program verifier

A program verifier
Verification of apl-programs.

Verification of apl-programs.

Gentzen-type formal, system representing properties of function and its implementation

IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Automatic program synthesis from example problems

IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Knowledge and reasoning in program synthesis

IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Strategic Issues, Problems and Challenges in Inductive Theorem Proving

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe some simple heuristics combining evaluation and mathematical induction which we 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. Appendix B contains a list of the theorems proved by the program.