Combining nonstably infinite theories

Journal of Automated Reasoning

Volumn 34, Issue 3, 2005, Pages 209-238

  Tinelli, Cesare ^a   Zarba, Calogero G ^b  

^a University of Iowa   (United States)

^b University of New Mexico   (United States)

Author keywords

Combination of decision procedures; Nelson Oppen method

Indexed keywords

CONSTRAINT THEORY; CRYSTAL LATTICES; DECISION THEORY; MATHEMATICAL MODELS;

COMBINATION OF DECISION PROCEDURES; NELSON-OPPEN METHOD; NONSTABLY INFINITE THEORIES; PARTIAL ORDERS;

MATERIALS SCIENCE;

EID: 33646176117     PISSN: 01687433     EISSN: 15730670     Source Type: Journal    
DOI: 10.1007/s10817-005-5204-9     Document Type: Article

References (29)

1. Baader, F. and Tinelli, C.: A new approach for combining decision procedure for the word problem, and its connection to the Nelson-Oppen combination method, in W. McCune (ed.), Automated Deduction - CADE-14, Lecture Notes in Comput. Sci. 1249, Springer, 1997, pp. 19-33.
2. Barrett, C. W., Dill, D. L. and Stump, A.: A generalization of Shostak's method for combining decision procedures, in A. Armando (ed.), Frontiers of Combining Systems, Lecture Notes in Comput. Sci. 2309, Springer, 2002, pp. 132-146.
3. Bernays, P. and Schönfinkel, M.: Zum Entscheidungsproblem der mathematischen Logic, Math. Ann. 99 (1928), 342-372.
4. Cantone, D. and Zarba, C. G.: A decision procedure for monotone functions over lattices, in F. Buccafurri (ed.), Joint Conference on Declarative Programming APPIA-GULP-PRODE 2003, pp. 1-12.
5. Craigen, D., Kromodimoeljo, S., Meisels, I., Pase, B. and Saaltink, M.: EVES: An overview, in S. Prehen and H. Toetenel (eds.), Formal Software Development Methods, Lecture Notes in Comput. Sci. 552, Springer, 1991, pp. 389-405.
6. Detlefs, D., Nelson, G. and Saxe, J. B.: Simplify: A theorem prover for program checking, Technical Report HPL-2-3-148, HP Laboratories, Palo Alto, CA, 2003.
7. Ganzinger, H.: Shostak light, in A. Voronkov (ed.), Automated Deduction - CADE-18, Lecture Notes in Comput. Sci. 2392, Springer, 2002, pp. 332-346.
8. Ganzinger, H., Sofronie-Stokkermans, V. and Waldmann, U.: Modular proof systems for partial functions with weak equality, in D. Basin and M. Rusinowitch (eds.), Automated Reasoning, Lecture Notes in Comput. Sci. 3097, Springer, 2004, pp. 168-182.
9. Garey, M. R. and Johnson, D. S.: Computers and Intractability, W. H. Freeman & Co., 1979.
10. Ghilardi, S.: Quantifier elimination and provers integration, in I. Dahn and L. Vigneron (eds.), First Order Theorem Proving, Electronic Notes in Theoret. Comput. Sci. 86.1, Elsevier, 2003.
11. Hodges, W.: A Shorter Model Theory, Cambridge University Press, 1997.
12. Levy, B., Filippenko, I., Marcus, L. and Menas, T.: Using the state delta verification system (SDVS) for hardware verification, in T. F. Melham, V. Stavridou and R. T. Boute (eds.), Theorem Prover in Circuit Design: Theory, Practice and Experience, Elsevier Science, 1992, pp. 337-360.
13. Manna, Z. and Zarba, C. G.: Combining decision procedures, in Formal Methods at the Cross Roads: From Panacea to Foundational Support, Lecture Notes in Comput. Sci. 2757, Springer, 2003, pp. 381-422.
14. Nelson, G.: Techniques for program verification, Technical Report CSL-81-10, Xerox Palo Alto Research Center, 1981.
15. Nelson, G. and Oppen, D. C.: Simplification by cooperating decision procedures, ACM Trans. on Programming Languages and Systems 1(2) (1979), 245-257.
16. Oppen, D. C.: Complexity, convexity and combination of theories, Theoret. Comput. Sci. 12 (1980), 291-302.
17. Pnueli, A., Rodeh, Y., Strichman, O. and Siegel, M.: Deciding equality formulas by small domains instantiations, in N. Halbwachs and D. Peled (eds.), Computer Aided Verification, Lecture Notes in Comput. Sci. 1633, Springer, 1999, pp. 455-469.
18. Ramsey, F. P.: On a problem in formal logic, Proc. London Math. Soc. 30 (1930), 264-286.
19. Ringeissen, C.: Cooperation of decision procedures for the satisfiability problem, in F. Baader and K. U. Schulz (eds.), Frontiers of Combining Systems, Applied Logic Series 3, Kluwer Academic Publishers, 1996, pp. 121-140.
20. Stump, A., Barret, C. W. and Dill, D. L.: CVC: A cooperating validity checker, in E. Brinksma and K. G. Larsen (eds.), Computer Aided Verification, Lecture Notes in Comput. Sci. 2404, 2002, pp. 500-504.
21. Tinelli, C.: Cooperation of background reasoners in theory reasoning by residue sharing, J. Automated Reasoning 30(1) (2003), 1-31.
22. Tinelli, C. and Harandi, M. T.: A new correctness proof of the Nelson-Oppen combination procedure, in F. Baader and K. U. Schulz (eds.), Frontiers of Combining Systems, Applied Logic Series 3, Kluwer Academic Publishers, 1996, pp. 103-120.
23. Tinelli, C. and Ringeissen, C.: Unions of non-disjoint theories and combinations of satisfiability procedures, Theoret. Comput. Sci. 290(1) (2003), 291-353.
24. Tinelli, C. and Zarba, C.G.: Combining non-stably infinite theories, in I. Dahn and L. Vigneron (eds.), First Order Theorem Proving, Electronic Notes in Theoret. Comput. Sci. 86.1, Elsevier, 2003.
25. Zarba, C. G.: Combining lists with integers, in R. Gore, A. Leitsch and T. Nipkow (eds.), Automated Reasoning: Short Papers, Technical Report DII 11/01, Università di Siena, Italy, 2001, pp. 170-179.
26. Zarba, C. G.: Combining multisets with integers, in A. Voronkov (ed.), Automated Deduction - CADE-18, Lecture Notes in Comput. Sci. 2392, Springer, 2002, pp. 363-376.
27. Zarba, C. G.: Combining sets with integers, in A. Armando (ed.), Frontiers of Combining Systems, Lecture Notes in Comput. Sci. 2309, Springer, 2002, pp. 103-116.
28. Zarba, C. G.: C-tableaux, Technical Report RR-5229, INRIA, 2004.
29. Zarba, C. G.: The combination problem in automated reasoning, Ph.D. thesis, Stanford University, 2004.