A General Tableau Technique for Verifying Temporal Properties of Concurrent Programs

Labelled transition systems provide convenient models for many computational systems. Their usefulness is due partly to their natural association with temporal logics which may be used to express interesting properties of systems. It is of course vital to be able not only to express properties of programs but also to determine whether they hold of them. In the case of finite-state systems, much work has been done on automatic model checking [4]. Algorithms are known for a variety of logics, and many have been implemented and used to study systems including communications protocols and digital circuits.

[1]  Chin-Laung Lei,et al.  Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.

[2]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[3]  Vaughan R. Pratt,et al.  A decidable mu-calculus: Preliminary report , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[4]  Colin Stirling,et al.  A Generalization of Owicki-Gries's Hoare Logic for a Concurrent while Language , 1988, Theor. Comput. Sci..

[5]  Grzegorz Rozenberg,et al.  Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.

[6]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[7]  Kim G. Larsen,et al.  Proof Systems for Satisfiability in Hennessy-Milner Logic with Recursion , 1990, Theor. Comput. Sci..

[8]  Amir Pnueli,et al.  Now you may compose temporal logic specifications , 1984, STOC '84.

[9]  David Walker,et al.  Local Model Checking in the Modal mu-Calculus , 1991, Theor. Comput. Sci..

[10]  Donald E. Knuth,et al.  Additional comments on a problem in concurrent programming control , 1966, CACM.

[11]  Edmund M. Clarke,et al.  The Model Checking Problem for Concurrent Systems with Many Similar Processes , 1987, Temporal Logic in Specification.

[12]  A. Prasad Sistla,et al.  Automatic verification of finite state concurrent system using temporal logic specifications: a practical approach , 1983, POPL '83.