Partial-Order Methods for the Verification of Concurrent Systems

Patrice Godefroid

ISBN 10: 3540607617 / ISBN 13: 9783540607618

Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Jan 1996, 1996

Riguardo questo articolo

This item is printed on demand - Print on Demand Titel. Neuware -This monograph is a revised version of the author's Ph.D. thesis, submitted to the University of Liège, 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 156 pp. Englisch. Codice articolo 9783540607618

Dati bibliografici

Titolo: Partial-Order Methods for the Verification ...

Casa editrice: Springer Berlin Heidelberg, Springer Berlin Heidelberg Jan 1996

Data di pubblicazione: 1996

Legatura: Taschenbuch

Condizione: Neu

Descrizione articolo

Riassunto:

This monograph is a revised version of the author's Ph.D. thesis, submitted to the University of Liège, 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.

Contenuti:

Concurrent systems and semantics.- Using partial orders to tackle state explosion.- Persistent sets.- Sleep sets.- Verification of safety properties.- Model checking.- Experiments.- Conclusions.