CAV 1996: Computer Aided Verification pp 383-389 | Cite as
The state of Spin
Conference paper
First Online:
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.
Preview
Unable to display preview. Download preview PDF.
References
- 1.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.Google Scholar
- 2.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.CrossRefGoogle Scholar
- 3.E. Dijkstra, Guarded commands, nondeterminacy and formal derivation of programs, Comm. ACM, 18(8), 1975, 453–457.CrossRefGoogle Scholar
- 4.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.Google Scholar
- 5.C.A.R. Hoare, Communicating Sequential Processes, Comm. ACM, 21(8), 1978, 666–677.CrossRefGoogle Scholar
- 6.G.J. Holzmann, An Improved Protocol Reachability Analysis Technique, Software Practice and Experience, Feb 1988, Vol 18, No 2, pp. 137–161.Google Scholar
- 7.G.J. Holzmann, Design and Validation of Computer Protocols, Prentice Hall, 1992.Google Scholar
- 8.G.J. Holzmann, D. Peled, An Improvement in Formal Verification, 7th Int. Conf. on Formal Description Techniques, Berne, Switzerland, 1994, 177–194.Google Scholar
- 9.G.J. Holzmann, An Analysis of Bitstate Hashing, PSTV95, Protocol Specification Testing and Verification, Warsaw, Poland, Chapman & Hall, Germany, 1995, 301–314.Google Scholar
- 10.G.J. Holzmann, D. Peled, M. Yannakakis, On Nested Depth-First Search, In preparation, 1996.Google Scholar
- 11.B.W. Kernighan, D.M. Ritchie, The C programming Language, Prentice Hall, 1988.Google Scholar
- 12.R.P. Kurshan, Computer-Aided Verification of Coordinating Processes, Princeton University Press, 1994.Google Scholar
- 13.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.Google Scholar
- 14.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.Google Scholar
- 15.A. Pnueli, The temporal logic of programs, Proc. of the 18th IEEE Symp. on Foundation of Computer Science, 1977, 46–57.Google Scholar
- 16.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.Google Scholar
- 17.P. Wolper, Temporal Logic Can be More Expressive, Information and Control 56 (1983), 72–99.CrossRefGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 1996