Skip to main content
SpringerLink
Log in

Search Space Partition and Case Basis Exploration for Reducing Model Checking Complexity

  • Conference paper
Automated Technology for Verification and Analysis (ATVA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3299))

Abstract

The main disadvantage of model checking is the state explosion problem that can occur if the system being verified has many asynchronous components. Many approaches have been proposed to deal with this challenge. This paper extends an approach that suggests combining static analysis and partition of model checking tasks into different cases for reducing the complexity of model checking and introduces algorithms and a tool for the static analysis. This extended approach and the tool are then applied to models of known authentication protocols and operating procedures, which shows that the approach and the tool could have a wide range of applications.

This work is supported by the National Natural Science Foundation of China under Grant No. 60223005 and No. 60373050, 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

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Chapter  Google Scholar 

  2. Emerson, E.A.: Temporal and Modal Logic. Handbook of Theoretical Computer Science B, 997–1072 (1990)

    Google Scholar 

  3. Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)

    MATH  Google Scholar 

  4. Holzmann, G.J.: Design and Validation of Computer Protocols. Prentice Hall, New Jersey (1991)

    Google Scholar 

  5. Holzmann, G.J.: The model checker Spin. IEEE Transactions on Software Engineering 23(5), 279–295 (1997)

    Article  MathSciNet  Google Scholar 

  6. Lowe, G.: Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In: Proceedings of the 2nd International Workshop on Tools and Algorithms for the construction and Analysis of Systems

    Google Scholar 

  7. Lowe, G., Roscoe, A.W.: Using CSP to Detect Errors in the TMN Protocol. IEEE Trans. Software Eng. 23(10), 659–669 (1997)

    Article  Google Scholar 

  8. Mason, T., Levine, J., Brown, D.: Lex & Yacc, 2nd edn. O’Reilly and Associates, California (1992)

    Google Scholar 

  9. 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–234. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  10. Millett, L.I., Teitelbaum, T.: Issues in Slicing PROMELA and Its Applications to Model Checking, Protocol Understanding, and Simulation. STTT 2(4), 343–349 (2000)

    Article  MATH  Google Scholar 

  11. 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)

    Chapter  Google Scholar 

  12. Sun, H.-B., Lin, D.-D.: An improvement of the TMN protocol based on trapdoor oneway functions. Journal of the Graduate School of the Chinese Academy of Sciences 19(3), 254–262 (2002)

    MathSciNet  Google Scholar 

  13. Zhang, W.: Model checking operator procedures. In: Dams, D.R., Gerth, R., Leue, S., Massink, M. (eds.) SPIN 1999. LNCS, vol. 1680, pp. 200–215. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  14. Zhang, W.: Validation of control system specifications with abstract plant models. In: Koornneef, F., van der Meulen, M.J.P. (eds.) SAFECOMP 2000. LNCS, vol. 1943, pp. 53–62. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  15. Zhang, W.: Combining Static Analysis and Case-Based Search Space Partitioning for Reducing Peak Memory in Model Checking. Journal of Computer Science and Technology 18(6), 762–770 (2003)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, P.O.Box 8718, Beijing, China

    Bai Su & Wenhui Zhang

  2. Graduate School of the Chinese Academy of Sciences, 19 Yuquan Street, Beijing, China

    Bai Su

Authors
  1. Bai Su
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wenhui Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Grad. Inst. of Electronic Engineering, National Taiwan University, Taiwan, ROC

    Farn Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Su, B., Zhang, W. (2004). Search Space Partition and Case Basis Exploration for Reducing Model Checking Complexity. 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_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30476-0_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23610-8

  • Online ISBN: 978-3-540-30476-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation