Abstract
Counter-examples explain why a desired temporal logic property fails to hold, and as such considered to be the most useful form of output from modelcheckers. Reported explanations are typically short and described in terms of states and transitions of the model; as a result, they can be effectively used for debugging. However, counter-examples are not available for every CTL property and are often inadequate for explaining exactly what the answer means [CLJV02].
In this paper, we present the approach of annotating counter-examples with additional proof steps. This approach does not sacrifice any of the advantages of traditional counter-examples, yet allows the user to understand and navigate through the counter-example better.We describe our proof system, discuss how to connect it with counter-example generators, and present KEGVis – a tool for visualizing and browsing the annotated counter-examples.
Chapter PDF
References
A. Cimatti, E.M. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: a new Symbolic Model Verifier. In N. Halbwachs and D. Peled, editors, Proceedings of 11th Conference on Computer-Aided Verification (CAV’99), number 1633 in Lecture Notes in Computer Science, pages 495–499, Trento, Italy, July 1999. Springer.
E.M. Clarke, O. Grumberg, K.L. McMillan, and X. Zhao. Efficient Generation of Counterexamples and Witnesses in Symbolic Model Checking. In Proceedings of 32nd Design Automation Conference (DAC 95), pages 427–432, San Francisco, CA, USA, 1995.
E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
E.M. Clarke, Y. Lu, S. Jha, and H. Veith. Tree-Like Counterexamples in Model Checking. In Proceedings of the Seventeenth Annual IEEE Symposium on Logic in Computer Science (LICS’02), pages 19–29, Copenhagen, Denmark, July 2002. IEEE Computer Society.
M. Fröhlich and M. Werner. The Graph Visualization System daVinci — A user interface for applications. Technical Report 5/94, Department of Computer Science, Bremen University, 1994.
A. Gurfinkel, B. Devereux, and M. Chechik. “Model Exploration with Temporal Logic Query Checking”. In Proceedings of SIGSOFT Conference on Foundations of Software Engineering (FSE’02), Charleston, South Carolina, November 2002. ACM Press.
A. Gurfinkel. Multi-valued symbolic model-checking: Fairness, counter-examples, running time. Master’s thesis, University of Toronto, Department of Computer Science, October 2002.
F. Laroussinie. “About the Expressive Power of CTL Combinators”. Information Processing Letters, 54:343–345, 1995.
K.L. McMillan. Symbolic Model Checking. Kluwer Academic, 1993.
K. Namjoshi. Certifying Model Checkers. In Proceedings of 13th International Conference on Computer-AidedVerification (CAV’01), volume 2102 of LNCS. Springer-Verlag, 2001.
S. Owre, N. Shankar, and J. Rushby. “User Guide for the PVS Specification and Verification System (Draft)”. Technical report, Computer Science Lab, SRI International, Menlo Park, CA, 1993.
D. Peled, A. Pnueli, and L. Zuck. From falsification to verification. In FST&TCS, volume 2245 of LNCS. Springer-Verlag, 2001.
D. Peled and L. Zuck. From model checking to a temporal proof. In Proceedings of the 8th International SPINWorkshop (SPIN’2001), volume 2057 of LNCS, pages 1–14, Toronto, Canada, May 2001. Springer.
C. Stirling and D. Walker. Local model-checking in the modal mu-calculus. Theoretical Computer Science, 89, 1991.
L. Tan and R. Cleaveland. Evidence-Based Model Checking. In Proceedings of 14th Conference on Computer-Aided Verification (CAV’02), volume 2404 of LNCS, pages 455–470, Copenhagen, Denmark, July 2002. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gurfinkel, A., Chechik, M. (2003). Proof-Like Counter-Examples. In: Garavel, H., Hatcliff, J. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2003. Lecture Notes in Computer Science, vol 2619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36577-X_12
Download citation
DOI: https://doi.org/10.1007/3-540-36577-X_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00898-9
Online ISBN: 978-3-540-36577-8
eBook Packages: Springer Book Archive