Distributed-Memory Model Checking with SPIN
The main limiting factor of the model checker SPIN is currently the amount of available physical memory. This paper explores the possibility of exploiting a distributed-memory execution environment, such as a network of workstations interconnected by a standard LAN, to extend the size of the verification problems that can be successfully handled by SPIN. A distributed version of the algorithm used by SPIN to verify safety properties is presented, and its compatibility with the main memory and complexity reduction mechanisms of SPIN is discussed. Finally, some preliminary experimental results are presented.
KeywordsPartition Function Network Node Hash Table State Component Average Fraction
Unable to display preview. Download preview PDF.
- 2.P. J. A. de Villiers and W. C. Visser. ESML—a validation language for concurrentsystems. South African Computer Journal, 7:59–64, July 1992.Google Scholar
- 3.J.-Ch. Gr-egoire. State space compression in Spin with GETSs. In Proceedings of the 2nd SPIN Workshop, 1996.Google Scholar
- 4.G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall Software Series, 1991.Google Scholar
- 5.G. J. Holzmann. State compression in Spin: recursive indexing and compression training runs. In Proceedings of the 3rd SPIN Workshop, 1997.Google Scholar
- 6.J. Rushby. Mechanized formal methods: progress and prospects. In Proceedings of the 16th Conference on the Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science #1180, pages 43–51. Springer-Verlag, December 1996.Google Scholar
- 7.W. C. Visser. Memory efficient state storage in Spin. In Proceedings of the 2nd SPIN Workshop, 1996.Google Scholar