Advertisement

Linking STeP with SPIN

  • Anca Browne
  • Henny Sipma
  • Ting Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1885)

Abstract

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.

Keywords

Model Checker Computer Science Department Preliminary Experimental Result Dine Philosopher Weakly Fair 
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.

Unable to display preview. Download preview PDF.

References

  1. [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/
  2. [Bjø98]
    Bjørner, N.S.: Integrating Decision Procedures for Temporal Verification. PhD thesis, Computer Science Department, Stanford University (November 1998)Google Scholar
  3. [FMS98]
    Finkbeiner, B., Manna, Z., Sipma, H.B.: Deductive verification of modular systems. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol. 1536, pp. 239–275. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  4. [Hol91]
    Holzmann, G.: The Design and Validation of Computer Protocols. Prentice Hall Software Series. Prentice Hall, Englewood Cliffs (1991)Google Scholar
  5. [Hol97]
    Holzmann, G.: The model checker spin. IEEE Transaction on Software Engineering 23(5), 279–295 (1997)CrossRefMathSciNetGoogle Scholar
  6. [MBSU98]
    Manna, Z., Browne, A., Sipma, H.B., Uribe, T.E.: Visual abstractions for temporal verification. In: Haeberer, A.M. (ed.) AMAST 1998. LNCS, vol. 1548, pp. 28–41. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  7. [MP95]
    Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, New York (1995)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Anca Browne
    • 1
  • Henny Sipma
    • 1
  • Ting Zhang
    • 1
  1. 1.Computer Science DepartmentStanford UniversityStanfordUSA

Personalised recommendations