Abstract
This paper shows that different “meta-model-checking” analyses can be conducted efficiently on a generic data structure we call a support set. Support sets may be viewed as abstract encodings of the “evidence” a model checker uses to justify the yes/no answers it computes. We indicate how model checkers may be modified to compute supports sets without compromising their time or space complexity. We also show how support sets may be used for a variety of different analyses of model-checking results, including: the generation of diagnostic information for explaining negative model-checking results; and certifying the results of model checking (is the evidence internally consistent?).
Research supported by NSF grants CCR-9988489 and CCR-0098037 and Army Research Office grants DAAD190110003 and DAAD190110019.
Chapter PDF
Similar content being viewed by others
References
H. R. Andersen. Model checking and boolean graphs. Theoretical Computer Science, 126(1):3–30, April 1994.
I. Beer, S. Ben-David, C. Eisner, and Y. Rodeh. Efficient detection of vacuity in ACTL formulas. In Proceedings of the Ninth International Conference on Computer Aided Verification (CAV’ 97), LNCS 1254. Springer-Verlag, 1997.
G. S. Bhat and R. Cleaveland. Efficient local model checking for fragments of the modal μ-calculus. In Proceedings of the Second International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’ 96), LNCS 1055. Springer-Verlag, March 1996.
G. S. Bhat and R. Cleaveland. Efficient model checking via the equational μ-calculus. In E. M. Clarke, editor, 11th Annual Symposium on Logic in Computer Science (LICS’ 96), pages 304–312, New Brunswick, NJ, July 1996. Computer Society Press.
G. Bhat, R. Cleaveland, and A. Groce. Efficient model checking via büchi tableau automaton. In Proceedings of the Seventh International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’ 01), LNCS 2031. Springer-Verlag, 2001.
E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Proceedings of the Workshop on Logic of Programs, Yorktown Heights, volume 131 of Lecture Notes in Computer Science. Springer-Verlag, 1981.
E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM TOPLAS, 8(2), 1986.
E. Clarke, O. Grumberg, K. McMillian, and X. Zhao. Efficent generation of counterexamples and witnesses in symbolic model checking. In Proc. 32nd Design Automaton Conference, San Francisco, CA, 1995. [CKV01] H. Chockler, O. Kupferman, and M. Vardi. Coverage metrics for temporal logic model checking. In Proceedings of the Seventh International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’ 01), LNCS 2031. Springer-Verlag, April 2001.
R. Cleaveland and B. U. Steffen. A linear-time model checking algorithm for the alternation-free modal mu-calculus. Formal Methods in System Design, 2:121–147, 1993.
R. Cleaveland and S. Sims. The NCSU concurrency workbench. In R. Alur and T. A. Henzinger, editors, Computer Aided Verification (CAV’ 96), volume 1102 of Lecture Notes in Computer Science, pages 394–397, New Brunswick, New Jersey, July 1996. Springer-Verlag.
M. Dam. CTL* and ECTL* as fragement of the modal μ-calculus. Theoretical Computer Science, 126:77–96, 1994.
E. A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional mu-calculus. In Symposium on Logic in Computer Science (LICS’ 86), pages 267–278, Cambridge, Massachusetts, June 1986. Computer Society Press.
V. King, O. Kupferman, and M. Y. Vardi. On the complexity of parity word automaton. In The 4th International Conference on Foundations of Software Science and Computation Structures, Vol. 2030 of Lecture Notes in Computer Science, 2001.
O. Kupferman and M. Y. Vardi. Vacuity detection in temporal model checking. In Proceedings of the Tenth Conference on Correct Hardware Design and Verification Mothods, LNCS 1703, 1999.
O. Kupferman, M. Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312–360, March 2000.
X. Liu, C. R. Ramakrishnan, and S. A. Smolka. Fully local and efficient evaluation of alternating fixed points. In Proceedings of the Fourth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’ 98), LNCS1389. Springer-Verlag, 1998.
A. Mader. Verification of Modal Properties Using Boolean Equation Systems. PhD thesis, Müchen, Techn-Univ., 1997.
R. Mateescu. Efficient diagnostic generation for boolean equation system. In Proceedings of the Sixth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’ 00), Vol. 1785 of Lecture Notes in Computer Science. Springer-Verlag, March 2000.
K. Namjoshi. Certifying model checkers. In Proceedings of the 13th International Conference on Computer Aided Verification (CAV’ 01), LNCS 2102. Springer-Verlag, 2001.
D. Peled, A. Pnueli, and L. Zuck. From falsification to verification. In FST&TCS, volume 2245 of Lecture Notes in Computer Science. Springer-Verlag, 2001.
D. Peled and L. Zuck. From model checking to a temporal proof. In M. Dwyer, editor, SPIN 2001, volume 2057 of Lecture Notes in Computer Science, pages 1–14, Toronto, May 2001. Springer-Verlag.
J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proceedings of the International Symposium in Programming, volume 137 of Lecture Notes in Computer Science, Berlin, 1982. Springer-Verlag.
P. Stevens and C. Stirling. Practical model checking using games. In Proceedings of the Fourth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’ 98), LNCS1389. Springer-Verlag, 1998.
C. Stirling. Local model checking games. In I. Lee and S. A. Smolka, editors, Proceedings of the Sixth International Conference on Concurrency Theory (CONCUR’ 95), Vol. 962 of Lecture Notes in Computer Science. Springer-Verlag, 1995.
R. E. Tarjan. A hierarchical clusting algorithm using strong components. Information Processing Letters, 14:26–29, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tan, L., Cleaveland, R. (2002). Evidence-Based Model Checking. In: Brinksma, E., Larsen, K.G. (eds) Computer Aided Verification. CAV 2002. Lecture Notes in Computer Science, vol 2404. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45657-0_37
Download citation
DOI: https://doi.org/10.1007/3-540-45657-0_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43997-4
Online ISBN: 978-3-540-45657-5
eBook Packages: Springer Book Archive