|
|
|
|
| LEADER |
01455nam a2200313 a 4500 |
| 001 |
c000175372 |
| 003 |
CARM |
| 005 |
20000917192551.0 |
| 008 |
951211s1996 gw a b 001 0 eng |
| 010 |
|
|
|a 95051354
|
| 019 |
1 |
|
|a 12120396
|5 LACONCORD2021
|
| 020 |
|
|
|a 3540607617
|
| 020 |
|
|
|a 3540607617
|
| 035 |
|
|
|a (OCoLC)33947067
|5 LACONCORD2021
|
| 040 |
|
|
|a TOC
|b eng
|c TOC
|d TOC
|
| 050 |
0 |
0 |
|a QA76.58
|b .G63 1996
|
| 082 |
0 |
0 |
|a 005.2
|2 20
|
| 100 |
1 |
|
|a Godefroid, Patrice.
|
| 245 |
1 |
0 |
|a Partial-order methods for the verification of concurrent systems :
|b an approach to the state-explosion problem /
|c Patrice Godefroid.
|
| 260 |
|
|
|a Berlin ;
|a New York :
|b Springer,
|c c1996.
|
| 300 |
|
|
|a 142 p. :
|b ill. ;
|c 24 cm.
|
| 440 |
|
0 |
|a Lecture notes in computer science ;
|v 1032.
|
| 504 |
|
|
|a Includes bibliographical references (p. [133]-142) and index.
|
| 505 |
0 |
|
|a 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.
|
| 650 |
|
0 |
|a Parallel processing (Electronic computers)
|
| 650 |
|
0 |
|a Computer software
|x Verification.
|
| 852 |
8 |
|
|b CARM
|h A2:AL25A0
|i B05585
|p 0239281
|f BK
|
| 999 |
f |
f |
|i e9cd376a-049d-59fd-91f3-4883f0c8cbf9
|s 22cb7ec0-58db-5913-ad52-f102facb5d3d
|
| 952 |
f |
f |
|p Can circulate
|a CAVAL
|b CAVAL
|c CAVAL
|d CARM 1 Store
|e B05585
|f A2:AL25A0
|h Other scheme
|i book
|m 0239281
|