A temporal fixpoint calculus

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn Part F130193, Issue , 1988, Pages 250-259

  Vardi, Moshe Y ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATION THEORY; MODEL CHECKING; TEMPORAL LOGIC;

FINITE STATE; FIXPOINTS; MODEL CHECKING ALGORITHM; OPTIMAL DECISIONS;

COMPUTER CIRCUITS;

EID: 85011693404     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/73560.73582     Document Type: Conference Paper

References (39)

1. Alpern, B., Schneider, F.B.: Verifying iemporal properties without using temporal logic. Technical Report TR-85-723, Cornell University, Dec. 1985.
2. Alpern, B., Schneider, F.B.: Proving Boolean combinations of deterministic properties. Proc. 2nd IEEE Symp. on Logic in Computer Science, Ithaca, June 1987.
3. Barringer H.: Using temporal logic in the compositional specification of concurrent systems. Dept. of Computer Science University of Manchester Technical Report UMCS-86-10-1.
4. Banieqbal B. Barringer: A study of an extended temporal language and a temporal fixed point calculus. Dept. of Computer Science University of Manchester Technical Report UMCS-86-10-2.
5. B. Barringer, Kuiper, R.: Hierarchical development of concurrent systems in a temporal logic framework. Seminar in Concurrency, eds. S.D. Brookes et al., Springer-Verlag, Lecture Notes in Computer Science 197, 1985, pp. 35-61.
6. Barringer, H., Kuiper, R., Pnueli, A.: A compositional temporal approach to a csp-like language. Formal Models of Programming, eds. E.J. Neuhold and G. Chroust, North Holland, 1985, pp. 207-227.
7. Barringer, H., Kuiper, R., Pnueli, A.: A really abstract concurrent model and its temporal logic. Proc. 13th ACM Symp. on Principles of Programming Languages, St. Petersburg, 1986.
8. Biichi, J.R.: On a decision method in restricted second-order arithmetics. Proc. Int'l Congr. on Logic, Method, and Phil, of Sci. 1960, Stanford University Press, 1962, pp. 1-12.
9. Choueka, Y.: Theories of automata on ω-tapes - a simplified approach. J. Computer and System Science 8(1974), pp. 117-141.
10. Emerson, E.A., Clarke, E.C.: Characterizing correctness properties of parallel programs using fixpoints. Proc. 7th Lnt'l Colloq. on Automata, Languages and Programming, 1980, pp. 169-181.
11. Emerson, E.A., Pnueli, A.: Temporal and Modal Logic. Handbook of Theoretical Computer Science, eds. J. van Leeuwen et. al., North-Holland Pub., in press, 1987.
12. Fischer, M.J., Ladner, R.E.: Prepositional dynamic logic of regular programs. J. Computer and Systems Science, 18(1979), pp. 194-211.
13. Gabbay, D., Pnueli, A., Shelah, S., Stavi, J.: On the temporal analysis of fairness. Proc. 7th ACM Symp. on Principles of Programming Languages, 1980, pp. 163-173.
14. Kozen, D.: Results on the propositional mu-calculus. Proc. 9th Int'l Colloq. on Automata, Languages and Programming, 1982, pp. 348-359.
15. Koymans, R., Vytopil, J., DeRoever, W.P.: Real-time programming and asynchronous message passing. Proc. 2nd ACM Symp. on Principles of Distributed Computing, Montreal, 1983, pp. 187-197.
16. Lichtenstein, O., Pnueli, A.: Checking that finite-state concurrent programs satisfy their linear specification. Proc. 12th ACM Symp. on Principles of programming Languages, 1985, pp. 97-107.
17. Lichtenstein, O., Pnueli, A., Zuck L.: The glory of the past. Proc. Workshop on Logics of Programs, Brooklyn, Springer-Verlag, Lecture Notes in Computer Science 193, 1985, pp. 97-107.
18. Manna, Z., Pnueli, A.: How to cook a temporal proof system for your pet language. Proc. 10th Symposium on Principles of Programming Languages, Austin, Texas, 1983, pp. 141-154.
19. Manna, Z., Pnueli, A.: Specification and verification of concurrent programs by V-automata. Proc. 14 ACM Symp. on Principles of Programming Languages, Munich, Jan. 1987, pp. 1-12.
20. Manna, Z., Wolper, P.: Synthesis of communicating processes from temporal logic specifications. ACM Trans, on Programming Languages, 1984, pp. 68-93.
21. Pnueli, A.: The temporal logic of programs. Proc. 18th Symp. on Foundations of Computer Science, 1977, pp. 46-57.
22. Pnueli, A: In transition from global to modular reasoning about programs. Logics and Models of Concurrent Systems, ed. K.R. Apt, Springer-Verlag, 1985, pp. 123-144.
23. Pnueli, A: Applications of temporal logic to the specification and verification of reactive systems - a survey of current trends. Current Trends in Concurrency, eds. J.W. de Bakker et al., Springer-Verlag, Lecture Notes in Computer Science 224, 1986, pp. 510-584.
24. Prior, A.: Past, Present, and Future, Oxford Press, 1951.
25. Pratt, V.R.: Program Logic Without Binding is Decidable, Proc. 8th ACM Symp. on Principles of Programming Languages, 1981.
26. Pratt, V.R.: A decidable mu-calculus. Proc. 23rd IEEE Symp. on Foundations of Computer Science, 1982, pp. 421-427.
27. Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Research and Development, 3(1959), pp.; 114-125.
28. Rescher, N, Urquhart, A.: Temporal Logic. Springer-Verlag, 1971.
29. Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. J. ACM 32(1985), pp. 733-749.
30. Streett, R.S., Emerson, E.A.: The propositional mu-calculus is elementary. Proc. 11th Int'l Colloq. on Automata, Languages and Programming, 1984, Springer-Verlag, Lecture Notes in Computer Science 172, pp. 465-472.
31. Shepherdson, J.C.: The reduction of two-way automata to one-way automata. IBM J. Research and Development, 3(1959), pp. 199-201.
32. Streett, R.S.: Propositional dynamic logic of looping and converse is elementarily decidable. Information and Control, 54(1982), pp. 121-141.
33. Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for Biichi automata with applications to temporal logic. Theoretical Computer Science 49(1987), pp. 217-237.
34. Thomas, W.: A combinatorial approach to the theory of w-automata. Information and Control 48(1981), pp. 261-283.
35. Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. Proc. 26th IEEE Symp. on Foundations of Computer Science, Portland, 1985, pp. 327-338.
36. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. Proc. IEEE Symp. on Logic in Computer Science, Cambridge, 1986, pp. 332-344.
37. Vardi, M.Y., Wolper, P.: Applications of temporal logic - an automata-theoretic prespective. Stanford University, CSLI, 1985.
38. Wolper, P.: Temporal logic can be more expressive. Information and Control 56(1983), pp. 72-99.
39. Wolper, P.L., Vardi, M.Y., Sistla, A.P.: Reasoning about infinite computation paths. Proc. 24th IEEE Symp. on Foundation of Computer Science, Tuscon, 1983, pp. 185-194.