A Deductive Proof System for CTL

The paper presents a sound and (relatively) complete deductive proof system for the verification of CTL* properties over possibly infinite-state reactive systems.T he proof system is based on a set of proof rules for the verification of basic CTL* formulas, namely CTL* formulas with no embedded path quantifiers.W e first show how to decompose the proof of a general (non-basic) CTL* formula into proofs of basic CTL* formulas.W e then present proof rules for some of the most useful basic CTL* formulas, then present a methodology for transforming an arbitrary basic formula into one of these special cases.

[1]  Zohar Manna,et al.  Temporal Verification of Reactive Systems , 1995, Springer New York.

[2]  Kedar S. Namjoshi,et al.  Certifying Model Checkers , 2001, CAV.

[3]  Henny B. Sipma,et al.  Deductive Model Checking , 1996, Formal Methods Syst. Des..

[4]  Pierre Wolper,et al.  Reasoning About Infinite Computations , 1994, Inf. Comput..

[5]  Mark Reynolds,et al.  An axiomatization of full Computation Tree Logic , 2001, Journal of Symbolic Logic.

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

[7]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[8]  Pierre Wolper,et al.  Simple on-the-fly automatic verification of linear temporal logic , 1995, PSTV.

[9]  Dov M. Gabbay,et al.  The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems , 1987, Temporal Logic in Specification.

[10]  Amir Pnueli,et al.  From Falsification to Verification , 2001, FSTTCS.

[11]  Edward Y. Chang,et al.  STeP: The Stanford Temporal Prover , 1995, TAPSOFT.

[12]  Paul Gastin,et al.  Fast LTL to Büchi Automata Translation , 2001, CAV.

[13]  Zohar Manna,et al.  Completing the Temporal Picture , 1991, Theor. Comput. Sci..

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

[15]  Zohar Manna,et al.  Temporal verification of reactive systems - safety , 1995 .

[16]  Amir Pnueli,et al.  Algorithmic Verification of Linear Temporal Logic Specifications , 1998, ICALP.

[17]  Chin-Laung Lei,et al.  Modalities for model checking (extended abstract): branching time strikes back , 1985, POPL.

[18]  Amir Pnueli,et al.  Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.

[19]  Fausto Giunchiglia,et al.  Improved Automata Generation for Linear Temporal Logic , 1999, CAV.

[20]  Amir Pnueli,et al.  Verification by Augmented Finitary Abstraction , 2000, Inf. Comput..

[21]  Amir Pnueli,et al.  A Framework for the Synthesis of Reactive Modules , 1988, Concurrency.

[22]  Edmund M. Clarke,et al.  Another Look at LTL Model Checking , 1994, CAV.

[23]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[24]  Zohar Manna,et al.  A Decision Algorithm for Full Propositional Temporal Logic , 1993, CAV.

[25]  Fabio Somenzi,et al.  Efficient Büchi Automata from LTL Formulae , 2000, CAV.