Theoretical and Practical Aspects of SPIN Model Checking

5th and 6th International SPIN Workshops Trento, Italy, July 5, 1999 Toulouse, France, September 21 and 24, 1999 Proceedings

  • Dennis Dams
  • Rob Gerth
  • Stefan Leue
  • Mieke Massink
Conference proceedings SPIN 1999

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

Table of contents

  1. Front Matter
    Pages I-X
  2. Part I:Selection of Papers Presented at 5thSPIN99

    1. Keynote Address

    2. Theory

      1. J Geldenhuys, P J A de Villiers, John Rushby
        Pages 12-21
      2. Flavio Lerda, Riccardo Sisto
        Pages 22-39
      3. Karsten Stahl, Kai Baukus, Yassine Lakhnech, Martin Stefen
        Pages 57-76
  3. Part II: Papers Presented at 6thSPIN99

    1. Keynote Address

    2. Methodology

      1. Wil Janssen, Radu Mateescu, Sjouke Mauw, Peter Fennema, Petra van der Stappen
        Pages 92-107
    3. Applications I

      1. Gerald Lüttgen, Victor Carreño
        Pages 120-135
      2. Moataz Kamel, Stefan Leue
        Pages 153-153
    4. Specification and Validation

      1. Marsha Chechik, Dimitrie O. Păun
        Pages 154-167
      2. Corina S. Păsăreanu, Matthew B. Dwyer, Michael Huth
        Pages 168-183
      3. Maria-del-Mar Gallardo, Pedro Merino
        Pages 184-199
    5. Applications

      1. Wenhui Zhang
        Pages 200-215
      2. Klaus Havelund, Jens Ulrik Skakkebæk
        Pages 216-231
    6. Extensions

About these proceedings

Introduction

Increasing the designer’s con dence that a piece of software or hardwareis c- pliant with its speci cation has become a key objective in the design process for software and hardware systems. Many approaches to reaching this goal have been developed, including rigorous speci cation, formal veri cation, automated validation, and testing. Finite-state model checking, as it is supported by the explicit-state model checkerSPIN,is enjoying a constantly increasingpopularity in automated property validation of concurrent, message based systems. SPIN has been in large parts implemented and is being maintained by Gerard Ho- mann, and is freely available via ftp fromnetlib.bell-labs.comor from URL http://cm.bell-labs.com/cm/cs/what/spin/Man/README.html. The beauty of nite-state model checking lies in the possibility of building \push-button" validation tools. When the state space is nite, the state-space traversal will eventually terminate with a de nite verdict on the property that is being validated. Equally helpful is the fact that in case the property is inv- idated the model checker will return a counterexample, a feature that greatly facilitates fault identi cation. On the downside, the time it takes to obtain a verdict may be very long if the state space is large and the type of properties that can be validated is restricted to a logic of rather limited expressiveness.

Keywords

Java Sage formal method formal verification model model checking verification

Editors and affiliations

  • Dennis Dams
    • 1
  • Rob Gerth
    • 2
  • Stefan Leue
    • 3
  • Mieke Massink
    • 4
  1. 1.Department of Electrical Engineering and Department of Mathematics and Computer ScienceEindhoven University of TechnologyMB EindhovenThe Netherlands
  2. 2.Intel Microprocessor Products GroupStrategic CAD LaboratoriesHillsboroUSA
  3. 3.Department of Electrical and Computer EngineeringUniversity of WaterlooWaterlooCanada
  4. 4.C.N.R.-Ist.PisaItaly

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-48234-2
  • Copyright Information Springer-Verlag Berlin Heidelberg 1999
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-66499-4
  • Online ISBN 978-3-540-48234-5
  • Series Print ISSN 0302-9743
  • About this book
Industry Sectors
Pharma
Biotechnology
Consumer Packaged Goods
Energy, Utilities & Environment
Aerospace