Automated Theorem Proving for Analysis and Synthesis of Computations

This paper explores two aspects of automated theorem proving for sup­port of computer software and hardware development: rewriting techniques for equational and inductive reasoning; and construction of proof trees represent­ing key steps of a proof, as an aid to interactive proof search and as a basis for synthesis of computations.

[1]  Mark E. Stickel.  A Complete Unification Algorithm for Associative-Commutative Functions , 1975, IJCAI.

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

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

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

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

[6]  Nachum Dershowitz,et al.  Canonical Conditional Rewrite Systems , 1988, CADE.

[7]  Yoshihito Toyama,et al.  How to Prove Equivalence of Term Rewriting Systems Without Induction , 1986, Theor. Comput. Sci..

[8]  Thierry Coquand,et al.  Constructions: A Higher Order Proof System for Mechanizing Mathematics , 1985, European Conference on Computer Algebra.

[9]  Rod M. Burstall,et al.  Proving Properties of Programs by Structural Induction , 1969, Comput. J..

[10]  Alan Bundy,et al.  The Computer Modelling of Mathematical Reasoning , 1983 .

[11]  Hantao Zhang,et al.  Contextual Rewriting , 1985, RTA.

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

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

[14]  Pierre Lescanne,et al.  Computer experiments with the REVE term rewriting system generator , 1983, POPL '83.

[15]  Zohar Manna,et al.  A Deductive Approach to Program Synthesis , 1979, TOPL.

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

[17]  Nachum Dershowitz,et al.  Orderings for term-rewriting systems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[18]  Trevor Evans,et al.  The Word Problem for Abstract Algebras , 1951 .

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

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

[21]  Albrecht Fortenbacher.  An algebraic approach to unification under associativity and commutativity , 1985 .

[22]  Zohar Manna,et al.  Proving termination with multiset orderings , 1979, CACM.

[23]  Rance Cleaveland,et al.  Implementing mathematics with the Nuprl proof development system , 1986 .

[24]  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).

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

[26]  David A. Plaisted,et al.  A Simple Non-Termination Test for the Knuth-Bendix Method , 1986, CADE.

[27]  Gérard Huet,et al.  On the Uniform Halting Problem for Term Rewriting Systems , 1978 .

[28]  G. Huet,et al.  Equations and rewrite rules: a survey , 1980 .

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

[30]  Robert L. Constable,et al.  Proofs as programs , 1985, TOPL.

[31]  M. Newman.  On Theories with a Combinatorial Definition of "Equivalence" , 1942 .

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

[33]  David R. Musser.  AIDS to hierarchical specification structuring and reusing theorems in AFFIRM-85 , 1985, SOEN.

[34]  Nachum Dershowitz,et al.  Rewrite Methods for Clausal and Non-Clausal Theorem Proving , 1983, ICALP.