Automatic Verification of Sequential Infinite-State Processes

✍ Scribed by Olaf Burkart (auth.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 1997
• Tongue: English
• Leaves: 168
• Series: Lecture Notes in Computer Science 1354
• Edition: 1
• Category: Library

✦ Synopsis

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.

✦ Table of Contents

Introduction....Pages 1-7
Background....Pages 9-31
Pushdown Processes....Pages 33-65
Model Checking....Pages 67-114
Equivalence Checking....Pages 115-149
Summary and Perspectives....Pages 151-154

✦ Subjects

Logics and Meanings of Programs; Software Engineering; Programming Techniques