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 prool verification.
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 prool verification.
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
143
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
143
Product Details
| ISBN-13: | 9783540607618 |
|---|---|
| Publisher: | Springer Berlin Heidelberg |
| Publication date: | 03/05/1996 |
| Series: | Lecture Notes in Computer Science , #1032 |
| Edition description: | 1996 |
| Pages: | 143 |
| Product dimensions: | 6.10(w) x 9.25(h) x 0.01(d) |