Abstract
The major challenge in model checking for more than two decades has been dealing with the very large number of states that typify industrial systems. Abstraction-based methods have been particularly successful in this regard. Heuristic-based methods that use domain knowledge to guide a model checker can also be effective in dealing with large systems. In this work, we present an abstraction and heuristic-based model checking algorithm (called Static Abstraction Guided model checking) that verifies the safety properties of a system. Unlike other abstraction-based approaches, this work proposes a model-checking algorithm that uses a sequence of abstract models as input, and a method to refine counterexamples to determine whether they are spurious or real. During this refinement, abstract models in the sequence are used as heuristics to guide the model checker. This tight integration of abstraction and guidance is doubly effective in countering state explosion. This paper deals with the theoretical and algorithmic aspects of the approach only.
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
Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)
Alur, R., Dill, D.L.: Automata for modeling real-time systems. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 322–335. Springer, Heidelberg (1990)
Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification (preliminary report). In: Proceedings of the Symposium on Logic in Computer Science, Cambridge, Massachusetts, June 16-18, pp. 332–344. IEEE, Los Alamitos (1986)
McMillan, K.: Symbolic model checking. Kluwer Academic Publishers, Boston (1993)
Kurshan, R.P.: Computer-aided Verificaton of Coordinating Processes. Princeton University Press, Princeton (1994)
Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. ACM Transactions on Programming Languages and Systems 16, 1512–1542 (1994)
Dams, D., Gerth, R., Grumberg, O.: Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems 19, 253–291 (1997)
Cleaveland, R., Iyer, S.P., Yankelevich, D.: Optimality in abstractions of model checking. In: Mycroft, A. (ed.) SAS 1995. LNCS, vol. 983, pp. 51–63. Springer, Heidelberg (1995)
Cousot, P., Cousot, R.: Abstract interpretation frameworks. Journal of Logic and Computation 2, 511–547 (1992)
Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 154–169. Springer, Heidelberg (2000)
Clarke, E., Gupta, A., Kukula, J., Strichman, O.: SAT based abstractionrefinement using ILP and machine learning techniques. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 265–279. Springer, Heidelberg (2002)
Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: Proceedings of The 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, January 16-18, pp. 58–70. ACM, New York (2002)
Shoham, S., Grumberg, O.: Monotonic abstraction-refinement for ctl. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 546–560. Springer, Heidelberg (2004)
Glusman, M., Kamhi, G., Mador-Haim, S., Fraer, R., Vardi, M.Y.: Multiplecounterexample guided iterative abstraction refinement: An industrial evaluation. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 176–191. Springer, Heidelberg (2003)
Yang, C.H., Dill, D.L.: Validation with guided search of the state space. In: Proceedings of the 35th Conference on Design Automation, Moscone center, San Francico, California, USA, June 15-19, pp. 599–604. ACM Press, New York (1998)
Edelkamp, S., Reffel, F.: OBDDs in heuristic search. In: Herzog, O. (ed.) KI 1998. LNCS, vol. 1504, pp. 81–92. Springer, Heidelberg (1998)
Bloem, R., Ravi, K., Somenzi, F.: Symbolic guided search for CTL model checking. In: Proceedings of the 37th Conference on Design Automation, Los Angeles, CA, June 5-9, pp. 29–34. ACM, New York (2000)
Edelkamp, S., Lafuente, A.L., Leue, S.: Directed explicit model checking with HSF– SPIN. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol. 2057, pp. 57–79. Springer, Heidelberg (2001)
Larsen, K.G., Behrmann, G., Brinksma, E., Fehnker, A., Hune, T., Pettersson, P., Romijn, J.: As cheap as possible: Efficient cost-optimal reachability for priced timed automata. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 493–505. Springer, Heidelberg (2001)
Santone, A.: Heuristic search + local model checking in selective mu-calculus. IEEE Transactions on Software Engineering 29, 510–523 (2003)
Nymeyer, A., Qian, K.: Heuristic search algorithm based on symbolic data structures. In: Gedeon, T(T.) D., Fung, L.C.C. (eds.) AI 2003. LNCS (LNAI), vol. 2903, pp. 966–979. Springer, Heidelberg (2003)
Qian, K., Nymeyer, A.: Guided invariant model checking based on abstraction and symbolic pattern databases. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 497–511. Springer, Heidelberg (2004)
Iwashita, K., Nakata, T.: CTL model checking based on forward state traversal. In: Proceedings of the International Conference on Computer Aided Design, pp. 400–404. IEEE Press, Los Alamitos (1996)
Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, USA (1984)
Hansen, E., Zhou, R., Feng, Z.: Symbolic heuristic search using decision diagrams. In: Koenig, S., Holte, R.C. (eds.) SARA 2002. LNCS (LNAI), vol. 2371, pp. 83–98. Springer, Heidelberg (2002)
Jensen, R.M., Bryant, R.E., Veloso, M.M.: Seta*: An efficient bdd-based heuristic search algorithm. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, Alberta, Canada, Alberta, Canada, July 28 - August 1, pp. 668–673. AAAI Press, Menlo Park (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qian, K., Nymeyer, A. (2004). Abstraction-Based Model Checking Using Heuristical Refinement. In: Wang, F. (eds) Automated Technology for Verification and Analysis. ATVA 2004. Lecture Notes in Computer Science, vol 3299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30476-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-30476-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23610-8
Online ISBN: 978-3-540-30476-0
eBook Packages: Springer Book Archive