Canonization for disjoint unions of theories

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2741, Issue , 2003, Pages 197-211

  Krstić, Sava ^a   Conchon, Sylvain ^b  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

^b ECOLE DES MINES DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; ALGORITHMS; ARTIFICIAL INTELLIGENCE; DECISION THEORY; SET THEORY;

CANONICAL FORM; CANONIZERS; DECISION PROCEDURE; FIRST ORDER THEORIES; S-METHOD; CANONIZATION; DISJOINT UNIONS; FIRST-ORDER THEORIES; SHOSTAK THEORY;

THEOREM PROVING; PROGRAMMING THEORY;

EID: 7044247198     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45085-6_16     Document Type: Conference Paper

References (21)

1. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, United Kingdom, 1998
2. F. Baader and C. Tinelli. Deciding the word problem in the union of equational theories. Information and Computation, 178:346–390, 2002
3. C. Barrett. Checking Validity of Quantifier-free formulas in Combinations of First-Order Theories. PhD thesis, Stanford University, 2002
4. C. Barrett, D. Dill, and J. Levitt. Validity checking for combinations of theories with equality. In M. Srivas and A. Camilleri, editors, Formal Methods In Computer-Aided Design, volume 1166 of Lecture Notes in Computer Science, pages 187–201. Springer, 1996
5. C. W. Barrett, D. L. Dill, and A. Stump. A generalization of Shostak’s method for combining decision procedures. In Frontiers of Combining Systems (FROCOS), volume 2309 of Lecture Notes in Artificial Intelligence, pages 132–147. Springer, 2002
6. N. Bjørner et al. Deductive-algorithmic verification of reactive and real-time systems. In R. Alur and T. A. Henzinger, editors, Proc. of the 8th International Conference on Computer-Aided Verification, volume 1102 of Lecture Notes in Computer Science, pages 415–418. Springer, 1996
7. S. Conchon and S. Krstić. Strategies for combining decision procedures. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Lecture Notes in Computer Science. Springer, 2003. to appear
8. D. Cyrluk, P. Lincoln, and N. Shankar. On Shostak’s decision procedure for combinations of theories. In M. A. McRobbie and J. K. Slaney, editors, Automated Deduction—CADE-13, number 1104 in Lecture Notes in Artificial Intelligence, pages 463–477. Springer, 1996
9. H. Ganzinger. Shostak light. In A. Voronkov, editor, Automated Deduction–CADE-18, volume 2392 of Lecture Notes in Artificial Intelligence, pages 332–347. Springer, 2002
10. D. Kapur. A rewrite rule based framework for combining decision procedures. In Frontiers of Combining Systems (FROCOS), volume 2309 of Lecture Notes in Artificial Intelligence, pages 87–103. Springer, 2002
11. S. Krstić and S. Conchon. Canonization for disjoint union of theories. Technical Report CSE-03-003, OHSU, 2003
12. Z. Manna and C. G. Zarba. Combining decision procedures. In Formal Methods at the Cross Roads: From Panacea to Foundational Support, Lecture Notes in Computer Science. Springer, 2003. To appear
13. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245–257, 1979
14. S. Owre, J. Rushby, N. Shankar, and F. von Henke. Formal verification for faulttolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2):107–125, 1995
15. D. Pigozzi. The join of equational thories. Colloquium Mathematicum, 30:15–25, 1974
16. H. Rueß and N. Shankar. Deconstructing Shostak. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science (LICS-01), pages 19–28. IEEE Computer Society, 2001
17. N. Shankar. Little engines of proof. In L.-H. Eriksson and P. Lindsay, editors, FME 2002: Formal Methods-Getting IT Right, pages 1–20, Copenhagen, July 2002. Springer
18. N. Shankar and H. Rueß. Combining Shostak theories. In S. Tison, editor, Rewriting Techniques and Applications (RTA), volume 2378 of Lecture Notes in Computer Science, pages 1–19. Springer, 2002
19. R. E. Shostak. Deciding combinations of theories. Journal of the ACM, 31(1):1–12, 1984
20. C. Tinelli and M. T. Harandi. A new correctness proof of the Nelson–Oppen combination procedure. In F. Baader and K. U. Schulz, editors, Frontiers of Combining Systems: Proceedings of the 1st International Workshop (Munich, Germany), Applied Logic, pages 103–120. Kluwer, 1996
21. C. Tinelli and C. Ringeissen. Unions of non-disjoint theories and combinations of satisfiability procedures. Theoretical Computer Science, 290:291–353, 2003.