Skip to main content
SpringerLink
Log in
Book cover

International Conference on Automated Deduction

CADE 1997: Automated Deduction—CADE-14 pp 101–115Cite as

A practical integration of first-order reasoning and decision procedures

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1249))

Abstract

We present a procedure for proving the validity of first-order formulas in the presence of decision procedures for an interpreted subset of the language. The procedure is designed to be practical: formulas can have large complex boolean structure, and include structure sharing in the form of let- expressions. The decision procedures are only required to decide the unsatisfiability of sets of literals. However, T-refuting substitutions are used whenever they can be computed; we show how this can be done for a theory of partial orders and equality. The procedure has been implemented as part of STeP, a tool for the formal verification of reactive systems. Although the procedure is incomplete, it eliminates the need for user interaction in the proof of many verification conditions.

This research was supported in part by the National Science Foundation under grants CCR-94-08630 and CCR-95-27927, the Defense Advanced Research Projects Agency under NASA grant NAG2-892, ARO under grant DAAH04-95-1-0317, and Army contract DABT63-96-C-0096 (DARPA).

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andrews, P. B. Theorem proving via general matings. J. ACM 28, 2 (Apr. 1981), 193–214.

    Article  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  4. Baumgartner, P., Furbach, U., and Petermann, U. A unified approach to theory reasoning. Research Report 15–92, Fachbereich Informatik, Universität Koblenz, 1992.

    Google Scholar 

  5. Bibel, W.Automated Theorem Proving. Friedr. Vieweg & Sohn, Braunschweig, Germany, 1982.

    Book  Google Scholar 

  6. Bjørner, N., Browne, A., Chang, E., Colón, M., Kapur, A., Manna, Z., Sipma, H., and Uribe, T. STeP: Deductive-algorithmic verification of reactive and real-time systems. In Proc. 8thIntl. Conference on Computer Aided Verification (July 1996), vol. 1102 of LNCS, Springer-Verlag, pp. 415–418.

    Google Scholar 

  7. Bjørner, N., Manna, Z., Sipma, H., and Uribe, T. Deductive verification of real-time systems using STeP. In AMAST Workshop on Real-Time Systems (1997), LNCS, Springer-Verlag. To appear.

    Google Scholar 

  8. Bürckert, H.-J. A Resolution Principle for a Logic with Restricted Quantifiers, vol. 568 of LNAI. Springer-Verlag, 1991.

    Google Scholar 

  9. Clarke, E., German, S., and Zhao, X. Verifying the SRT division algorithm using theorem-proving techniques. In Proc. 8thIntl. Conference on Computer Aided Verification (July 1996), vol. 1102 of LNCS, Springer-Verlag, pp. 111–122.

    Google Scholar 

  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.

    Google Scholar 

  11. Davis, M. Obvious logical inferences. In Proceedings of the Seventh International Joint Conference on Artificial Intelligence (August 1981), pp. 530–531.

    Google Scholar 

  12. Davis, M., Logemann, G., and Loveland, D. A machine program for theorem-proving. Communications of the ACM 5, 7 (July 1962), 394–397.

    Article  MathSciNet  Google Scholar 

  13. Davis, M., and Putnam, H. A computing procedure for quantification theory. J. ACM 7 (1960), 201–215.

    Article  MathSciNet  Google Scholar 

  14. Degtyarev, A., and Voronkov, A. Simultaneous rigid E-unification is undecidable. UPMAIL Technical Report No. 105, Computing Science Department, Uppsala University, 1995.

    Google Scholar 

  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.

    Google Scholar 

  16. Frisch, A. M. The substitutions a framework for sorted deduction: Fundamental results on hybrid reasoning. Artificial Intelligence 49 (1991), 161–198.

    Article  MathSciNet  Google Scholar 

  17. Gallier, J., Narendran, P., Raatz, S., and Snyder, W. Theorem proving using equational matings and rigid E-unification. J. ACM 39, 2 (Apr. 1992), 377–429.

    Article  MathSciNet  Google Scholar 

  18. Hooker, J. N., and Vinay, V. Branching rules for satisfiability. J. Automated Reasoning 15 (1995), 359–383.

    Article  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  20. Manna, Z., and Pnueli, A.Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.

    Book  Google Scholar 

  21. Manna, Z., and Waldinger, R.The Deductive Foundations of Computer Programming. Addison-Wesley, Reading, MA, 1993.

    MATH  Google Scholar 

  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/esc/Esc.html.

    Google Scholar 

  23. Nelson, G., and Oppen, D. Fast decision procedures based on congruence closure. J. ACM 27, 2 (Apr. 1980), 356–364.

    Article  MathSciNet  Google Scholar 

  24. Owre, S., Rajan, S., Rushby, J., Shankar, N., and Srivas, M. PVS: Combining specification, proof checking, and model checking. In Proc. 8thIntl. Conference on Computer Aided Verification (July 1996), vol. 1102 of LNCS, Springer-Verlag, pp. 411–414.

    Google Scholar 

  25. Plotkin, G. Building in equational theories. Machine Intelligence 57 (1972), 73–90.

    MATH  Google Scholar 

  26. Robinson, J. A machine-oriented logic based on the resolution principle. J. ACM 12, 1 (1965), 23–41.

    Article  MathSciNet  Google Scholar 

  27. Shostak, R. Deciding combinations of theories. J. ACM 31, 1 (Jan. 1984), 1–12.

    Article  MathSciNet  Google Scholar 

  28. Stickel, M. Automated deduction by theory resolution. J. Automated Reasoning 1, 4 (1985), 333–355.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Stanford University, USA

    Nikolaj S. Bjørner & Tomás E. Uribe

  2. Artificial Intelligence Center, SRI International, USA

    Mark E. Stickel

Authors
  1. Nikolaj S. Bjørner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mark E. Stickel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tomás E. Uribe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

William McCune

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bjørner, N.S., Stickel, M.E., Uribe, T.E. (1997). A practical integration of first-order reasoning and decision procedures. In: McCune, W. (eds) Automated Deduction—CADE-14. CADE 1997. Lecture Notes in Computer Science, vol 1249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63104-6_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-63104-6_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63104-0

  • Online ISBN: 978-3-540-69140-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation