Skip to main content

Linking ST e P with SPIN

  • Conference paper
  • 589 Accesses

Part of the book series: Lecture Notes in Computer Science ((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.

This research was supported in part by the National Science Foundation under grant CCR-98-04100 and CCR-99-00984 ARO under grants DAAH04-96-1-0122 and DAAG55-98-1-0471, ARO under MURI grant DAAH04-96-1-0341, by Army con- tract DABT63-96-C-0096 (DARPA), by Air Force contract F33615-99-C-3014, and by ARPA/Air Force contracts F33615-00-C-1693 and F33615-99-C-3014

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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ørner, N.S.: Integrating Decision Procedures for Temporal Verification. PhD thesis, Computer Science Department, Stanford University (November 1998)

    Google Scholar 

  3. 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)

    Chapter  Google Scholar 

  4. Holzmann, G.: The Design and Validation of Computer Protocols. Prentice Hall Software Series. Prentice Hall, Englewood Cliffs (1991)

    Google Scholar 

  5. Holzmann, G.: The model checker spin. IEEE Transaction on Software Engineering 23(5), 279–295 (1997)

    Article  MathSciNet  Google Scholar 

  6. 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)

    Chapter  Google Scholar 

  7. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, New York (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Browne, A., Sipma, H., Zhang, T. (2000). Linking ST e P with SPIN. In: Havelund, K., Penix, J., Visser, W. (eds) SPIN Model Checking and Software Verification. SPIN 2000. Lecture Notes in Computer Science, vol 1885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722468_11

Download citation

  • DOI: https://doi.org/10.1007/10722468_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41030-0

  • Online ISBN: 978-3-540-45297-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics