Principles of Spin is an introductory book, the only requirement is a background in programming. Spin models are written in the Promela language which is easily learned by students and programmers. Spin is easy to install and use. The Spin model checker is not only a widely used professional tool
Principles of the Spin model checker
โ Scribed by M Ben-Ari
- Publisher
- Springer
- Year
- 2008
- Tongue
- English
- Leaves
- 225
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Table of Contents
Cover......Page 1
Principles of the Spin Model Checker......Page 2
Copyright......Page 4
Foreword......Page 5
Preface......Page 7
Contents......Page 11
1 Sequential Programming in PROMELA......Page 16
2 Verification of Sequential Programs......Page 34
3 Concurrency......Page 43
4 Synchronization......Page 61
5 Verification with Temporal Logic......Page 82
6 Data and Program Structures......Page 107
7 Channels......Page 116
8 Nondeterminism......Page 136
9 Advanced Topics in PROMELA......Page 148
10 Advanced Topics in SPIN......Page 156
11 Case Studies......Page 173
A Software Tools......Page 211
References......Page 218
Index......Page 220
๐ SIMILAR VOLUMES
<p><P>The Spin model checker is a widely used professional software tool for specifying and verifying concurrent and distributed systems. Models, written in a simple language called Promela, can be simulated randomly or interactively. Spin can generate efficient verifiers that search for a counterex
SPIN is the world's most popular, and arguably one of the world's most powerful, tools for detecting software defectsin concurrent system designs. Literally thousands of people have used SPIN since it was first introduced almost fifteenyears ago. The tool has been applied to everything from the veri
1. Finding Bugs in Concurrent Systems -- 2. Building Verification Models -- 3. An Overview of PROMELA -- 4. Defining Correctness Claims -- 5. Using Design Abstraction -- 6. Automata and Logic -- 7. PROMELA Semantics -- 8. Search Algorithms -- 9. Search Optimization -- 10. Notes on Model Extraction
1. Finding Bugs in Concurrent Systems -- 2. Building Verification Models -- 3. An Overview of PROMELA -- 4. Defining Correctness Claims -- 5. Using Design Abstraction -- 6. Automata and Logic -- 7. PROMELA Semantics -- 8. Search Algorithms -- 9. Search Optimization -- 10. Notes on Model Extraction