M. Kaufmann and P. Pecchairi. Interaction with the Boyer-Moore theorem prover: A tutorial study using the arithmetic-geometric mean theorem. J. Automated Reasoning, 16(1--2):181--222, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of the structure of the prover, describes the logic of the prover (both formally and informally) describes the commands for using it (both abstractly and with examples) and includes an installation guide. Also of interest is a brief tutorial on interaction with the Boyer Moore theorem prover [Kaufmann and Pecchairi, 1996]. Whereas the Boyer Moore program sets the standard for applications focusing on proving properties of programs and algorithms, McCune s program OTTER [McCune, 1990] has become the benchmark for proving theorems from various fields of mathematics and logic. OTTER is written in C and runs on ....

M. Kaufmann and P. Pecchairi. Interaction with the Boyer-Moore theorem prover: A tutorial study using the arithmetic-geometric mean theorem. J. Automated Reasoning, 16(1--2):181--222, 1996.

....(p reverse x) p first elem x) Finding these intermediate lemmas is the art of proving theorems with ACL2, and also with Nqthm. Much has been written on the process of finding these key lemmas. Besides [BM88] and [BM79] the reader interested in using ACL2 is especially encouraged to read [KP94]. While the development above is illustrative of how ACL2 can be used to prove program correctness, it tells only part of the story. In particular, our correctness result would still hold if p gray seq were replaced with the zero function What is missing are the assertions that p gray seq ....

Matt Kaufmann and Paolo Pecchiari. Interaction with the BoyerMoore theorem prover: A tutorial study using the arithmeticgeometric mean theorem. Technical Report 100, Computational Logic, Inc., 1994.

....and their proofs. Although Mural (Jones et al. 1991) has enjoyed some success, state of the art systems such as Nqthm are not practical for all but a small coterie of dedicated users. Perusal of tutorials such as those found within the pages of Boyer and Moore (1988) or even more extensively in Kaufmann and Pecchiari (1994) demonstrate why this is so. A proof attempt is a marathon effort involving interpreting screenfuls of text and spotting missing lemmas. Entering the mindset of a formal prover is difficult for users more accustomed to rigorous proof styles yet the current systems make no concessions, nor do they ....

M Kaufmann and P Pecchiari. Interaction with the Boyer--Moore Theorem Prover: A Tutorial Study Using the Arithmetic-Geometric Mean Theorem. Technical Report 100, Computational Logic Inc., August, 1994.

....therein. Analogous instruction apply to Pc Nqthm 1992. Nqthm is documented in two books [8, 11] and Pc Nqthm is documented in [20, 21, 22] Both systems and many of their applications are briefly described in [7] A detailed tutorial introduction to Nqthm and Pc Nqthm may be found in [24]. The recent Nqthm 1992 release includes 1.3 megabytes of updated documentation consisting of new versions of the five most important chapters in [11] In addition, the releases include more than 17 megabytes of example input for Nqthm and Pc Nqthm, including most of the important benchmarks ....

M. Kaufmann and P. Pecchiari. Interaction with the Boyer-Moore Theorem Prover: A Tutorial Study Using the Arithmetic-Geometric Mean Theorem, Technical Report 102, Computational Logic, Inc., 1994.

....explains how we scaled up Nqthm s logic to Common Lisp, preserving the use of total functions within the logic but achieving Common Lisp execution speeds. 1 History ACL2 is a direct descendent of the Boyer Moore system, Nqthm [8, 12] and its interactive enhancement, Pc Nqthm [21, 22, 23] See [7, 25] for introductions to the two ancestral systems. ACL2 stands for A Computational Logic for Applicative Common Lisp. Like Nqthm, ACL2 supports a Lisp like, first order, quantifier free mathematical logic based on recursively defined total functions. Experience with the Matt Kaufmann s ....

M. Kaufmann and P. Pecchiari. Interaction with the Boyer-Moore Theorem Prover: A Tutorial Study Using the Arithmetic-Geometric Mean Theorem, Technical Report 102, Computational Logic, Inc., 1994. Also: To appear in the Journal of Automated Reasoning.

....PcNqthm [23] See [7] for an introduction to the two ancestral systems, including a reasonably large set of references for accomplishments using the systems. A few particular successes are described in [4, 5, 10, 22, 32, 26, 36, 38] A tutorial introduction to the systems may be found in [24]. Like Nqthm, ACL2 supports a Lisp like, first order, quantifier free mathematical logic based on recursively defined total functions. Experience with the earlier systems supports the claim that such a logic is sufficiently expressive to permit one to address deep mathematical problems and ....

M. Kaufmann and P. Pecchiari. Interaction with the Boyer-Moore Theorem Prover: A Tutorial Study Using the Arithmetic-Geometric Mean Theorem. Journal of Automated Reasoning 16, no. 1-2 (1996) 181-222.

No context found.

Matt Kaufmann and Paolo Pecchiari. Interaction with the BoyerMoore theorem prover: A tutorial study using the arithmeticgeometric mean theorem. Technical Report 100, Computational Logic, Inc., 1994.

No context found.

M. Kaufmann, and P. Pecchiari, "Interaction with the Boyer-Moore theorem prover: A tutorial study using the arithmetic-geometric mean theorem," Computational Logic, Inc. Tech. Rep. 100, 1994.

No context found.

Kaufmann, M., Pecchiari, P.: Interaction with the Boyer-Moore theorem prover: A tutorial study using the arithmetic-geometric mean theorem. Computational Logic, Inc. Tech. Rep. 100. (1994)

No context found.

Kaufmann, M., Pecchiari, P.: Interaction with the Boyer-Moore theorem prover: A tutorial study using the arithmetic-geometric mean theorem. Computational Logic, Inc. Tech. Rep. 100. (1994)

No context found.

Matt Kaufmann and Paolo Pecchiari. Interaction with the BoyerMoore theorem prover: A tutorial study using the arithmeticgeometric mean theorem. Technical Report 100, Computational Logic, Inc., 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC