Amazon cover image
Image from Amazon.com

Partial-Order Methods for the Verification of Concurrent Systems [electronic resource] : An Approach to the State-Explosion Problem / edited by Patrice Godefroid.

Contributor(s): Material type: TextTextSeries: Lecture Notes in Computer Science ; 1032Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1996Description: IV, 143 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540494447
Subject(s): Additional physical formats: Printed edition:: No titleDDC classification:
  • 005.1015113 23
LOC classification:
  • QA76.9.L63
  • QA76.5913
  • QA76.63
Online resources:
Contents:
Concurrent systems and semantics -- Using partial orders to tackle state explosion -- Persistent sets -- Sleep sets -- Verification of safety properties -- Model checking -- Experiments -- Conclusions.
In: Springer eBooksSummary: This monograph is a revised version of the author's Ph.D. thesis, submitted to the University of Liège, 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.
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Home library Call number Materials specified URL Status Date due Barcode
IMSc Library Link to resource Available EBK6783

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

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

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India