Partial-order methods for the verification of concurrent systems : an approach to the state-explosion problem
| 000 | 00944camuuu200265 a 4500 | |
| 001 | 000000601527 | |
| 003 | OCoLC | |
| 005 | 19980825162257.0 | |
| 008 | 951211s1996 gw a b 001 0 eng | |
| 010 | ▼a 95051354 | |
| 020 | ▼a 3540607617 (Berlin : softcover : acid-free paper) | |
| 040 | ▼a DLC ▼c DLC | |
| 049 | ▼l 121035144 ▼f 과학 | |
| 050 | 0 0 | ▼a QA76.58 ▼b .G63 1996 |
| 082 | 0 0 | ▼a 005.2 ▼2 20 |
| 090 | ▼a 005.2 ▼b G581p | |
| 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. | |
| 650 | 0 | ▼a Parallel processing (Electronic computers). |
| 650 | 0 | ▼a Computer software ▼x Verification. |
소장정보
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 과학도서관/Sci-Info(2층서고)/ | 청구기호 005.2 G581p | 등록번호 121035144 (2회 대출) | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
| No. 2 | 소장처 세종학술정보원/과학기술실(5층)/ | 청구기호 005.2 G581p | 등록번호 151046134 | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 과학도서관/Sci-Info(2층서고)/ | 청구기호 005.2 G581p | 등록번호 121035144 (2회 대출) | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 세종학술정보원/과학기술실(5층)/ | 청구기호 005.2 G581p | 등록번호 151046134 | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
컨텐츠정보
책소개
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.
정보제공 :
목차
Concurrent systems and semantics.- Using partial orders to tackle state explosion.- Persistent sets.- Sleep sets.- Verification of safety properties.- Model checking.- Experiments.- Conclusions.
정보제공 :