Abstract
The number of installations of the Spin model checking tool is steadily increasing. There are well over two thousand installations today, divided roughly evenly over academic and industrial sites. The tool itself also continues to evolve; it has more than doubled in size, and hopefully at least equally so in functionality, since it was first distributed in early 1991. The tool runs on most standard workstations, and starting with version 2.8 also on standard PCs.
In this overview, we summarize the design principles of the tool, and review its current state.
Keywords
- Linear Temporal Logic
- Liveness Property
- Communicate Sequential Process
- Linear Temporal Logic Formula
- State Space Explosion
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
C-T. Chou, D. Peled, Verifying a Model-Checking Algorithm, TACAS'96, Tools and Algorithms for the Construction and Analysis of Systems, Passau, Germany, March 1996.
C. Courcoubetis, M. Vardi, P. Wolper, M. Yannakakis, Memory-efficient algorithms for the verification of temporal properties, Formal methods in system design 1 (1992) 275–288.
E. Dijkstra, Guarded commands, nondeterminacy and formal derivation of programs, Comm. ACM, 18(8), 1975, 453–457.
R. Gerth, D. Peled, M.Y. Vardi, P. Wolper, Simple On-the-fly Automatic Verification of Linear Temporal Logic, PSTV95, Protocol Specification Testing and Verification, Warsaw, Poland. Chapman & Hall, Germany, 1995, 173–184.
C.A.R. Hoare, Communicating Sequential Processes, Comm. ACM, 21(8), 1978, 666–677.
G.J. Holzmann, An Improved Protocol Reachability Analysis Technique, Software Practice and Experience, Feb 1988, Vol 18, No 2, pp. 137–161.
G.J. Holzmann, Design and Validation of Computer Protocols, Prentice Hall, 1992.
G.J. Holzmann, D. Peled, An Improvement in Formal Verification, 7th Int. Conf. on Formal Description Techniques, Berne, Switzerland, 1994, 177–194.
G.J. Holzmann, An Analysis of Bitstate Hashing, PSTV95, Protocol Specification Testing and Verification, Warsaw, Poland, Chapman & Hall, Germany, 1995, 301–314.
G.J. Holzmann, D. Peled, M. Yannakakis, On Nested Depth-First Search, In preparation, 1996.
B.W. Kernighan, D.M. Ritchie, The C programming Language, Prentice Hall, 1988.
R.P. Kurshan, Computer-Aided Verification of Coordinating Processes, Princeton University Press, 1994.
D. Peled, Combining Partial Order Reductions with On-the-fly Model-Checking, Proc. CAV'94, 6th International Conference on Computer Aided Verification, LNCS 818, Springer-Verlag, 377–390, 1994, Stanford CA, USA.
D. Peled, Partial Order Reduction: Model-Checking using Representatives, Proc. MFCS'96, 21st International Symposium on Mathamatical Foundations of Computer Science, September 1996, Cracow, Poland.
A. Pnueli, The temporal logic of programs, Proc. of the 18th IEEE Symp. on Foundation of Computer Science, 1977, 46–57.
M.Y. Vardi, P. Wolper, An automata-theoretic approach to automatic program verification, Proc. of the 1st Symposium on Logic in Computer Science, 1986, Cambridge, England, 322–331.
P. Wolper, Temporal Logic Can be More Expressive, Information and Control 56 (1983), 72–99.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Holzmann, G.J., Peled, D. (1996). The state of Spin. In: Alur, R., Henzinger, T.A. (eds) Computer Aided Verification. CAV 1996. Lecture Notes in Computer Science, vol 1102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61474-5_85
Download citation
DOI: https://doi.org/10.1007/3-540-61474-5_85
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61474-6
Online ISBN: 978-3-540-68599-9
eBook Packages: Springer Book Archive