Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
The SPIN Verification System
 
Edited by: Jean-Charles Grégoire INRS-Telecommunications, Montreal, QC, Canada
Gerard J. Holzmann Lucent Technologies, Murray Hill, NJ
Doron A. Peled Lucent Technologies, Murray Hill, NJ
A co-publication of the AMS and DIMACS
The SPIN Verification System
Hardcover ISBN:  978-0-8218-0680-7
Product Code:  DIMACS/32
List Price: $71.00
MAA Member Price: $63.90
AMS Member Price: $56.80
eBook ISBN:  978-1-4704-3990-3
Product Code:  DIMACS/32.E
List Price: $67.00
MAA Member Price: $60.30
AMS Member Price: $53.60
Hardcover ISBN:  978-0-8218-0680-7
eBook: ISBN:  978-1-4704-3990-3
Product Code:  DIMACS/32.B
List Price: $138.00 $104.50
MAA Member Price: $124.20 $94.05
AMS Member Price: $110.40 $83.60
The SPIN Verification System
Click above image for expanded view
The SPIN Verification System
Edited by: Jean-Charles Grégoire INRS-Telecommunications, Montreal, QC, Canada
Gerard J. Holzmann Lucent Technologies, Murray Hill, NJ
Doron A. Peled Lucent Technologies, Murray Hill, NJ
A co-publication of the AMS and DIMACS
Hardcover ISBN:  978-0-8218-0680-7
Product Code:  DIMACS/32
List Price: $71.00
MAA Member Price: $63.90
AMS Member Price: $56.80
eBook ISBN:  978-1-4704-3990-3
Product Code:  DIMACS/32.E
List Price: $67.00
MAA Member Price: $60.30
AMS Member Price: $53.60
Hardcover ISBN:  978-0-8218-0680-7
eBook ISBN:  978-1-4704-3990-3
Product Code:  DIMACS/32.B
List Price: $138.00 $104.50
MAA Member Price: $124.20 $94.05
AMS Member Price: $110.40 $83.60
  • Book Details
     
     
    DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
    Volume: 321997; 203 pp
    MSC: Primary 68

    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).

    Readership

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

  • Table of Contents
     
     
    • Chapters
    • State space compression with graph encoded sets
    • Not checking for closure under stuttering
    • On nested depth first search
    • Modelling and analysis of a collision avoidance protocol using SPIN and UPPAAL
    • The application of PROMELA and SPIN in the BOS project
    • Implementing and verifying MSC specifications using PROMELA/XSPIN
    • Creating implementations from PROMELA models
    • Modelling and verification of the MCS layer with SPIN
    • Protocol verification with reactive PROMELA/RSPIN
    • Outline for an operational semantics of PROMELA
    • A simulation and validation tool for self-stabilizing protocols
    • Dynamic analysis of SA/RT models using SPIN and modular verification
    • Memory efficient state storage in SPIN
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Accessibility – to request an alternate format of an AMS title
Volume: 321997; 203 pp
MSC: Primary 68

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).

Readership

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

  • Chapters
  • State space compression with graph encoded sets
  • Not checking for closure under stuttering
  • On nested depth first search
  • Modelling and analysis of a collision avoidance protocol using SPIN and UPPAAL
  • The application of PROMELA and SPIN in the BOS project
  • Implementing and verifying MSC specifications using PROMELA/XSPIN
  • Creating implementations from PROMELA models
  • Modelling and verification of the MCS layer with SPIN
  • Protocol verification with reactive PROMELA/RSPIN
  • Outline for an operational semantics of PROMELA
  • A simulation and validation tool for self-stabilizing protocols
  • Dynamic analysis of SA/RT models using SPIN and modular verification
  • Memory efficient state storage in SPIN
Review Copy – for publishers of book reviews
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.