An overview of Rewrite Rule Laboratory (RRL)

Abstract 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-fledged 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]  Paliath Narendran,et al.  Matching, unification and complexity , 1987, SIGS.

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

[3]  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.

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

[5]  Frank van Harmelen,et al.  Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs , 1990, CADE.

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

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

[8]  H. Brown,et al.  Computational Problems in Abstract Algebra , 1971 .

[9]  Hantao Zhang,et al.  Axiomatic semantics of a hardware specification language , 1992, [1992] Proceedings of the Second Great Lakes Symposium on VLSI.

[10]  Hantao Zhang,et al.  FRI: Failure-Resistant Induction in RRL , 1992, CADE.

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

[12]  Hantao Zhang,et al.  Implementing Contextual Rewriting , 1992, CTRS.

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

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

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

[16]  Hantao Zhang.  A Case Study of Completion Modulo Distributivity and Abelian Groups , 1993, RTA.

[17]  Hantao Zhang,et al.  Proving the Chinese Remainder Theorem by the Cover Set Induction , 1992, CADE.

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

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

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

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

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

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

[24]  Nachum Dershowitz,et al.  Termination of Rewriting , 1987, J. Symb. Comput..

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

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

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

[28]  Gérard P. Huet,et al.  Proofs by Induction in Equational Theories with Constructors , 1980, FOCS.

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

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

[31]  William McCune,et al.  OTTER 1.0 Users' Guide , 1990 .

[32]  Hantao Zhang.  A New Method for the Boolean Ring Based Theorem Proving , 1994, J. Symb. Comput..

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

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

[35]  Paliath Narendran,et al.  Double-exponential complexity of computing a complete set of AC-unifiers , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[36]  Hantao Zhang,et al.  Formal semantics of VHDL for verification of circuit designs , 1993, Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93.

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

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

[39]  Paliath Narendran,et al.  Automating Inductionless Induction Using Test Sets , 1991, J. Symb. Comput..

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

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