Automatic Verification of Sequential Infinite-State Processes

  • Olaf Burkart

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1354)

Table of contents

  1. Front Matter
    Pages I-X
  2. Pages 1-7
  3. Pages 9-31
  4. Pages 33-65
  5. Pages 67-114
  6. Pages 115-149
  7. Pages 151-154
  8. Back Matter
    Pages 155-163

About this book

Introduction

A common approach in software engineering is to apply during the design phase a variety of structured techniques like top-down design, decomposition and abstraction, while only subsequently, in the implementation phase, is the design tested to ensure reliability. But this approach neglects that central aspects of software design and program development have a strong formal character which admits tool support for the construction of reliable and correct computer systems based on formal reasoning. This monograph provides much information both for theoreticians interested in algebraic theories, and for software engineers building practically relevant tools. The author presents the theoretical foundations needed for the verification of reactive, sequential infinite-state systems. Two new algorithms are introduced allowing for automatic verification of important aspects such as safety or liveness properites of a given infinite-state system. The formal framework developed involves recent results from various theoretical areas like process algebras, fixpoint theory, modal logics and model checking.

Keywords

concurrency design development formal methods infinite-state systems model checking program verification software software engineering verification

Authors and affiliations

  • Olaf Burkart
    • 1
  1. 1.Lehrstuhl Informatik VUniversität DortmundDortmund

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-69678-4
  • Copyright Information Springer-Verlag Berlin Heidelberg 1997
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-63982-4
  • Online ISBN 978-3-540-69678-0
  • Series Print ISSN 0302-9743
  • About this book