@inproceedings{5bfaa2a0ea1943ce9d2ab7f3a41ba5f8,

title = "A deductive proof system for CTL",

abstract = "The paper presents a sound and (relatively) complete deductive proof system for the verification of CTL* properties over possibly infinite-state reactive systems. The 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. We first show how to decompose the proof of a general (non-basic) CTL* formula into proofs of basic CTL* formulas. We 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.",

author = "Amir Pnueli and Yonit Kesten",

year = "2002",

month = jan,

day = "1",

doi = "10.1007/3-540-45694-5_2",

language = "English",

isbn = "3540440437",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "24--40",

editor = "Lubos Brim and Mojmir Kretinsky and Antonin Kucera and Petr Jancar",

booktitle = "CONCUR 2002, Concurrency Theory - 13th International Conference, Proceedings",

address = "Germany",

note = "13th International Conference on Concurrency Theory, CONCUR 2002 ; Conference date: 20-08-2002 Through 23-08-2002",

}