Automatic proof of correctness of a binary addition algorithm

Authors:
J. Strother Moore
Affiliations:
Xerox Palo Alto Research Center, Palo Alto, CA
Venue:
ACM SIGART Bulletin
Year:
1975

Citing 1
Cited 1

Proving Theorems about LISP Functions

Journal of the ACM (JACM)

A lemma driven automatic theorem prover for recursive function theory

IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Boyer-Moore Pure LISP Theorem Prover ([1], [2], and [3]) has recently proved the correctness of a program implementing binary addition with a carry flag. Because of the relative complexity of the binary addition algorithm and the automatic nature of the proof, this result was thought interesting enough to warrant this technical note.