Abstract
Abstraction is one of the most important strategies for dealing with the state space explosion problem in model checking. In the abstract model, the state space is largely reduced, however, a counterexample found in such a model may not be a real counterexample. Accordingly, the abstract model needs to be further refined where an NP-hard state separation problem is often involved. In this paper, a novel method is presented, in which extra variables are added to the abstract model for the refinement. With this method, not only the NP-hard state separation problem can be avoided, but also a smaller refined abstract model can be obtained.
This research is supported by the NSFC Grant No. 61003078, 60873018, 91018010 and 60910004, National Program on Key Basic Research Project of China (973 Program) Grant No.2010CB328102 and ISN Lab Grant No.ISN1102001.
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.
Similar content being viewed by others
References
Clarke, E.M., Emerson, E.A.: Desigh and syntesis of of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131. Springer, Heidelberg (1982)
Quielle, J.P., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: Proceedings of the 5th International Symposium on Programming, pp. 337–350 (1981)
Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample guided abstraction refinement. In: Emerson, E., Sistla, A. (eds.) CAV 2000. LNCS, vol. 1855. Springer, Heidelberg (2000)
Kripke, S.A.: Semantical analysis of modal logic I: normal propositional calculi. Z. Math. Logik Grund. Math. 9, 67–96 (1963)
Clarke, E.M., Gupta, A., Strichman, O.: SAT Based Counterexample-Guided Abstraction-Refinement. IEEE Trans. Computer Aided Design 23(7), 1113–1123 (2004)
He, F., Song, X., Hung, W.N.N., Gu, M., Sun, J.: Integrating Evolutionary Computation with Abstraction Refinement for Model Checking. IEEE Trans. Computers 59(1), 116–126 (2010)
Rushby, J.: Integrated formal verification: Using model checking with automated abstraction, invariant generation, and theorem proving. Presented at Theoretical and Practical Aspects of SPIN Model Checking: Proc. 5th and 6th Int. SPIN Workshops, citeseer.nj.nec.com/rushby99integrated.html
He, F., Song, X., Gu, M., Sun, J.-G.: Heuristic-Guided Abstraction Refinement. Comput. J. 52(3), 280–287 (2009)
He, F., Song, X., Hung, W.N.N., Gu, M., Sun, J.: Integrating Evolutionary Computation with Abstraction Refinement for Model Checking. IEEE Trans. Computers 59(1), 116–126 (2010)
Kurshan, R.P.: Computer Aided Verificaton of Coordinating Processes. Princeton Univ. Press, Princeton (1994)
Wang, C., Li, B., Jin, H., Hachtel, G.D., Somenzi, F.: Improving Ariadne’s Bundle by Following Multiple Threads in Abstraction Refinement. IEEE Trans. Computer Aided Design 25(11), 2297–2316 (2006)
Clarke, E.M., Gupta, A., Kukula, J.H., Strichman, O.: SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 265–279. Springer, Heidelberg (2002)
Chauhan, P., Clarke, E.M., Kukula, J., Sapra, S., Veith, H., Wang, D.: Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis. In: Aagaard, M.D., O’Leary, J.W. (eds.) FMCAD 2002. LNCS, vol. 2517. Springer, Heidelberg (2002)
Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy Abstraction. In: Proc. Symp. Principles of Programming Languages, pp. 58–70 (2002)
Glusman, M., Kamhi, G., Mador-Haim, S., Fraer, R., Vardi, M.Y.: Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 176–191. Springer, Heidelberg (2003)
Govindaraju, S.G., Dill, D.L.: Counterexample-Guided Choice of Projections in Approximate Symbolic Model Checking. In: Proc. Int’l Conf. Computer-Aided Design (ICCAD), pp. 115–119 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tian, C., Duan, Z. (2011). Making Abstraction-Refinement Efficient in Model Checking. In: Fu, B., Du, DZ. (eds) Computing and Combinatorics. COCOON 2011. Lecture Notes in Computer Science, vol 6842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22685-4_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-22685-4_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22684-7
Online ISBN: 978-3-642-22685-4
eBook Packages: Computer ScienceComputer Science (R0)