Linking STeP with SPIN
We have connected ST e P, the Stanford Temporal Prover, with SPIN, an LTL model checker. In this paper we describe the translation of fair transition systems into Promela, in particular how weak and strong fairness constraints are handled. The paper presents some preliminary experimental results using this connection.
KeywordsModel Checker Computer Science Department Preliminary Experimental Result Dine Philosopher Weakly Fair
Unable to display preview. Download preview PDF.
- [BBC+95]Bjørner, N.S., Browne, A., Chang, E.S., Colón, M., Kapur, A., Manna, Z., Sipma, H.B., Uribe, T.E.: STeP: The Stanford Temporal Pro- ver, User’s Manual. Technical Report STAN-CS-TR-95-1562, Computer Science Department, Stanford University (November 1995), available from http://www-step.stanford.edu/
- [Bjø98]Bjørner, N.S.: Integrating Decision Procedures for Temporal Verification. PhD thesis, Computer Science Department, Stanford University (November 1998)Google Scholar
- [Hol91]Holzmann, G.: The Design and Validation of Computer Protocols. Prentice Hall Software Series. Prentice Hall, Englewood Cliffs (1991)Google Scholar
- [MP95]Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, New York (1995)Google Scholar