Abstract
The state space explosion is the key obstacle of model checking. Even a relatively small system specification may yield a very large state space. The case-based approach based on search space partition has been proposed in [18, 19] for reducing model checking complexity. This paper extends the approach by considering wider ranges of case-bases of models and multiple case-bases such that it can be applied to more types of applications. The improved approach also combines the search space partition and static analysis or expert knowledge for guaranteeing the completeness of the cases. The case study demonstrates the potential advantages of the strategy and show that the strategy may improve the efficiency of system verification and therefore scale up the applicability of the verification approach.
This work is supported by the National Natural Science Foundation of China under Grant No. 60223005, 60373050, 60421001, and 60573012, and the National Grand Fundamental Research 973 Program of China under Grant No. 2002cb312200.
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
McMillan, K.L.: Verification of Infinite State Systems by Compositional Model Checking. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol. 1703, pp. 219–237. Springer, Heidelberg (1999)
Bloem, R., Ravi, K., Somenzi, F.: Efficient Decision Procedures for Model Checking of Linear Time Logic Properties. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 222–235. Springer, Heidelberg (1999)
Amla, N., Kurshan, R., McMillan, K.L., Medel, R.: Experimental Analysis of Different Techniques for Bounded Model Checking. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 34–48. Springer, Heidelberg (2003)
David, B.B., Eisner, C., Geist, D., Wolfsthal, Y.: Model Checking at IBM. Formal Methods in System Design 22, 101–108 (2003)
Yorav, K., Ogumber: Static Analysis for Stats-Space Reductions Preserving Temporal Logics. Formal Methods in System Design 25, 67–96 (2004)
Millett, L.I., Teitelbaum, T.: Issues in Slicing PROMELA and Its Application to Model Checking, Protocol Understanding, and Simulation. International Journal on Software Tools for Technology Transfer 2(4), 343–349 (2000)
Holzmann, G.J.: The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley, Reading (2004)
Clark, E.M., Grumberg, O., Peled, D.: Model Checking. The MIT Press, Cambridge (1999)
Maggi, P., Sisto, R.: Using SPIN to Verify Security Properties of Cryptographic Protocols. In: Bošnački, D., Leue, S. (eds.) SPIN 2002. LNCS, vol. 2318, pp. 187–204. Springer, Heidelberg (2002)
Godefroid, P., Sistla, A.P.: Symmetric and Reduced Symmetry in Model Checking. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 91–103. Springer, Heidelberg (2001)
Bosnacki, D., Dams, D., Holenderski, L.: Symmetric Spin. International Journal on Software Tools for Technology Transfer 4, 92–106 (2002)
Clarke, E.M., Grumberg, O., Long, D.E.: Model Checking and Abstraction. ACM Transactions on Programming Languages and Systems 16(5), 1512–1542 (1994)
Peled, D.: Ten Years of Partial Order Reduction. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 17–28. Springer, Heidelberg (1998)
Holzmann, G.J.: Design and Validation of Computer Protocols. Prentice-Hall, Englewood Cliffs (1991)
Lowe, G.: Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR. In: Proceedings of 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems(TACAS 1996). LNCS, vol. 1055, pp. 147–166. Springer, Heidelberg (1996)
Berezin, S., Campos, S., Clarke, E.M.: Compositional Reasoning in Model Checking. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol. 1536, pp. 81–102. Springer, Heidelberg (1998)
Emerson, E.A.: Temporal and Modal Logic. Handbook of Theoretical Computer Science (B), 997–1072 (1990)
Su, B., Zhang, W.: Search Space Partition and Case Basis Exploration for Reducing Model Checking Complexity. In: Wang, F. (ed.) ATVA 2004. LNCS, vol. 3299, pp. 34–48. Springer, Heidelberg (2004)
Zhang, W.: Combining Static Analysis and Case-Based Search Space Partition for Reducing Peek Memory in Model Checking. Journal of Computer Science and Technology 18(6), 762–770 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pu, F., Zhang, W., Wang, S. (2006). An Improved Case-Based Approach to LTL Model Checking. In: Guelfi, N., Savidis, A. (eds) Rapid Integration of Software Engineering Techniques. RISE 2005. Lecture Notes in Computer Science, vol 3943. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751113_14
Download citation
DOI: https://doi.org/10.1007/11751113_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34063-8
Online ISBN: 978-3-540-34064-5
eBook Packages: Computer ScienceComputer Science (R0)