Abstract
Model checking is used to automatically verify temporal properties of finite state systems. It is usually considered to be ‘successful’, when an error, in the form of a counterexample to the checked property, is found. We present the dual approach, where, in the pres- ence of no counterexample, we automatically generate a proof that the checked property is satisfied by the given system. Such a proof can be used to obtain intuition about the verified system. This approach can be added as a simple extension to existing model checking tools.
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, E. A. Emerson, Design and synthesis of synchronization skeletons using branching time temporal logic. Workshop on Logic of Programs, Yorktown Heights, NY, 1981, LNCS 131, Springer-Verlag.
G. Bhat, R. Cleaveland, O. Grumberg, Efficient on-the-fly model checking for CTL*. Logic in Computer Science, 1995, San Diego, CA, 388–397
E. M. Clarke, O. Grumberg, D. Peled, Model Checking, MIT Press, 2000.
E. A. Emerson, E. M. Clarke, Characterizing correctness properties of parallel programs using fixpoints, LNCS 85, Springer Verlag, Automata, Languages and Programming, July 1980, 169–181.
R. Gerth, D. Peled, M. Y. Vardi,, P. Wolper, Simple on-the-fly automatic verification of linear temporal logic, Protocol Specification Testing and Verification, 3–18, Warsaw, Poland, 1995. Chapman & Hall.
G. J. Holzmann, Design and Validation of Computer Protocols, Prentice-Hall Software Series, 1992.
R.P. Kurshan. Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press, Princeton, New Jersey,1994.
Z. Manna, A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems: Specification, Springer, 1991.
K. Namjoshi, Certifying model checkers, Submitted to CAV 2001.
M. Y. Vardi, P. Wolper, An automata-theoretic approach to automatic program verification. Proc. 1st Annual Symposium on Logic in Computer Science IEEE, 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., Zuck, L. (2001). From model checking to a temporal proof. In: Dwyer, M. (eds) Model Checking Software. SPIN 2001. Lecture Notes in Computer Science, vol 2057. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45139-0_1
Download citation
DOI: https://doi.org/10.1007/3-540-45139-0_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42124-5
Online ISBN: 978-3-540-45139-6
eBook Packages: Springer Book Archive