A deductive proof system for CTL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2421 LNCS, Issue , 2002, Pages 24-40

  Pnueli, Amir ^a   Kesten, Yonit ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BASIC FORMULAS; EMBEDDED PATH QUANTIFIERS; INFINITE STATE; PROOF RULES; PROOF SYSTEM; REACTIVE SYSTEM;

ARTIFICIAL INTELLIGENCE;

EID: 84864014519     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45694-5_2     Document Type: Conference Paper

References (27)

1. E. Clarke, E. Emerson, and A. Sistla. Automatic verification of finite state concurrent systems using temporal logic specifications. ACM Trans. Prog. Lang. Sys., 8:244-263, 1986.
2. E. Clarke, O. Grumberg, and K. Hamaguchi. Another look at LTL model checking. CAV'94, LNCS 818, pages 415-427.
3. M. Daniele, F. Giunchiglia, and M.Y. Vardi. Improved automata generation for linear time temporal logic. CAV'99, LNCS 1633, pages 255-265.
4. E. Emerson. Temporal and modal logics. In J. van Leeuwen, editor, Handbook of theoretical computer science, volume B, pages 995-1072. Elsevier, 1990.
5. E. Emerson and C. Lei. Modalities for model checking: Branching time strikes back. POPL'85, pages 84-96.
6. D. Gabbay. The declarative past and imperative future. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Temporal Logic in Specification, volume 398 of Lect. Notes in Comp. Sci., pages 407-448. Springer-Verlag, 1987.
7. P. Gastin and D. Oddoux. Fast LTL to Büchi automata translation. CAV'01, LNCS 2102.
8. R. Gerth, D. Peled, M.Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. PSTV'95, pages 3-18.
9. Y. Kesten, Z. Manna, H. McGuire, and A. Pnueli. A decision algorithm for full propositional temporal logic. CAV'93, pages 97-109.
10. Y. Kesten and A. Pnueli. Verification by augmented finitary abstraction. Information and Computation, a special issue on Compositionality, 163:203-243, 2000.
11. Y. Kesten, A. Pnueli, and L. Raviv. Algorithmic verification of linear temporal logic specifications. Proc. 25th Int. Colloq. Aut. Lang. Prog., LNCS 1443, pages 1-16, 1998.
12. Y. Kesten, A. Pnueli, L. Raviv, and E. Shahar. LTL Model Checking with Strong Fairness. Technical Report mcs01-07, The Weizmann Institute of Science, 2001. Submitted to Formal Methods in System Design.
13. D. Lehmann, A. Pnueli, and J. Stavi. Impartiality, justice and fairness: The ethics of concurrent termination. In Proc. 8th Int. Col loq. Aut. Lang. Prog., LNCS 115, pages 264-277, 1981.
14. O. Lichtenstein and A. Pnueli. Checking that finite-state concurrent programs satisfy their linear specification. POPL'85, pages 97-107.
15. Z. Manna, A. Anuchitanukul, N. Bjørner, A. Browne, E. Chang, M. Colón, L.D. Alfaro, H. Devarajan, H. Sipma, and T. Uribe. STeP: The Stanford Temporal Prover. Stanford University, 1994.
16. Z. Manna and A. Pnueli. Completing the temporal picture. Theor. Comp. Sci., 83(1):97-130, 1991.
17. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer Verlag, New York, 1991.
18. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
19. K. Namjoshi. Certifying model checkers. CAV'01, LNCS 2102.
20. D. Peled, A. Pnueli, and L. Zuck. From falsification to verification. FTTCS'01, LNCS 2245, pages 292-304.
21. A. Pnueli and R. Rosner. A framework for the synthesis of reactive modules. Concurrency 88, LNCS 335, pages 4-17.
22. M. Reynolds. An axiomatization of full computation tree logic. Journal of Symbolic Logic, 66(3):1011-1057, 2001.
23. H. Sipma, T. Uribe, and Z. Manna. Deductive model checking. Formal Methods in System Design, 15(1):49-74, 1999.
24. F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. CAV'00, LNCS 1855, pages 248-263.
25. * Properties of Infinite-State Reactive Systems. PhD thesis, Swiss Federal Institute of Technology, Lausanne, 2000.
26. F. Stomp, W.-P. de Roever, and R. Gerth. The μ-calculus as an assertion language for fairness arguments. Inf. and Comp., 82:278-322, 1989.
27. M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Inf. and Comp., 115(1):1-37, 1994.