Automatic proof of correctness of a binary addition algorithm
暂无分享，去创建一个
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.
[1] J. Strother Moore,et al. Introducing iteration into the Pure Lisp theorem prover , 1975, IEEE Transactions on Software Engineering.
[2] Robert S. Boyer,et al. Proving Theorems about LISP Functions , 1973, JACM.
[3] J. Strother Moore,et al. Computational logic : structure sharing and proof of program properties , 1973 .