Canonization for disjoint unions of theories

If there exist efficient procedures (canonizers) for reducing terms of two first-order theories to canonical form, can one use them to construct such a procedure for terms of the disjoint union of the two theories? We prove this is possible whenever the original theories are convex. As an application, we prove that algorithms for solving equations in the two theories (solvers) can not be combined in a similar fashion. These results are relevant to the widely used Shostak's method for combining decision procedures for theories. They provide the first rigorous answers to the questions about the possibility of directly combining canonizers and solvers.

[1]  Calogero G. Zarba,et al.  Combining Decision Procedures , 2002, 10th Anniversary Colloquium of UNU/IIST.

[2]  Natarajan Shankar,et al.  On Shostak's Decision Procedure for Combinations of Theories , 1996, CADE.

[3]  D. Pigozzi.  The join of equational theories , 1974 .

[4]  David L. Dill,et al.  Validity Checking for Combinations of Theories with Equality , 1996, FMCAD.

[5]  Cesare Tinelli,et al.  A New Correctness Proof of the {Nelson-Oppen} Combination Procedure , 1996, FroCoS.

[6]  Peter A. Lindsay,et al.  FME 2002:Formal Methods—Getting IT Right , 2002, Lecture Notes in Computer Science.

[7]  Deepak Kapur.  A Rewrite Rule Based Framework for Combining Decision Procedures , 2002, FroCoS.

[8]  Sylvain Conchon,et al.  Strategies for combining decision procedures , 2003, Theor. Comput. Sci..

[9]  Natarajan Shankar,et al.  Combining Shostak Theories , 2002, RTA.

[10]  Harald Ganzinger,et al.  Superposition Modulo a Shostak Theory , 2003, CADE.

[11]  Natarajan Shankar,et al.  Deconstructing Shostak , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[12]  Natarajan Shankar,et al.  Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS , 1995, IEEE Trans. Software Eng..

[13]  Harald Ganzinger,et al.  Shostak Light , 2002, CADE.

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

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

[16]  Cesare Tinelli,et al.  Deciding the Word Problem in the Union of Equational Theories , 1998, Inf. Comput..

[17]  Cesare Tinelli,et al.  Unions of non-disjoint theories and combinations of satisfiability procedures , 2003, Theor. Comput. Sci..

[18]  Edward Y. Chang,et al.  STeP: Deductive-Algorithmic Verification of Reactive and Real-Time Systems , 1996, CAV.

[19]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[20]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[21]  Clark W. Barrett,et al.  Ph.D. thesis: Checking the validity of quantifier-free formulas in combinations of first-order theories , 2003 .

[22]  David L. Dill,et al.  A Generalization of Shostak's Method for Combining Decision Procedures , 2002, FroCoS.

[23]  N. Shankar.  Little Engines of Proof , 2002, FME.