Completing the Temporal Picture

The paper presents a relatively complete proof system for proving the validity of temporal properties of reactive programs. The presented proof system improves oll previous temporal systems, such as [MP83a] and [MP83b], in that it reduces the validity of program properties into pure assertional reasoning, not involving additional temporal reasoning. The proof system is based on the classification of temporal properties according to the Borel hierarchy, providing an appropriate proof rule for each of the main classes, such as safety, response, and progress properties.

[1]  Amir Pnueli,et al.  Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends , 1986, Current Trends in Concurrency.

[2]  Wolfgang Thomas,et al.  A Combinatorial Approach to the Theory of omega-Automata , 1981, Inf. Control..

[3]  Amir Pnueli,et al.  Impartiality, Justice and Fairness: The Ethics of Concurrent Termination , 1981, ICALP.

[4]  Willem P. de Roever,et al.  A Proof Rule for Fair Termination of Guarded Commands , 1985, Inf. Control..

[5]  Stephen A. Cook,et al.  Soundness and Completeness of an Axiom System for Program Verification , 1978, SIAM J. Comput..

[6]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[7]  Amir Pnueli,et al.  The Glory of the Past , 1985, Logic of Programs.

[8]  Z. Manna,et al.  Verification of concurrent programs: a temporal proof system , 1983 .

[9]  Fred Krögr.  Temporal Logic Of Programs , 1987 .

[10]  Â. È Ê Â Â Û Û Ò Ç ^ R R Ó Ae — Ú Ú Ë Ë Â Ê Ì È Â Ê Â.  Verifying Temporal Properties without Temporal Logic , 1988 .

[11]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[12]  Zohar Manna,et al.  Specification and verification of concurrent programs by A∀automata , 1987, POPL '87.

[13]  Amir Pnueli,et al.  Tight bounds on the complexity of cascaded decomposition of automata , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[14]  Krzysztof R. Apt,et al.  Ten Years of Hoare's Logic: A Survey—Part I , 1981, TOPL.

[15]  David Harel,et al.  First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.

[16]  Leslie Lamport,et al.  Proving Liveness Properties of Concurrent Programs , 1982, TOPL.

[17]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[18]  Zohar Manna,et al.  Adequate Proof Principles for Invariance and Liveness Properties of Concurrent Programs , 1984, Sci. Comput. Program..

[19]  Krzysztof R. Apt,et al.  Countable nondeterminism and random assignment , 1986, JACM.

[20]  Willem P. de Roever,et al.  The upsilon-Calculus as an Assertion-Language for Fairness Arguments , 1989, Inf. Comput..

[21]  Zohar Manna,et al.  The anchored version of the temporal framework , 1988, REX Workshop.

[22]  Zohar Manna,et al.  How to cook a temporal proof system for your pet language , 1983, POPL '83.

[23]  Frank A. Stomp,et al.  The $\mu$-calculus as an insertion-language for fairness arguments , 1989 .