The SPIN Verification System (Series in Discrete Mathematics & Theoretical Computer Science)

The SPIN Verification System (Series in Discrete Mathematics & Theoretical Computer Science)


Up to 2 WeeksUsually despatched within 2 weeks


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.


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

Product Details

  • ISBN13: 9780821806807
  • Format: Hardback
  • ID: 9780821806807
  • ISBN10: 0821806807

Delivery Information

  • Saver Delivery: Yes
  • 1st Class Delivery: Yes
  • Courier Delivery: Yes
  • Store Delivery: Yes

Prices are for internet purchases only. Prices and availability in WHSmith Stores may vary significantly