AMS Bookstore LOGO amslogo
Return to List  Item: 1 of 1   
The SPIN Verification System
Edited by: Jean-Charles Grégoire, INRS-Telecommunications, Montreal, QC, Canada, and Gerard J. Holzmann and Doron A. Peled, Lucent Technologies, Murray Hill, NJ
A co-publication of the AMS and DIMACS.

DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
1997; 203 pp; hardcover
Volume: 32
ISBN-10: 0-8218-0680-7
ISBN-13: 978-0-8218-0680-7
List Price: US$63
Member Price: US$50.40
Order Code: DIMACS/32
[Add Item]

Request Permissions

What is Spin? Spin is a general tool for the specification and formal verification of software for distributed systems. It has been used to detect design errors in a wide range of applications, such as abstract distributed algorithms, data communications protocols, operating systems code, and telephone switching code. The verifier can check for basic correctness properties, such as absence of deadlock and race conditions, logical completeness, or unwarranted assumptions about the relative speeds of correctness properties expressed in the syntax of Linear-time Temporal Logic (LTL). The tool translates LTL formulae automatically into automata representations, which can be used in an efficient on-the-fly verifications procedure.

This DIMACS volume presents the papers contributed to the second international workshop that was held on the Spin verification system at Rutgers University in August 1996. The work covers theoretical and foundational studies of formal verification, empirical studies of the effectiveness of different types of algorithms, significant practical applications of the Spin verifier, and discussions of extensions and revisions of the basic code.

Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1-7 were co-published with the Association for Computer Machinery (ACM).


Graduate students, theorists and practicioners in formal methods, formal verification of software and automata theory.

Table of Contents

  • J.-C. Grégoire -- State space compression with graph encoded sets
  • G. J. Holzmann and O. Kupferman -- Not checking for closure under stuttering
  • G. J. Holzmann, D. Peled, and M. Yannakakis -- On nested depth first search
  • H. E. Jensen, K. G. Larsen, and A. Skou -- Modelling and analysis of a collision avoidance protocol using Spin and Uppaal
  • P. Kars -- The application of Promela and Spin in the BOS project
  • S. Leue and P. B. Ladkin -- Implementing and verifying MSC specifications using Promela/XSpin
  • S. Löffler and A. Serhrouchni -- Creating implementations from Promela models
  • P. Merino and J.-M. Troya -- Modelling and verification of the MCS layer with Spin
  • E. Najm and F. Olsen -- Protocol verification with reactive Promela/Rspin
  • V. Natarajan and G. J. Holzmann -- Outline for an operational semantics of Promela
  • S. K. Shukla, D. J. Rosenkrantz, and S. S. Ravi -- A simulation and validation tool for self-stabilizing protocols
  • J. Tuya, J. R. de Diego, C. de la Riva, and J. A. Corrales -- Dynamic analysis of SA/RT models using Spin and modular verification
  • W. Visser and H. Barringer -- Memory efficient state storage in Spin
Powered by MathJax
Return to List  Item: 1 of 1   

  AMS Home | Comments:
© Copyright 2014, American Mathematical Society
Privacy Statement

AMS Social

AMS and Social Media LinkedIn Facebook Podcasts Twitter YouTube RSS Feeds Blogs Wikipedia