论文信息 - Linking STeP with SPIN

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.

Henny B. Sipma | Ting Zhang | Anca Browne

[1] Gerard J. Holzmann,et al. Design and validation of computer protocols , 1991 .

[2] Zohar Manna,et al. Temporal verification of reactive systems - safety , 1995 .

[3] Gerard J. Holzmann,et al. The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[4] Zohar Manna,et al. Temporal Verification of Reactive Systems , 1995, Springer New York.

[5] Henny B. Sipma,et al. Visual Abstractions for Temporal Verification , 1999, AMAST.

[6] Bernd Finkbeiner,et al. Deductive Verification of Modular Systems , 1997, COMPOS.

[7] Z. Manna,et al. Deductive Veri cation of Modular Systems ? , 1997 .

[8] Amir Pnueli,et al. Compositionality: The Significant Difference , 1999, Lecture Notes in Computer Science.

[9] Martin Peschke,et al. Design and Validation of Computer Protocols , 2003 .

[10] Z. Manna,et al. Integrating decision procedures for temporal verification , 1998 .