Temporal Verification of Reactive Systems : Safety
This book presents an extensive verification methodology for proving that reactive systems meet their specifications, expressed as safety properties in the language of temporal logic. The methods include deductive approaches based on theorem proving and fully automatic approaches based on model checking. All researchers and students interested in the analysis and verification of reactive and concurrent systems will find this book to be a comprehensive guide on how formal techniques can be used to ensure the correctness of such systems. An educational version of the Stanford Temporal Prover (STeP), a tool which supports the verification of reactive systems, is available for use with this book
1 online resource (xviii, 512 pages 181 illustrations)
9781461242222, 9780387944593, 1461242223, 0387944591
852789488
Print version:
0: Preliminary Concepts
0.1 Fair Transition System
0.2 A Programming Language (SPL): Syntax
0.3 A Programming Language (SPL): Semantics
0.4 Modules
0.5 Temporal Logic
0.6 Specification of Properties
0.7 Overview of the Verification Framework
Problems
Bibliographic Remarks
1: Invariance: Proof Methods
1.1 Preliminary Notions
1.2 Invariance Rule
1.3 Finding Inductive Assertions: The Bottom-Up Approach
1.4 Finding Inductive Assertions: The Top-Down Approach
1.5 Refining Invariants
Problems
Bibliographic Remarks
2: Invariance: Applications
2.1 Parameterized Programs
2.2 Single-Resource Allocation
2.3 Multiple-Resource Allocation
2.4 Constructing Linear Invariants
2.5 Completeness
2.6 Finite-State Algorithmic Verification
Problems
Bibliographic Remarks
3: Precedence
3.1 Waiting-for Rule
3.2 Nested Waiting-for Rule
3.3 Verification Diagrams
3.4 Overtaking Analysis for a Resource Allocator
* 3.5 Completeness
* 3.6 Finite-State Algorithmic Verification
Problems
Bibliographic Remarks
4: General Safety
4.1 Invariance Rule for Past Formulas
4.2 Applications of the Past Invariance Rule
4.3 Compositional Verification
4.4 Causality Rule
4.5 Backward Analysis
4.6 Order-Preservation Properties
4.7 History Variables
4.8 Back-to Rule
* 4.9 Completeness
* 4.10 Finite-State Algorithmic Verification
Problems
Bibliographic Remarks
5: Algorithmic Verification of General Formulas
5.1 Satisfiability of a Temporal Formula
5.2 Satisfiability over a Finite-State Program
5.3 Validity over a Finite-State Program: Examples
5.4 Incremental Tableau Construction
5.5 Particle Tableaux
Problems
Bibliographic Remarks
References
Index to Symbols
General Index
English