Automatic verification of finite-state concurrent systems using temporal logic specifications-英文文献.pdf

Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications E. M. CLARKE Carnegie Mellon University E. A. EMERSON University of Texas, Austin and A. P. SISTLA GTE Laboratories, Inc. We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent system. We also show how this approach can be adapted to handle fairness. We argue that our technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finite-state concurrent systems. Experimental results show that state machines with several hundred states can be checked in a matter of seconds. Categories and Subject Descriptors: D.1.3 [Programming Techniques]: Concurrent Programming; D.2.4 [Software Engineering]: Program Verification; F.3.1 [Logics and Meanings of Programs]: Specifying and Verifying, and Reasoning about Programs; F.4.1 [Mathematical Logic and Formal Languages]: Mathematical Logic General Terms: Verification Additional Key Words and Phrases: Computation tree logic, finite-state concurrent systems, model checking, temporal logic 1. INTRODUCTION In the traditional approach to concurrent program verification, the proof that a program meets its specification is constructed by hand using various axioms and inference rules in a deducti