Abstract
The objective of this report is to convey the essential idea of a proof by the Boyer-Moore theorem prover of the correctness of a parser. The proof required a total of 147 functions and lemmas — all of which have been listed in the appendix of [4].
Included in the following text are a description of the original problem submitted to the theorem prover and a sketch of the resultant proof, together with a discussion of the reasons that induced us to introduce some auxiliary functions. The report also contains the computer-generated proof of one of the main lemmas: INIT.SEG. The complete proof is available from the author.
We conclude with some remarks on our experiment and comments on the use of the theorem prover.
Supported by a grant from I.R.I.A. and ONR contract N00014-75-C-0816.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Robert S. Boyer, J Strother Moore. A Computer Proof of the Correctness of a Simple Optimizing Compiler of Expressions. Technical Report N00014-75-C-0816-SRI-4079, SRI International, Menlo-Park, California 94025, January, 1977.
Robert S. Boyer, J Strother Moore. A Theorem Prover for Recursive Functions: a User's Manual. CSL-91, NR 049-378, SRI International, Menlo-Park, California 94025, June, 1979.
R. S. Boyer and J S. Moore. A Computational Logic. Academic Press Inc., New York, 1979.
P. Y Gloess. A Proof of the Correctness of a Simple Parser of Expressions by the Boyer-Moore System. Technical Report N00014-75-C-0816-SRI-7, SRI International, Menlo Park, California 94025, August, 1978.
Ps, J-P Laurent. Adding Dynamic Paramodulation to Rewrite Algorithms. Technical Report CSL-102, SRI International, Menlo Park, CA94025, December, 1979.
G. Huet. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. Rapport Laboria no250, IRIA-LABORIA, Domaine de Voluceau, 78150 Le Chesnay, France, August, 1977.
G. Huet. Equations and Rewrite Rules: a Survey. CSL-111, SRI International, Menlo Park, California 94025, January, 1980.
D. E. Knuth and P. G. Bendix. Simple Word Problems in Universal Algebras. In J. Leech, Ed., Computational Problems in Abstract Algebra, Pergamon Press, New York, 1970, pp. 263–297.
D. S. Lankford. Canonical Inference. Automatic Theorem Proving Project Report ATP-32, University of Texas, December, 1975.
J S. Moore. A Mechanical Proof of Takeuchi's Function. Information Processing Letters 9, 4 (November 1980), 176–181.
D. R. Musser. Convergent Sets of Rewrite Rules for Abstract Data Types. USC Information Sciences Institute, 4676 Admiralty Way, Marina del Rey, California 90291, December, 1978. Extended Abstract
R. E. Shostak. An Algorithm for Reasoning About Equality. Communications of the ACM 21, 7 (July 1978), 583–585.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gloess, P.Y. (1980). An experiment with the Boyer-Moore theorem prover: A proof of the correctness of a simple parser of expressions. In: Bibel, W., Kowalski, R. (eds) 5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980. CADE 1980. Lecture Notes in Computer Science, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10009-1_13
Download citation
DOI: https://doi.org/10.1007/3-540-10009-1_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10009-6
Online ISBN: 978-3-540-38140-2
eBook Packages: Springer Book Archive