A practical integration of first-order reasoning and decision procedures

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

Volumn 1249, Issue , 1997, Pages 101-115

  Bjørner, Nikolaj S ^a   Stickel, Mark E ^b   Uribe, Tomás E ^a  

^a Stanford University   (United States)

^b SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL VERIFICATION; THEOREM PROVING;

BOOLEAN STRUCTURE; DECISION PROCEDURE; FIRST-ORDER FORMULAS; PARTIAL ORDER; REACTIVE SYSTEM; STRUCTURE SHARING; USER INTERACTION; VERIFICATION CONDITION;

AUTOMATION;

EID: 84957081134     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63104-6_13     Document Type: Conference Paper

References (28)

1. Andrews, P. B. Theorem proving via general matings. J. ACM 28, 2 (Apr. 1981), 193-214.
2. Baader, F., and Siekmann, J. Unification theory. In Handbook of Logic in Artificial Intelligence and Logic Programming, D. Gabbay, C. Hogger, and J. Robinson, Eds. Oxford University Press, Oxford, UK, 1993.
3. Barret, C., Dill, D., and Levitt, J. Validity checking for combinations of theories with equality. In 1st Intl. Conf. on Formal Methods in Computer-Aided Design (Nov. 1996), vol. 1166 of LNCS, pp. 187-201.
4. Baumgartner, P., Furbach, U., and Petermann, U. A unified approach to theory reasoning. Research Report 15-92, Fachbereich Informatik, Universität Koblenz, 1992.
5. Bibel, W. Automated Theorem Proving. Friedr. Vieweg fc Sohn, Braunschweig, Germany, 1982.
6. th Intl. Conference on Computer Aided Verification (July 1996), vol. 1102 of LNCS, Springer-Verlag, pp. 415-418.
7. Bjørner, N., Manna, Z., Sipma, H., and Uribe, T. Deductive verification of real-time systems using STeP. In AM AST Workshop on Real-Time Systems (1997), LNCS, Springer-Verlag. To appear.
8. BÜRCKERT, H.-J. A Resolution Principle for a Logic with Restricted Quantifiers, vol. 568 of LNAI. Springer-Verlag, 1991.
9. th Intl. Conference on Computer Aided Verification (July 1996), vol. 1102 of LNCS, Springer-Verlag, pp. 111-122.
10. Cyrluk, D., Lincoln, P., and Shankar, N. On Shostak's decision procedure for combinations of theories. In Proc. 13th Int. Conf. on Automated Deduction (1996), vol. 1104 of LNAI, Springer-Verlag.
11. Davis, M. Obvious logical inferences. In Proceedings of the Seventh International Joint Conference on Artificial Intelligence (August 1981), pp. 530-531.
12. Davis, M., Logemann, G., and Loveland, D. A machine program for theorem- proving. Communications of the ACM 5, 7 (July 1962), 394-397.
13. Davis, M., and Putnam, H. A computing procedure for quantification theory. J. ACM 7 (1960), 201-215.
14. Degtyarev, A., and Voronkov, A. Simultaneous rigid E-unification is undecidable. UPMAIL Technical Report No. 105, Computing Science Department, Uppsala University, 1995.
15. Detlefs, D. An overview of the extended static checking system. In Proc. First Workshop on Formal Methods in Software Practice (Jan. 1996), ACM (SIGSOFT), pp. 1-9.
16. Frisch, A. M. The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning. Artificial Intelligence 49 (1991), 161-198.
17. Gallier, J., Narendran, P., Raatz, S., and Snyder, W. Theorem proving using equational matings and rigid U-unification. J. ACM 39, 2 (Apr. 1992), 377-429.
18. Hooker, J. N., and Vinay, V. Branching rules for satisfiability. J. Automated Reasoning 15 (1995), 359-383.
19. Issar, S. Path-focused duplication: A search procedure for general matings. In Proceedings of the Eighth National Conference on Artificial Intelligence (July- August 1990), pp. 221-226.
20. Manna, Z., and Pnueli, A. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
21. Manna, Z., and Waldinger, R. The Deductive Foundations of Computer Programming. Addison-Wesley, Reading, MA, 1993.
22. Nelson, G., and Detlefs, D. ESC pages and Simplify man page. On-line documentation, DEC Systems Research Center, 1996. http://www.research.digital.com/SRC/es c/Esc.html.
23. Nelson, G., and Oppen, D. Fast decision procedures based on congruence closure. J. ACM 27, 2 (Apr. 1980), 356-364.
24. th Intl. Conference on Computer Aided Verification (July 1996), vol. 1102 of LNCS, Springer-Verlag, pp. 411-414.
25. Plotkin, G. Building in equational theories. Machine Intelligence 7 (1972), 73-90.
26. Robinson, J. A machine-oriented logic based on the resolution principle. J. ACM 12, 1 (1965), 23-41.
27. Shostak, R. Deciding combinations of theories. J. ACM 31, 1 (Jan. 1984), 1-12.
28. Stickel, M. Automated deduction by theory resolution. J. Automated Reasoning 1, 4 (1985), 333-355.