Abstract
Software verification is known to be a notoriously difficult application area for automated theorem provers. Consequently, this is the domain of interactive systems, such as KIV [Reif et al., 1997], HOL [Gordon and Melham, 1993], Isabelle [Nipkow and Paulson, 1992] and PVS [Owre et al., 1992]. The work described here aims to demonstrate that automated theorem provers (ATPs) can be successfully incorporated into such systems in order to relieve the user from some interactions. More specifically, we describe our approach of coupling the interactive program verification system KIV [Reif et al , 1997] with our automated theorem prover PROTEIN [Baumgartner and Furbach, 1994].
Both authors are funded by the DFG within the research programme “Deduction” under grant Fu 263/2-2
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Owen L. Astrachan. Investigations in Model Elimination based Theorem Proving PhD thesis, Duke University, 1992. Technical Report CS-1992–21.
Leo Bachmair and Harald Ganzinger. Chapter 11: Equational Reasoning in Saturation-Based Theorem Proving. In Wolfgang Bibel and Peter H. Schmitt, editors, Automated Deduction. A Basis for Applications, volume I: Foundations. Calculi and Refinements, pages 353–398. Kluwer Academic Publishers, 1998.
Peter Baumgartner and Ulrich Furbach. PRO-TEIN: A PROver with a Theory Extension Interface. In A. Bundy, editor, Au-tomated Deduction - CADE-12,volume 814 of Lecture Notes in Artificial Intelligence,pages 769–773. Springer, 1994. Available in the WWW, URL:http://www.uni-koblenz. de/ag-ki/Systems/PROTEIN/.
Bernhard Beckert and Joachim Posegga. leanT’P: Lean tableau-based deduction. Journal of Automated Reasoning, 15 (3): 339–358, 1995.
R.S. Boyer and J.S. Moore. A Computational Logic. Academic Press, 1988.
Francois Bronsard and Uday S. Reddy. Reduction Techniques for First-Order Reasoning. In M. Rusinowitch and J.L. Rémy, editors, Proceedings of the Third International Workshop on Conditional Term Rewriting Systems, pages 242–256. Springer-Verlag, July 1992. LNCS 656.
S. Brüning. Exploiting Equivalences in Connection Calculi. Journal of the IGPL, 3 (6): 857–886, 1995.
C. Chang and R. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, 1973.
M. Fitting. First Order Logic and Automated Theorem Proving. Texts and Monographs in Computer Science. Springer, 1990.
M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993.
M. Kaufmann and J.S. Moore. Ac12: An industrial strength version of nqthm. In Proceedings of Eleventh Annual Conference on Computer Assurance (COMPASS-96), pages 23–34 IEEE Computer Society Press, 1996.
Shie-Jue Lee and David A. Plaisted. Reasoning with Predicate Replacement, 1989.
D. Loveland. A Simplified Version for the Model Elimination Theorem Proving Procedure. JACM, 16 (3), 1969.
William W. McCune. OTTER 3.0 reference manual and guide. Technical Report ANL-94/6, National Laboratory, Argonne, IL, 1994.
Tobias Nipkow and Lawrence C. Paulson. Isabelle-91. In D. Kapur, editor, Proceedings of the 11th International Conference on Automated Deduction,pages 673676, Saratoga Springs, NY, 1992. Springer-Verlag LNAI 607. System abstract.
Dorothea Schäfer. Simplification in model elimination. Master’s thesis, Universität Koblenz, 1998. To appear.
Gerhard Schellhorn and Wolfgang Reif. Proving properties of finite enumerations: A problem set for automated theorem provers. Technical report, University of Ulm, Dept. of Computer Science, 1997. URL:http://www.informatik.uniulm.de/pm/kiv/setheo/enum.ps.
P.H. Schmitt and W. Wernecke. Tableau calculus for sorted logics. In Sorts and Types in Artificial Intelligence, volume 418 of Lecture Notes in Artificial Intelligence, pages 49–60. Springer, 1989.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Wien
About this paper
Cite this paper
Baumgartner, P., Schäfer, D. (1999). Model Elimination with Simplification and its Application to Software Verification. In: Berghammer, R., Lakhnech, Y. (eds) Tool Support for System Specification, Development and Verification. Advances in Computing Science. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6355-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6355-9_2
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83282-0
Online ISBN: 978-3-7091-6355-9
eBook Packages: Springer Book Archive