Partial-order methods for the verification of concurrent systems : an approach to the state-explosion problem

Patrice Godefroid

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

「Nielsen BookData」より

[目次]

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

「Nielsen BookData」より

この本の情報

書名 Partial-order methods for the verification of concurrent systems : an approach to the state-explosion problem
著作者等 Godefroid, Patrice
シリーズ名 Lecture notes in computer science
出版元 Springer
刊行年月 c1996
ページ数 142 p.
大きさ 24 cm
ISBN 3540607617
NCID BA26916248
※クリックでCiNii Booksを表示
言語 英語
出版国 ドイツ
この本を: 
このエントリーをはてなブックマークに追加

このページを印刷

外部サイトで検索

この本と繋がる本を検索

ウィキペディアから連想