Abstract
This paper enhances the linear temporal logic model checking process with the ability to automatically generate a deductive proof that the system meets its temporal specification. Thus, we emphasize the point of view that model checkingcan also be used to justify why the system actually works. We show that, by exploitingthe information in the graph that is generated during a failed search for counterexamples, we can generate a fully deductive proof that the system meets its specification.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons usingbranc hingtime temporal logic. In Proc. IBM Workshop on Logics of Programs, LNCS 131, 1981.
E.A. Emerson and E.M. Clarke. Characterizingcorrectness properties of parallel programs using fixpoints. In ICALP’80, pp. 169–181, LNCS 85.
Y. Kesten and A. Pnueli. Verification by finitary abstraction. Information and Computation, 163:203–243, 2000.
R.P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton University Press, Princeton, New Jersey, 1995.
O. Lichtenstein and A. Pnueli. Checkingthat finite-state concurrent programs satisfy their linear specification. In POPL’85, pp. 97–107, 1985.
O. Lichtenstein, A. Pnueli, and L. Zuck. The glory of the past. In LICS’85, LNCS 193, pp. 196–218, 1985.
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1991.
Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
K.S. Namjoshi. Certifyingmo del checkers. In CAV’01, LNCS 2102, pp. 2–13.
D. Peled and L. Zuck. From model checkingto a temporal proof. In SPIN’2001, LNCS 2057pp. 1–14.
M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In LICS’86, pp. 332–344, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peled, D., Pnueli, A., Zuck, L. (2001). From Falsification to Verification. In: Hariharan, R., Vinay, V., Mukund, M. (eds) FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2001. Lecture Notes in Computer Science, vol 2245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45294-X_25
Download citation
DOI: https://doi.org/10.1007/3-540-45294-X_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43002-5
Online ISBN: 978-3-540-45294-2
eBook Packages: Springer Book Archive