TY  - BOOK
AU  - Godefroid,Patrice
TI  - Partial-order methods for the verification of concurrent systems: an approach to the state-explosion problem 
T2  - Lecture notes in computer science
SN  - 9783540494447
AV  - QA76.58 .G63 1996
U1  - 005.2 20
PY  - 1996///
CY  - Berlin, New York
PB  - Springer
KW  - Parallel processing (Electronic computers)
KW  - Computer software
KW  - Verification
KW  - Logiciels
KW  - Vérification
KW  - Parallélisme (Informatique)
KW  - fast
KW  - Parallelle verwerking
KW  - gtt
KW  - Parallélisme (informatique)
KW  - ram
KW  - Essais
N1  - Includes bibliographical references (pages 133-142) and index; 1. Introduction -- 2. Concurrent Systems and Semantics -- 3. Using Partial Orders to Tackle State Explosion -- 4. Persistent Sets -- 5. Sleep Sets -- 6. Verification of Safety Properties -- 7. Model Checking -- 8. Experiments -- 9. Conclusions; Electronic reproduction; [Place of publication not identified]; HathiTrust Digital Library; 2010
N2  - This monograph is a revised version of the author's Ph. D. thesis, submitted to the University of Lige, Belgium, with Pierre Wolper as thesis advisor. The general pattern of this work, is to turn logical and semantic ideas into exploitable algorithms. Thus, it perfectly fits the modern trend, viewing verification as a computer-aided activity, and as algorithmic as possible, not as a paper and pencil one, dealing exclusively with semantic and logical issues. Patrice Godefroid uses state-space exploration as the key technique, which, as such or elaborated into model checking, is attracting growing attention for the verification of concurrent systems. For most realistic examples, the methods presented provide a significant reduction of memory and time requirements for protocol verification
UR  - https://link.springer.com/10.1007/3-540-60761-7
ER  -