Table of contents

  1. Front Matter
  2. Pages 11-18
  3. Pages 41-73
  4. Pages 75-83
  5. Pages 103-111
  6. Pages 113-127
  7. Pages 129-132
  8. Back Matter

About this book

Introduction

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

Model Checking Modellprüfung Partial-Order Methods Partialordnungsmethoden Program Verification Programmverifikation Protocol Verification Protokollverifikation Verfication Algorithms Verifikationsalgorithmen algorithms requirements sets verification

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-60761-7
  • Copyright Information Springer-Verlag 1996
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-60761-8
  • Online ISBN 978-3-540-49444-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book