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 (http://netlib.bell-labs.com/netlib/spin/whatispin.html), 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.
Author(s): Dragan Bošnački, Dennis Dams, Leszek Holenderski (auth.), Klaus Havelund, John Penix, Willem Visser (eds.)
Series: Lecture Notes in Computer Science 1885
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2000
Language: English
Pages: 346
Tags: Logics and Meanings of Programs; Software Engineering; Programming Languages, Compilers, Interpreters
Front Matter....Pages -
Symmetric Spin....Pages 1-19
Using Garbage Collection in Model Checking....Pages 20-33
Model Checking Based on Simultaneous Reachability Analysis....Pages 34-53
Testing Spin ’s LTL Formula Conversion into Büchi Automata with Randomly Generated Input....Pages 54-72
Verification and Optimization of a PLC Control Schedule....Pages 73-92
Modeling the ASCB-D Synchronization Algorithm with SPIN: A Case Study....Pages 93-112
Bebop: A Symbolic Model Checker for Boolean Programs....Pages 113-130
Logic Verification of ANSI-C Code with SPIN....Pages 131-147
Interaction Abstraction for Compositional Finite State Systems....Pages 148-162
Correctness by Construction: Towards Verification in Hierarchical System Development....Pages 163-180
Linking ST e P with SPIN....Pages 181-186
Abstraction of Communication Channels in Promela: A Case Study....Pages 187-204
A Language Framework for Expressing Checkable Properties of Dynamic Software....Pages 205-223
Model-Checking Multi-threaded Distributed Java Programs....Pages 224-244
Using Runtime Analysis to Guide Model Checking of Java Programs....Pages 245-264
Communication Topology Analysis for Concurrent Programs....Pages 265-286
Low-Fat Recipes for SPIN....Pages 287-321
Tutorial on FDR and Its Applications....Pages 322-322
The Temporal Rover and the ATG Rover....Pages 323-330
Runtime Checking of Multithreaded Applications with Visual Threads....Pages 331-342
Back Matter....Pages -
