Verification of temporal properties

Journal of Logic and Computation

Volumn 6, Issue 3, 1996, Pages 343-361

  Fix, Limor ^a   Grumberg, Orna ^b  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Branching time; CTL; Deductive system; Program verification; Temporal logic

Indexed keywords

EID: 0002159880     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/6.3.343     Document Type: Article

References (21)

1. B. Alpem and F. B. Schneider. Proving boolean combinations of deterministic properties. In 2nd IEEE Symposium on Logic in Computer Science, pp. 131-137, 1987.
2. B. Alpem and F. B. Schneider. Verifying temporal properties without temporal logic. ACM Transactions on Programming Languages and Systems, 11, 147-167, 1989.
3. R. S. Boyer and J. S. Moore. Integrating Recursion Procedures into Heuristic Theorem Provers: a Case Study in Linear Arithmetic. Oxford University Press, Oxford, 1988.
4. E. M. Clarke, E. A. Emerson and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8, 244-263, 1986.
5. R. L. Constable et al. Implementing Mathematics with the Nuprl Development System. Prentice-Hall, Englewood Cliffs, NJ, 1986.
6. T. Coquand and G. Huet. The calculus of constructions. Information and Computation, 76, 95-120, 1988.
7. N. Francez. Fairness. Springer-Verlag, 1986.
8. M. Gordon. Hol: a machine oriented formalization of higher order logic. Technical Report 68, Cambridge University, 1985.
9. L. Lamport. The hoare logic of concurrent programs. Acta Informatica, 14, 1980.
10. D. Lehmann, A. Pnueli and J. Stavi. Impartiality, justice and fairness: the ethics of concurrent termination. In 8th ICALP. LNCS 115, Springer-Verlag, 1981.
11. O. Maler and A. Pnueli. Tight bounds on the complexity of cascaded decomposition of automata. In Proceedings of the 31 st IEEE Symposium on Foundations of Computer Science, pp. 672-682, 1990.
12. Z. Manna and A. Pnueli. How to cook a temporal proof system for your pet language. In 10th ACM Symposium on Principles of Programming Languages, pp. 141-154, 1983.
13. Z. Manna and A. Pnueli. Specification and verification of concurrent programs by V-automata. In 14th ACM Symposium on Principles of Programming Languages, pp. 1-12, 1987.
14. Z. Manna and A. Pnueli. Completing the temporal picture. In 16th Int. Colloq. Aut. Lang. Prog. G. Ausiello, M. Dezani-Ciancaglini, and S. Ronchi Della Rocca, (eds), LNCS 372, Springer-Verlag, 1989. Also in Theoretical Computer Science, 83, 97-130, 1991.
15. Z. Manna and A. Pnueli. Completing the temporal picture. In 16th Int. Colloq. Aut. Lang. Prog. G. Ausiello, M. Dezani-Ciancaglini, and S. Ronchi Della Rocca, (eds), LNCS 372, Springer-Verlag, 1989. Also in Theoretical Computer Science, 83, 97-130, 1991.
16. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, 1991.
17. Z. Manna and R. Waldinger. Is sometime sometimes better than always? intermittent assertions in proving program correctness. Communications ACM, 21, 159-172, 1978.
18. S. Owicki and L. Lamport. Proving liveness properties of concurrent programs. ACM Transactions on Programming Umguages and Systems, 4, 455-495, 1982.
19. A. Pnueli and L. Zuck. In and out of temporal logic. In Proceedings of the 8th IEEE Symposium on Logic in Computer Science, pp. 124-135, 1993.
20. F. A. Stomp, W.-P. de Roever, and R. T. Gerth. The μ-calculus as an assertion language for fairness arguments. Technical Report 84-12, Utrecht, 1984.
21. M. Vardi. Verification of concurrent programs: the automata-theoretic framework. Annals of Pure and Applied Logic, 51, 79-98, 1991.