Skip to main content
SpringerLink
Log in

Directed explicit model checking with HSF-SPIN

  • Conference paper
  • First Online:
Model Checking Software (SPIN 2001)

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

Included in the following conference series:

Abstract

We present the explicit state model checker HSF-SPIN which is based on the model checker SPIN and its Promela modeling language. HSF-SPIN incorporates directed search algorithms for checking safety and a large class of LTL-specified liveness properties. We start off from the A* algorithm and define heuristics to accelerate the search into the direction of a specified failure situation. Next we propose an improved nested depth-first search algorithm that exploits the structure of Promela Never-Claims. As a result of both improvements, counterexamples will be shorter and the explored part of the state space will be smaller than with classical approaches, allowing to analyze larger state spaces. We evaluate the impact of the new heuristics and algorithms on a set of protocol models, some of which are real-world industrial protocols.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. A. Biere. μcke-efficient μ-calculus model checking. In Computer Aided Verification, pages 468–471, 1997.

    Google Scholar 

  2. D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 30(2):323–342, Apr 1983.

    Article  MATH  MathSciNet  Google Scholar 

  3. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000.

    Google Scholar 

  4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, 1990.

    Google Scholar 

  5. A. D. E. Muller and P. Schnupp. Alternating automata. the weak monadic theory of the tree and its complexity. In International Colloquim on Automata, Languages and Programming.

    Google Scholar 

  6. R. Dial. Shortest path forest with topological ordering. Communications of the ACM, pages 632–633, 1969.

    Google Scholar 

  7. E. W. Dijkstra. A note on two problems in connection with graphs. Numerische Mathematik, 1:269–271, 1959.

    Article  MATH  MathSciNet  Google Scholar 

  8. M. B. Dwyer, G. S. Avrunin, and J. C. Corbett. Patterns in property specifications for finite-state verification. In International Conference on Software Engineering, 1999.

    Google Scholar 

  9. S. Edelkamp. Data Structures and Learning Algorithms in State Space Search. PhD thesis, University of Freiburg, 1999. Infix.

    Google Scholar 

  10. S. Edelkamp, A. L. Lafuente, and S. Leue. Protocol verification with heuristic search. In AAAI Symposium on Model-based Validation of Intelligence, 2001.

    Google Scholar 

  11. S. Edelkamp and F. Reffel. OBDDs in heuristic search. In German Conference on Artificial Intelligence (KI), pages 81–92, 1998.

    Google Scholar 

  12. M. G. Gouda. Protocol verification made simple: a tutorial. Computer Networks and ISDN Systems, 25(9):969–980, 1993.

    Article  Google Scholar 

  13. P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for heuristic determination of minimum path cost. IEEE Trans. on SSC, 4:100, 1968.

    Google Scholar 

  14. G. Holzmann. An analysis of bitstate hashing. Formal Methods in System Design, 13(3):287–305, November 1998. extended and revised version of Proc. PSTV95, pp. 301-314.

    Article  MathSciNet  Google Scholar 

  15. G. Holzmann, D. Peled, and M. Yannakakis. On nested depth first search. In The Spin Verification System, pages 23–32. American Mathematical Society, 1996.

    Google Scholar 

  16. G. J. Holzmann. On limits and possibilities of automated protocol analysis. In Protocol Specification, Testing, and Verification, 1987.

    Google Scholar 

  17. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1990.

    Google Scholar 

  18. M. Kamel and S. Leue. Formalization and validation of the general inter-orb protocol (GIOP) using Promela and SPIN. In Software Tools for Technology Transfer, volume 2, pages 394–409, 2000.

    Article  MATH  Google Scholar 

  19. M. Kamel and S. Leue. Vip: A visual editor and compiler for v-promela. In 6th International Conference, TACAS 2000, volume 1785 of Lecture Notes in Computer Science, pages 471–486. Springer, 2000.

    Google Scholar 

  20. F. J. Lin, P. M. Chu, and M. Liu. Protocol verification using reachability analysis: the state space explosion problem and relief strategies. ACM, pages 126–135, 1988.

    Google Scholar 

  21. K. McMillan. Symbolic Model Checking. Kluwer Academic Press, 1993.

    Google Scholar 

  22. D. McVitie and L. Wilson. The stable marriage problem. Communications of the ACM, 1971.

    Google Scholar 

  23. A. Miller and M. Calder. Analysing a basic call protocol using promela/xspin. In International SPIN Workshop, 1998.

    Google Scholar 

  24. T. Nakatani. Verification of group address registration protocol using promela and spin. In International SPIN Workshop, 1997.

    Google Scholar 

  25. K. R. Bloem and F. Somenzi. Symbolic guided search for ctl model checking. In Conference on Design Automation (DAC-00).

    Google Scholar 

  26. F. Reffel and S. Edelkamp. Error detection with directed symbolic model checking. In World Congress on Formal Methods, pages 195–211. Springer, 1999.

    Google Scholar 

  27. F. Somenzi and R. Bloem. Efficient buchi automata from ltl formulae. In Computer Aided Verification.

    Google Scholar 

  28. P. van Eijk. Verifying relay circuits using state machines. In International SPIN Workshop.

    Google Scholar 

  29. W. Visser and H. Barringer. Ctl* model checking for spin. Software Tools for Technology Transfer, 2000.

    Google Scholar 

  30. C. H. Yang and D. L. Dill. Validation with guided search of the state space. In DAC, pages 599–604, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Albert-Ludwigs-Universität, Georges-Köhler-Allee, D-79110, Freiburg

    Stefan Edelkamp, Alberto Lluch Lafuente & Stefan Leue

Authors
  1. Stefan Edelkamp
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alberto Lluch Lafuente
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stefan Leue
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing and Information Sciences, Kansas State University, 234 Nichols Hall, Manhattan, KS, 66506-2302, USA

    Matthew Dwyer

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Edelkamp, S., Lafuente, A.L., Leue, S. (2001). Directed explicit model checking with HSF-SPIN. In: Dwyer, M. (eds) Model Checking Software. SPIN 2001. Lecture Notes in Computer Science, vol 2057. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45139-0_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-45139-0_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42124-5

  • Online ISBN: 978-3-540-45139-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation