Amazon cover image
Image from Amazon.com

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

By: Material type: TextTextSeries: Lecture notes in computer science ; 1032.Publication details: Berlin ; New York : Springer, ©1996.Description: 1 online resource (142 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540494447
  • 3540494448
Subject(s): Additional physical formats: Print version:: Partial-order methods for the verification of concurrent systems.DDC classification:
  • 005.2 20
LOC classification:
  • QA76.58 .G63 1996
Other classification:
  • 54.52
Online resources:
Contents:
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.
Action note:
  • digitized 2010 HathiTrust Digital Library committed to preserve
Summary: This monograph is a revised version of the author's Ph. D. thesis, submitted to the University of Lige, 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.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Includes bibliographical references (pages 133-142) and index.

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.

Use copy Restrictions unspecified star MiAaHDL

Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2010. MiAaHDL

Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL

http://purl.oclc.org/DLF/benchrepro0212

digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL

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

Print version record.

English.

Powered by Koha