Toward an Architecture for Open Mechanized Reasoning Systems

Our long-term goal is the development of a general framework for specifying, structuring, and interoperating provers. Our main focus is on the formalization of the architectural and implemen- tational choices that underlie the construction of such systems. This paper has two main goals. The first is to introduce the main intuitions underlying the proposed framework. We concentrate on its use in the integration of provers. The second is the development of the notion of reasoning theory, meant as the formalization of the notion of "implementation of the logic" of a prover. As an example we sketch an analysis, at the reasoning theory level, of the integration of linear arithmetic into the NQTHM simplification process.

[1]  D. Prawitz Natural Deduction: A Proof-Theoretical Study , 1965 .

[2]  Dana S. Scott,et al.  Rules and Derived Rules , 1974 .

[3]  Richard W. Weyhrauch,et al.  Prolegomena to a theory of formal reasoning , 1978 .

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

[5]  Michael J. C. Gordon,et al.  Edinburgh LCF: A mechanised logic of computation , 1979 .

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

[7]  S. Feferman Inductively Presented Systems and the Formalization of Meta-Mathematics , 1982 .

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

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

[10]  Dale Miller,et al.  A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification , 1991, J. Log. Comput..

[11]  Robert L. Constable,et al.  The semantics of reflected proof , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[12]  Thomas Kropf,et al.  Automating Most Parts of Hardware Proofs in HOL , 1991, CAV.

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

[14]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[15]  Lie Yang,et al.  Linking Other Theorem Provers to HOL Using PM: Proof Manager , 1992, TPHOLs.

[16]  Natarajan Shankar,et al.  PVS: A Prototype Verification System , 1992, CADE.

[17]  Furio Honsell,et al.  A framework for defining logics , 1993, JACM.

[18]  Carolyn L. Talcott,et al.  A Theory of Binding Structures and Applications to Rewriting , 1993, Theor. Comput. Sci..

[19]  John Harrison,et al.  Extending the HOL Theorem Prover with a Computer Algebra System to Reason about the Reals , 1993, HUG.

[20]  Lawrence C. Paulson,et al.  Isabelle: The Next 700 Theorem Provers , 2000, ArXiv.

[21]  Jeffrey J. Joyce,et al.  The HOL-Voss System: Model-Checking inside a General-Purpose Theorem-Prover , 1993, HUG.

[22]  S. Feferman Finitary inductively presented logics , 1994 .

[23]  Jacques Calmet,et al.  Theorems and algorithms: an interface between Isabelle and Maple , 1995, ISSAC '95.

[24]  Natarajan Shankar,et al.  An Integration of Model Checking with Automated Proof Checking , 1995, CAV.

[25]  Mary Shaw,et al.  Software architecture - perspectives on an emerging discipline , 1996 .

[26]  Fausto Giunchiglia,et al.  Towards provably correct system synthesis and extension , 1996, Future Gener. Comput. Syst..

[27]  J. Meseguer,et al.  Rewriting Logic as a Logical and Semantic Framework , 1996 .

[28]  Douglas R. Smith,et al.  Planware-domain-specific synthesis of high-performance schedulers , 1998, Proceedings 13th IEEE International Conference on Automated Software Engineering (Cat. No.98EX239).

[29]  Piergiorgio Bertoli,et al.  A Structured Approach to the Formal Certification of Safety of Computer Aided Development Tools , 1998, SAFECOMP.

[30]  Alessandro Armando,et al.  From Integrated Reasoning Specialists to "Plug-and-Play" Reasoning Components , 1998, AISC.

[31]  Piergiorgio Bertoli,et al.  Specification and Integration of Theorem Provers and Computer Algebra Systems , 1998, Fundam. Informaticae.

[32]  Fausto Giunchiglia,et al.  Composing and Controlling Search in Reasoning Theories Using Mappings , 2000, FroCoS.