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.
Author(s): John Rushby (auth.), Dennis Dams, Rob Gerth, Stefan Leue, Mieke Massink (eds.)
Series: Lecture Notes in Computer Science 1680
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1999
Language: English
Pages: 282
Tags: Logics and Meanings of Programs; Software Engineering; Programming Languages, Compilers, Interpreters
Integrated Formal Verification: Using Model Checking with Automated Abstraction, Invariant Generation, and Theorem Proving....Pages 1-11
Runtime Efficient State Compaction in Spin....Pages 12-21
Distributed-Memory Model Checking with SPIN....Pages 22-39
Partial Order Reduction in Presence of Rendez-vous Communications with Unless Constructs and Weak Fairness....Pages 40-56
Divide, Abstract, and Model-Check....Pages 57-76
The Engineering of a Model Checker: the Gnu i-Protocol Case Study Revisited.....Pages 232-244
Embedding a Dialect of SDL in PROMELA....Pages 245-260
dSPIN: A Dynamic Extension of SPIN....Pages 261-276
Model Checking for Managers....Pages 92-107
Xspin/Project - Integrated Validation Management for Xspin....Pages 108-119
Analyzing Mode Confusion via Model Checking....Pages 120-135
Detecting Feature Interactions in the Terrestrial Trunked Radio (TETRA) Network Using Promela and Xspin....Pages 136-151
Java PathFinder A Translator from Java to Promela....Pages 152-152
VIP: A Visual Interface for Promela....Pages 153-153
Events in Property Patterns....Pages 154-167
Assume-Guarantee Model Checking of Software: A Comparative Case Study....Pages 168-183
A Framework for Automatic Construction of Abstract Promela Models....Pages 184-199
Model Checking Operator Procedures....Pages 200-215
Applying Model Checking in Java Verification....Pages 216-231
Formal Methods Adoption: What’s Working, What’s Not!....Pages 77-91
