SPIN Model Checking and Software Verification

7th International SPIN Workshop, Stanford, CA, USA, August 30 - September 1, 2000. Proceedings

  • Klaus Havelund
  • John Penix
  • Willem Visser
Conference proceedings SPIN 2000

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1885)

Table of contents

  1. Front Matter
  2. Papers

    1. Dragan Bošnački, Dennis Dams, Leszek Holenderski
      Pages 1-19
    2. Radu Iosif, Riccardo Sisto
      Pages 20-33
    3. Bengi Karaçali, Kuo-Chung Tai
      Pages 34-53
    4. Ed Brinksma, Angelika Mader
      Pages 73-92
    5. Nicholas Weininger, Darren Cofer
      Pages 93-112
    6. Thomas Ball, Sriram K. Rajamani
      Pages 113-130
    7. Gerard J. Holzmann
      Pages 131-147
    8. Anca Browne, Henny Sipma, Ting Zhang
      Pages 181-186
    9. Elena Fersman, Bengt Jonsson
      Pages 187-204
    10. James C. Corbett, Matthew B. Dwyer, John Hatcliff, Robby
      Pages 205-223
    11. Matthieu Martel, Marc Gengler
      Pages 265-286
    12. Theo C. Ruys
      Pages 287-321
  3. Tool Tutorials

    1. Philippa Broadfoot, Bill Roscoe
      Pages 322-322
    2. Doron Drusinsky
      Pages 323-330
  4. Back Matter

About these proceedings


The SPIN workshop is a forum for researchers interested in the subject of automata-based, explicit-state model checking technologies for the analysis and veri?cation of asynchronous concurrent and distributed systems. The SPIN - del checker (, developed by Gerard Holzmann, is one of the best known systems of this kind, and has attracted a large user community. This can likely be attributed to its e?cient state exploration algorithms. The fact that SPIN’s modeling language, Promela, resembles a programming language has probably also contributed to its success. Traditionally, the SPIN workshops present papers on extensions and uses of SPIN. As an experiment, this year’s workshop was broadened to have a slightly wider focus than previous workshops in that papers on software veri?cation were encouraged. Consequently, a small collection of papers describe attempts to analyze and verify programs written in conventional programming languages. Solutions include translations from source code to Promela, as well as specially designed model checkers that accept source code. We believe that this is an - teresting research direction for the formal methods community, and that it will result in a new set of challenges and solutions. Of course, abstraction becomes the key solution to deal with very large state spaces. However, we also see - tential for integrating model checking with techniques such as static program analysis and testing. Papers on these issues have therefore been included in the proceedings.


Concurrent Systems Distributed Systems Finite State Systems Formal Methods Formal Verification Software Verification System Validation automata model checking structured analysis verification

Editors and affiliations

  • Klaus Havelund
    • 1
  • John Penix
    • 2
  • Willem Visser
    • 3
  1. 1.Kestrel TechnologyPalo AltoUSA
  2. 2.  
  3. 3.SEVEN NetworksRedwood CityUSA

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2000
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-41030-0
  • Online ISBN 978-3-540-45297-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Chemical Manufacturing
Finance, Business & Banking
IT & Software
Energy, Utilities & Environment