Theorem Prover Examples
This chapter contains several examples and their solutions. Each section will start with an English description of a problem or will contain phrases such as “Why?” and “Prove the following.” When you reach such a phrase, we recommend that you stop and work out a solution before reading further. Usually this will require that you define functions, translate informal correctness criteria into ACL2, and perhaps prove (on paper) the main theorem. Once you have a pencil and paper proof, think about how to decompose the proof into ACL2 rules and use the theorem prover to check your proof; you can then compare your results with ours.
KeywordsCanonical Form Binary Number Full Adder Induction Scheme Commutative Function
Unable to display preview. Download preview PDF.
- 1.In GCL it is best to enter raw Lisp first and execute (si:: use-fast-links nil) to prevent a stack overflow from manifesting itself as a segmentation error.Google Scholar
- 2.Statistics supplied by accumulated-persistence can be used to identify rules that blow up ACL2’s search space.Google Scholar