A generalization of shostak’s method for combining decision procedures

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

Volumn 2309, Issue , 2002, Pages 132-146

  Barrett, Clark W ^a   Dill, David L ^a   Stump, Aaron ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

DECISION PROCEDURE; FIRST ORDER THEORIES; NELSON-OPPEN METHOD; S-ALGORITHMS; S-METHOD; SIMPLIFIED ALGORITHMS; UNINTERPRETED FUNCTION SYMBOLS;

ALGORITHMS;

EID: 84947902670     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45988-x_11     Document Type: Article

References (14)

1. 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-Verlag, 1996.
2. C. Barrett, D. Dill, and A. Stump. A Framework for Cooperating Decision Procedures. In 17th International Conference on Automated Deduction, Lecture Notes in Computer Science. Springer-Verlag, 2000.
3. Clark W. Barrett. Checking Validity of Quantifier-Free Formulas in Combinations of First-Order Theories. PhD thesis, Stanford University, 2002.
4. Nikolaj S. Bjørner. Integrating Decision Procedures for Temporal Verification. PhD thesis, Stanford University, 1999.
5. D. Cyrluk, P. Lincoln, and N. Shankar. On Shostak’s Decision Procedure for Combinations of Theories. In M. McRobbie and J. Slaney, editors, 13th International Conference on Computer Aided Deduction, volume 1104 of Lecture Notes in Computer Science, pages 463-477. Springer-Verlag, 1996.
6. Z. Manna et al. STeP: Deductive-Algorithmic Verification of Reactive and Realtime Systems. In 8th International Conference on Computer-Aided Verification, volume 1102 of Lecture Notes in Computer Science, pages 415-418. Springer-Verlag, 1996.
7. Jeremy R. Levitt. Formal Verification Techniques for Digital Systems. PhD thesis, Stanford University, 1999.
8. G. Nelson and D. Oppen. Simplification by Cooperating Decision Procedures. ACM Transactions on Programming Languages and Systems, 1(2):245-57, 1979.
9. Derek C. Oppen. Complexity, Convexity and Combinations of Theories. Theoretical Computer Science, 12:291-302, 1980.
10. S. Owre, J. Rushby, and N. Shankar. PVS: A Prototype Verification System. In D. Kapur, editor, 11th International Conference on Automated Deduction, volume 607 of Lecture Notes in Artificial Intelligence, pages 748-752. Springer-Verlag, 1992.
11. H. Ruess and N. Shankar. Deconstructing Shostak. In 16th Annual IEEE Symposium on Logic in Computer Science, pages 19-28, June 2001.
12. Robert E. Shostak. Deciding Combinations of Theories. Journal of the Association for Computing Machinery, 31(1):1-12, 1984.
13. C. Tinelli and M. Harandi. A New Correctness Proof of the Nelson-Oppen Combination Procedure. In F. Baader and K. Schulz, editors, 1st International Workshop on Frontiers of Combining Systems (FroCoS’96), volume 3 of Applied Logic Series. Kluwer Academic Publishers, 1996.
14. Ashish Tiwari. Decision Procedures in Automated Deduction. PhD thesis, State University of New York at Stony Brook, 2000.