Abstract
The amount of user interaction is a prime cost factor in interactive program verification. This paper analyzes situations in which the reuse of previous proofs can help reducing these costs. In particular, it describes a technique that reuses subproofs in the verification of invariants of state transition systems. This technique replays decisions of generalized previous proof attempts from the same overall verification process. As opposed to CBR applications that are justified by the fact that no or insufficient domain knowledge is available to solve a problem from first principles or by saving a huge search effort, our technique aims at saving user interaction. Several case studies provide first proofs of significant savings of user interaction in verification proofs by employing our CBR technique.
The author was supported by the Deutsche Forschungsgemeinschaft, SFB 378.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J.G. Carbonell. Derivational analogy: A theory of reconstructive problem solving and expertise acquisition. In R.S. Michalsky, J.G. Carbonell, and T.M. Mitchell, editors, Machine Learning: An Artificial Intelligence Approach, pages 371–392. Morgan Kaufmann Publ., Los Altos, 1986.
P. Graf. Term Indexing. Springer, LNAI 1053, 1996.
A.K. Hickman and J.H. Larkin. Internal analogy: A model of transfer within problems. In Proceedings of the 12th Annual Conference of The Cognitive Science Society, 1990
D. Hutter, B. Langenstein, C. Sengler, J.H. Siekmann, W. Stephan, and A. Wolpers. Deduction in the verification support environment (VSE). In Proceedings of the Third International Symposium of Formal Methods Europe, Oxford, England, 1996.
Th. Kolbe. Optimizing Proof Search by Machine Learning Techniques. PhD thesis, Fachbereich Informatik der Technischen Hochschule Darmstadt, 1997.
Th. Kolbe and Ch. Walther. Reusing proofs. In Proceedings of 11th European Conference on Artificial Intelligence, Amsterdam, 1994.
E. Melis. A model of analogy-driven proof-plan construction. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, Montreal, 1995.
E. Melis. When to prove theorems by analogy? In KI-96: Advances in Artificial Intelligence. 20th Annual German Conference on Artificial Intelligence, Dresden, 1996.
E. Melis and C. Sengler. Analogy in verification of state-based specifications, first results. Seki Report SR-96-13, Universität des Saarlandes, FB Informatik, 1996. also available as report DFKI RR-97-01.
T.M. Mitchell, R.M. Keller, and S.T. Kedar-Cabelli. Explanation-based generalization: A unifying view. Machine Learning, 1:47–80, 1986.
W. Reif and K. Stenzel. Reuse of proofs in software verification. In Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, Bombay, India, 1993.
A. Schairer. A technique for reusing proofs in software verification. Master's thesis, Universität des Saarlandes and Universität Stuttgart, March 1998.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Melis, E., Schairer, A. (1998). Similarities and reuse of proofs in formal software verification. In: Smyth, B., Cunningham, P. (eds) Advances in Case-Based Reasoning. EWCBR 1998. Lecture Notes in Computer Science, vol 1488. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056323
Download citation
DOI: https://doi.org/10.1007/BFb0056323
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64990-8
Online ISBN: 978-3-540-49797-4
eBook Packages: Springer Book Archive