An Overview of Rewrite Rule Laboratory (RRL)

RRL (Rewrite Rule Laboratory) was originally developed as an environment for experimenting with automated reasoning algorithms for equational logic based on rewrite techniques. It has now matured into a full-edged theorem prover which has been used to solve hard and challenging mathematical problems in automated reasoning literature as well as a research tool for investigating the use of formal methods in hardware and software design. We provide a brief historical account of development of RRL and its descendants , give an overview of the main capabilities of RRL and conclude with a discussion of applications of RRL.

[1]  Robert L. Veroff.  Canonicalization and Demodulation , 1981 .

[2]  Alan Bundy,et al.  The Use of Explicit Plans to Guide Inductive Proofs , 1988, CADE.

[3]  Greg Nelson,et al.  Fast Decision Procedures Based on Congruence Closure , 1980, JACM.

[4]  Robert E. Shostak,et al.  Deciding Combinations of Theories , 1982, JACM.

[5]  Robert S. Boyer,et al.  A computational logic handbook , 1979, Perspectives in computing.

[6]  Greg Nelson,et al.  Simplification by Cooperating Decision Procedures , 1979, TOPL.

[7]  Larry Wos,et al.  Automated reasoning - 33 basic research problems , 1988 .

[8]  Deepak Kapur,et al.  Consider Only General Superpositions in Completion Procedures , 1989, RTA.

[9]  Robert E. Tarjan,et al.  Variations on the Common Subexpression Problem , 1980, J. ACM.

[10]  Paliath Narendran,et al.  Hardware Verification in the Interactive VHDL Workstation , 1988 .

[11]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[12]  Deepak Kapur,et al.  Proof by Consistency , 1987, Artif. Intell..

[13]  Joseph A. Goguen,et al.  How to Prove Algebraic Inductive Hypotheses Without Induction , 1980, CADE.

[14]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[15]  Paliath Narendran,et al.  Complexity of Matching Problems , 1987, J. Symb. Comput..

[16]  Wolfgang Küchlin,et al.  Inductive Completion by Ground Proof Transformation , 1989 .

[17]  Deepak Kapur,et al.  A Mechanizable Induction Principle for Equational Specifications , 1988, CADE.

[18]  Paliath Narendran,et al.  Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure , 1988, J. Symb. Comput..

[19]  Deepak Kapur,et al.  First-Order Theorem Proving Using Conditional Rewrite Rules , 1988, CADE.

[20]  Paliath Narendran,et al.  Proof by Induction Using Test Sets , 1986, CADE.

[21]  Mark E. Stickel,et al.  Complete Sets of Reductions for Some Equational Theories , 1981, JACM.

[22]  Hantao Zhang,et al.  Using Algebraic Specification in Floyd-Hoare Assertions , 1991, AMAST.

[23]  Paliath Narendran,et al.  Matching, unification and complexity , 1987, SIGS.

[24]  DavisMartin,et al.  A machine program for theorem-proving , 1962 .

[25]  Deepak Kapur,et al.  RRL: A Rewrite Rule Laboratory , 1986, CADE.

[26]  Michaël Rusinowitch,et al.  A New Method for Establishing Refutational Completeness in Theorem Proving , 1986, CADE.

[27]  Larry Wos,et al.  Automated Reasoning: Introduction and Applications , 1984 .

[28]  Jieh Hsiang,et al.  Refutational Theorem Proving Using Term-Rewriting Systems , 1985, Artif. Intell..

[29]  Bruno Buchberger,et al.  A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm , 1983, SIGS.

[30]  Donald E. Knuth,et al.  Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .

[31]  N. A C H U M D E R S H O W I T Z.  Termination of Rewriting' , 2022 .

[32]  Gérard P. Huet,et al.  Proofs by induction in equational theories with constructors , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[33]  David Basin,et al.  The Boyer-Moore Prover and Nuprl: an experimental comparison , 1991 .

[34]  Jean-Pierre Jouannaud,et al.  Proofs by induction in equational theories without constructors , 1985, Bull. EATCS.

[35]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.

[36]  Hantao Zhang,et al.  Automated Proof of Ring Commutativity Problems by Algebraic Methods , 1990, J. Symb. Comput..

[37]  Murray Hill,et al.  Yacc: Yet Another Compiler-Compiler , 1978 .

[38]  Deepak Kapur,et al.  The Tecton Proof System , 1991, RTA.

[39]  Robert S. Boyer,et al.  Integrating decision procedures into heuristic theorem provers: a case study of linear arithmetic , 1988 .

[40]  Matt Kaufmann.  An Interactive Enhancement to the Boyer-Moore Theorem Prover , 1988, CADE.

[41]  Deepak Kapur,et al.  A New Method for Proving Termination of AC-Rewrite Systems , 1990, FSTTCS.

[42]  Jim Christian,et al.  Fast Knuth-Bendix Completion: Summary , 1989, International Conference on Rewriting Techniques and Applications.

[43]  David R. Musser,et al.  The AFFIRM Theorem Prover: Proof Forests and Management of Large Proofs , 1980, CADE.

[44]  Louis Hodes,et al.  Solving Problems by Formula Manipulation in Logic and Linear Inequalities , 1971, IJCAI.

[45]  Paliath Narendran,et al.  Formal verification of the Sobel image processing chip , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[46]  David R. Musser,et al.  On proving inductive properties of abstract data types , 1980, POPL '80.

[47]  E. Schmidt,et al.  Lex—a lexical analyzer generator , 1990 .

[48]  Gerald E. Peterson,et al.  Complete Sets of Reductions with Constraints , 1990, CADE.

[49]  Mark E. Stickel,et al.  A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering That x³=x Implies Ring Commutativity , 1984, CADE.

[50]  D. Kapur,et al.  Reduction, superposition and induction: automated reasoning in an equational logic , 1988 .