Shostak light

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

Volumn 2392, Issue , 2002, Pages 332-346

  Ganzinger, Harald ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; THEOREM PROVING;

HIGH LEVEL OF ABSTRACTION; NELSON-OPPEN PROCEDURE; S-PROCEDURES; SIGMA MODEL;

AUTOMATION;

EID: 84948985982     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45620-1_28     Document Type: Conference Paper

References (18)

1. Baader, F. & Tinelli, C. (1997), A new approach for combining decision procedures for the word problem, and its connection to the nelson-oppen combination method, in W. McCune, ed., ‘Automated Deduction – CADE-14, 14th InternationalConference on Automated Deduction’, LNAI 1249, Springer-Verlag, Townsville, North Queensland, Australia, pp. 19–33
2. Bachmair, L. & Tiwari, A. (2000), Abstract congruence closure and specializations, in D. McAllester, ed., ‘Automated Deduction – CADE-17, 17th International Conference on Automated Deduction’, LNAI 1831, Springer-Verlag, Pittsburgh, PA, USA, pp. 64–78.
3. Bachmair, L., Tiwari, A. & Vigneron, L. (2002), ‘Abstract congruence closure’, J. Automated Reasoning. To appear.
4. Barrett, C., Dill, D. & Levitt, J. (1996), Validity checking for combinations of theories with equality, in M. Srivas & A. Camilleri, eds, ‘Formal Methods In Computer- Aided Design, Palo Alto/CA, USA’, Vol. 1166, Springer-Verlag, pp. 187–201. citeseer.nj.nec.com/barrett96validity.html
5. Barrett, C., Dill, D. & Stump, A. (2002), A generalization of Shostak’s method for combining decision procedures, in ‘Proc. FroCos 2002’, Springer-Verlag. to appear.
6. Bjørner, N. (1998), Integrating decision procedures for temporalv erification, PhD thesis, Stanford University.
7. Huet, G. (1972), Constrained Resolution: A Complete Method for Higher Order Logic, PhD thesis, Case Western Reserve University.
8. Kapur, D. (1997), Shostak’s congruence closure as completion, in H. Comon, ed., ‘Rewriting Techniques and Applications’, Lecture Notes in Computer Science, Springer, Sitges, Spain, pp. 23–37.
9. Kapur, D. (2002), A rewrite rule based framework for combining decision procedures, in ‘Proc. FroCos 2002’, Springer-Verlag. to appear.
10. Manna, Z., Anuchitanulu, A., Bjørner, N., Browne, A., Chang, E. S., Colón, M., de Alfaro, L., Devarajan, H., Kapur, A., Lee, J., Sipma, H. & Uribe, T. E. (1995), STeP: The Stanford TemporalPro ver, in ‘TAPSOFT’, Vol. 915 of Lecture Notes in Computer Science, Springer-Verlag, pp. 793–794.
11. Nelson, G. & Oppen, D. C. (1979), ‘Simplification by cooperating decision procedures’, ACM Transactions on Programming Languages and Systems 2(2), 245–257.
12. Nieuwenhuis, R. & Rubio, A. (1995), ‘Theorem proving with ordering and equality constrained clauses’, J. Symbolic Computation 19(4), 321–352.
13. Owre, S., Rushby, J. M. & Shankar, N. (1992), PVS: A prototype verification system, in D. Kapur, ed., ‘11th InternationalConference on Automated Deduction’, LNAI 607, Springer-Verlag, Saratoga Springs, New York, USA, pp. 748–752.
14. Rueß, H. & Shankar, N. (2001), Deconstructing Shostak, in ‘Proceedings of the Sixteenth IEEE Symposium On Logic In Computer Science (LICS’01)’, IEEE Computer Society Press, pp. 19–28.
15. Shankar, N. & Rueß, H. (2002), Combining Shostak theories, in ‘Proc. RTA 2002’, Lecture Notes in Computer Science, Springer-Verlag. to appear.
16. Shostak, R. E. (1984), ‘Deciding combinations of theories’, J. Association for Computing Machinery 31(1), 1–12.
17. Tinelli, C. & Harandi, M. (1996), A new correctness proof of the Nelson-Oppen combination procedure, in ‘1st Int’lW orkshop on Frontiers of Combining Systems (FroCoS’96)’, Vol. 3 of Applied Logic Series, Kluwer Academic Publishers.
18. Tiwari, A. (2000), Decision procedures in automated deduction, PhD thesis, SUNY at Stony Brook.