Combining decision procedures

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

Volumn 2757, Issue , 2003, Pages 381-422

  Manna, Zohar ^a   Zarba, Calogero G ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

DECISION PROCEDURE; NELSON-OPPEN COMBINATION METHODS; STATE-OF-THE-ART METHODS;

ARTIFICIAL INTELLIGENCE;

EID: 20144378549     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40007-3_24     Document Type: Article

References (61)

1. W. Ackermann. Solvable Cases of the Decision Problem. North-Holland Publishing Company, 1954.
2. F. Baader and K. U. Schulz. Combining constraint solving. In H. Comon, C. Marché, and R. Treinen, editors, Constraints in Computational Logics, volume 2002 of Lecture Notes in Computer Science, pages 104-158, 2001.
3. C. W. Barrett, D. L. Dill, and J. L. Levitt. Validity checking for combinations of theories with equality. In Formal Methods in Computer-Aided Design, volume 1166 of Lecture Notes in Computer Science, pages 187-201, 1996.
4. C. W. Barrett, D. L. Dill, and A. Stump. A generalization of Shostak's method for combining decision procedures. In A. Armando, editor, Frontiers of Combining Systems, volume 2309 of Lecture Notes in Computer Science, pages 132-146. Springer, 2002.
5. E. T. Bell. Exponential numbers. American Mathematical Monthly, 41:411-419, 1934.
6. N. S. Bjørner. Integrating Decision Procedures for Temporal Verification. PhD thesis, Stanford University, 1998.
7. N. S. Bjørner, A. Browne, M. Colón, B. Finkbeiner, Z. Manna, H. B. Sipma, and T. E. Uribe. Verifying temporal properties of reactive systems: A STeP tutorial. Formal Methods in System Design, 16(3):227-270, 2000.
8. D. Cantone and C. G. Zarba. A new fast tableau-based decision procedure for an unquantified fragment of set theory. In R. Caferra and G. Salzer, editors, Automated Deduction in Classical and Non-Classical Logics, volume 1761 of Lecture Notes in Computer Science, pages 127-137. Springer, 2000.
9. A. Church. A note on the Entscheidungsproblem. Journal of Symbolic Logic, 1:101-102, 1936.
10. G. E. Collins. Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. In H. Brakhage, editor, Automata Theory and Formal Languages, volume 33 of Lecture Notes in Computer Science, pages 134-183. Springer, 1975.
11. D. C. Cooper. Theorem proving in arithmetic without multiplication. In B. Meltzer and D. Michie, editors, Machine Intelligence, volume 7, pages 91-99. Edinburgh University Press, 1972.
12. D. Craigen, S. Kromodimoeljo, I. Meisels, B. Pase, and M. Saaltink. EVES: An overview. In S. Prehen and H. Toetenel, editors, Formal Software Development Methods, volume 552 of Lecture Notes in Computer Science, pages 389-405. Springer, 1991.
13. D. Cyrluk, P. Lincoln, and N. Shankar. On Shostak's decision procedure for combinations of theories. In M. A. McRobbia and J. K. Slaney, editors, Automated Deduction - CADE-13, volume 1104 of Lecture Notes in Computer Science, pages 463-477. Springer, 1996.
14. J. H. Davenport and J. Heintz. Real quantifier elimination is doubly exponential. Journal of Symbolic Computation, 5:29-35, 1988.
15. N. G. de Bruijn. Asymptotic Methods in Analysis. North-Holland Publishing Company, 1958.
16. D. L. Detlefs, K. Rustan, M. Leino, G. Nelson, and J. B. Saxe. Extended static checking. Technical Report 159, Compaq System Research Center, 1998.
17. P. Downey and R. Sethi. Assignment commands with array references. Journal of the Association for Computing Machinery, 25(4):652-666, 1978.
18. P. J. Downey, R. Sethi, and R. E. Tarjan. Variations on the common subexpression problem. Journal of the Association for Computing Machinery, 27(4):758-771, 1980.
19. H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, 2nd edition, 2000.
20. J. Ferrante and C. Rackoff. A decision procedure for the first order theory of real addition with order. SIAM Journal on Computing, 4(1):69-76, 1975.
21. J.-C. Filliâtre, S. Owre, H. Rueß, and N. Shankar. ICS: Integrated Canonizer and Solver. In G. Berry, H. Comon, and F. Alain, editors, Computer Aided Verification, volume 2102 of Lecture Notes in Computer Science, pages 246-249, 2001.
22. M. J. Fischer and M. O. Rabin. Super-exponential complexity of Presburger arithmetic. In R. M. Karp, editor, Complexity of Computation, volume 7 of SIAM-AMS proceedings, pages 27-42. American Mathematical Society, 1974.
23. H. Ganzinger. Shostak light. In A. Voronkov, editor, Automated Deduction - CADE-18, volume 2392 of Lecture Notes in Computer Science, pages 332-346. Springer, 2002.
24. D. Kapur. A rewrite rule based framework for combining decision procedures. In A. Armando, editor, Frontiers of Combining System, volume 2309 of Lecture Notes in Computer Science, pages 87-102. Springer, 2002.
25. L. G. Khachiyan. A polynomial algorithm in linear programming. Soviet Mathematics Doklady, 20:191-194, 1979.
26. D. Kozen. Complexity of finitely presented algebras. In Proceedings of the ninth annual ACM symposium on Theory of computing, pages 164-177, 1977.
27. G. Kreisel and J. L. Krivine. Elements of Mathematical Logic. Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Company, 1967.
28. S. Krstić and S. Conchon. Canonization for disjoint union of theories. Technical Report CSE-03-003, Oregon Health and Science University, 2003.
29. J.-L. Lassez and M. J. Mahler. On Fourier's algorithm for linear constraints. Journal of Automated Reasoning, 9(3):373-379, 1992.
30. J. L. Levitt. Formal Verification Techniques for Digital Systems. PhD thesis, Stanford University, 1998.
31. B. Levy, I. Filippenko, L. Marcus, and T. Menas. Using the state delta verification system (SDVS) for hardware verification. In T. F. Melham, V. Stavridou, and R. T. Boute, editors, Theorem Prover in Circuit Design: Theory, Practice and Experience, pages 337-360. Elsevier Science, 1992.
32. D. C. Luckham, S. M. German, F. W. von Henke, R. A. Karp, P. W. Milne, D. C. Oppen, W. Polak, and W. L. Scherlis. Stanford pascal verifier user manual. Technical Report STAN-CS-79-731, Stanford University, 1979.
33. Y. V. Matiyasevich. Diophantine representation of recursively enumerable predicates. In J. E. Fenstad, editor, Second Scandinavian Logic Symposium, volume 63 of Studies in Logic and the Foundations of Mathematics, pages 171-177. North-Holland Publishing Company, 1971.
34. J. McCarthy. Towards a mathematical science of computation. In IFIP Congress 62, 1962.
35. G. Nelson. Techniques for program verification. Technical Report CSL-81-10, Xerox Palo Alto Research Center, 1981.
36. G. Nelson. Combining satisfiability procedures by equality sharing. In W. W. Bledsoe and D. W. Loveland, editors, Automated Theorem Proving: After 25 Years, volume 29 of Contemporary Mathematics, pages 201-211. American Mathematical Society, 1984.
37. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245-257, 1979.
38. G. Nelson and D. C. Oppen. Fast decision procedures based on congruence closure. Journal of the Association for Computing Machinery, 27(2):356-364, 1980.
39. 22pn upper bound on the complexity of Presburger arithmetic. Journal of Computer and System Sciences, 16(3):323-332, 1978.
40. D. C. Oppen. Complexity, convexity and combinations of theories. Theoretical Computer Science, 12:291-302, 1980.
41. D. C. Oppen. Reasoning about recursively defined data structures. Journal of the Association for Computing Machinery, 27(3):403-411, 1980.
42. S. Owre, S. Rajan, J. M. Rushby, N. Shankar, and M. K. Srivas. PVS: Combining specification, proof checking and model checking. In R. Alur and T. A. Henzinger, editors, Computer Aided Verification, volume 1102 of Lecture Notes in Computer Science, pages 411-414. Springer, 1996.
43. C. H. Papadimitriou. On the complexity of integer programming. Journal of the Association for Computing Machinery, 28(4):765, 768, 1981.
44. M. Presburger. Über die Vollständigkeit eines gewissen systems der arithmetik ganzer zahlen, in welchen die addition als einzige operation hervortritt. In Comptes Rendus du Premier Congrès des Mathématicienes des Pays Slaves, pages 92-101, 1929.
45. C. Ringeissen. Cooperation of decision procedures for the satisfiability problem. In F. Baader and K. U. Schulz, editors, Frontiers of Combining Systems, volume 3 of Applied Logic Series, pages 121-140. Kluwer Academic Publishers, 1996.
46. H. Rueß and N. Shankar. Deconstructing Shostak. In Sixteenth Annual IEEE Symposium on Logic in Computer Science, pages 19-28. IEEE Computer Society, 2001.
47. N. Shankar and H. Rueß. Combining Shostak theories. In S. Tison, editor, Rewriting Techniques and Applications, volume 2378 of Lecture Notes in Computer Science, pages 1-18. Springer, 2002.
48. R. E. Shostak. An algorithm for reasoning about equality. Communications of the Association for Computing Machinery, 21(7):583-585, 1978.
49. R. B. Shostak. A practical decision procedure for arithmetic with function symbols. Journal of the Association for Computing Machinery, 26(2):351-360, 1979.
50. R. E. Shostak. Deciding combination of theories. Journal of the Association for Computing Machinery, 31(1):1-12, 1984.
51. A. Stump, C. W. Barret, and D. L. Dill. CVC: A cooperating validity checker. In E. Brinksma and K. G. Larsen, editors, Computer Aided Verification, volume 2404 of Lecture Notes in Computer Science, pages 500-504, 2002.
52. A. Stump, C. W. Barret, D. L. Dill, and J. Levitt. A decision procedure for an extensional theory of arrays. In Sixteenth Annual IEEE Symposium on Logic in Computer Science, pages 29-37. IEEE Computer Society, 2001.
53. N. Suzuki and D. Jefferson. Verification decidability of Presburger array programs. Journal of the Association for Computing Machinery, 27(1):191-205, 1980.
54. A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, 1951.
55. C. Tinelli. Cooperation of background reasoners in theory reasoning by residue sharing. Technical Report 02-03, Department of Computer Science, University of Iowa, 2002.
56. 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, volume 3 of Applied Logic Series, pages 103-120. Kluwer Academic Publishers, 1996.
57. C. Tinelli and C. Ringeissen. Unions of non-disjoint theories and combinations of satisfiability procedures. Theoretical Computer Science, 290(1):291-353, 2003.
58. A. Tiwari. Decision Procedures in Automated Deduction. PhD thesis, State University of New York at Stony Brook, 2000.
59. A. M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42:230-265, 1936.
60. C. G. Zarba. Combining multisets with integers. In A. Voronkov, editor, Automated Deduction - CADE-18, volume 2392 of Lecture Notes in Computer Science, pages 363-376. Springer, 2002.
61. C. G. Zarba. A tableau calculus for combining non-disjoint theories. In U. Egly and C. G. Fermüller, editors, Automated Reasoning with Analytic Tableaux and Related Methods, volume 2381 of Lecture Notes in Computer Science, pages 315-329. Springer, 2002.