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.
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
A. Biere. μcke-efficient μ-calculus model checking. In Computer Aided Verification, pages 468–471, 1997.
D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 30(2):323–342, Apr 1983.
E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000.
T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, 1990.
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.
R. Dial. Shortest path forest with topological ordering. Communications of the ACM, pages 632–633, 1969.
E. W. Dijkstra. A note on two problems in connection with graphs. Numerische Mathematik, 1:269–271, 1959.
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.
S. Edelkamp. Data Structures and Learning Algorithms in State Space Search. PhD thesis, University of Freiburg, 1999. Infix.
S. Edelkamp, A. L. Lafuente, and S. Leue. Protocol verification with heuristic search. In AAAI Symposium on Model-based Validation of Intelligence, 2001.
S. Edelkamp and F. Reffel. OBDDs in heuristic search. In German Conference on Artificial Intelligence (KI), pages 81–92, 1998.
M. G. Gouda. Protocol verification made simple: a tutorial. Computer Networks and ISDN Systems, 25(9):969–980, 1993.
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.
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.
G. Holzmann, D. Peled, and M. Yannakakis. On nested depth first search. In The Spin Verification System, pages 23–32. American Mathematical Society, 1996.
G. J. Holzmann. On limits and possibilities of automated protocol analysis. In Protocol Specification, Testing, and Verification, 1987.
G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1990.
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.
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.
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.
K. McMillan. Symbolic Model Checking. Kluwer Academic Press, 1993.
D. McVitie and L. Wilson. The stable marriage problem. Communications of the ACM, 1971.
A. Miller and M. Calder. Analysing a basic call protocol using promela/xspin. In International SPIN Workshop, 1998.
T. Nakatani. Verification of group address registration protocol using promela and spin. In International SPIN Workshop, 1997.
K. R. Bloem and F. Somenzi. Symbolic guided search for ctl model checking. In Conference on Design Automation (DAC-00).
F. Reffel and S. Edelkamp. Error detection with directed symbolic model checking. In World Congress on Formal Methods, pages 195–211. Springer, 1999.
F. Somenzi and R. Bloem. Efficient buchi automata from ltl formulae. In Computer Aided Verification.
P. van Eijk. Verifying relay circuits using state machines. In International SPIN Workshop.
W. Visser and H. Barringer. Ctl* model checking for spin. Software Tools for Technology Transfer, 2000.
C. H. Yang and D. L. Dill. Validation with guided search of the state space. In DAC, pages 599–604, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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