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.

Keywords

Bibliographic Information

Book Title: Partial-Order Methods for the Verification of Concurrent Systems
Book Subtitle: An Approach to the State-Explosion Problem
Editors: Patrice Godefroid
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-60761-7
Publisher: Springer Berlin, Heidelberg
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1996
Softcover ISBN: 978-3-540-60761-8Published: 24 January 1996
eBook ISBN: 978-3-540-49444-7Published: 02 July 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: IV, 143
Topics: Logics and Meanings of Programs, Software Engineering/Programming and Operating Systems, Computer System Implementation, Software Engineering, Computer Communication Networks, Computation by Abstract Devices

Publish with us

Policies and ethics

Editors:

Sections

Buy it now

Buying options

Other ways to access

Table of contents (9 chapters)

Front Matter

Back Matter

About this book