The temporal logic of programs

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1977-October, Issue , 1977, Pages 46-57

  Pnueli, Amir ^a,b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BASIC CONCEPTS; CONCURRENT PROGRAM; LOGIC OF PROGRAMS; PARALLEL PROGRAM; PROGRAM VERIFICATION; TEMPORAL REASONING; TIME DEPENDENCE; UNIFIED APPROACH;

COMPUTER CIRCUITS;

EID: 85047040703     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.1977.32     Document Type: Conference Paper

References (30)

1. Aschroft E.A. and Manna Z (1970): "Formalization of Properties of Parallel Programs," Machine Intelligence 6, Edinburgh University Press.
2. Aschroft E.A. (1975): "Proving Assertions About Parallel Programs," JCSS 10(1) 11
3. Aschroft E.A. and Wadge, W.W: "Intermittent Assertion Proofs in Lucid," IFIP, Toronto 1977.
4. Burstall, R.M.: "Formal Description of Program Structure and Semantics of First Order Logie" in B. Meltzer & D. Michie (eds.) Machine Intelligence 5 (1970) 79-98, Edinburgh.
5. Burstall, R.M. (1974): "Program Proving as Hand Simulation With A Little Induction," Information Processing, 1974, North Holland Publishing Company, Amsterdam, 308-312.
6. Hoare, C.A.R. (1969): "An Axianatic Basis Of Ccmputer Programming", CACM 12 (10) .
7. Hoare, C.A. R. (1970): "Procedures and Parameters: An Axianatic Approach", in Engeler (Ed.) Lecture Notes in Mathematics 188, Springer Verlag.
8. Hoare, C. A. R. (1972): "Towards a The ory of Parallel Programming", in Hoare, C.A.R, Perrot, R.H. (Eds.): Operating Systems Techniques, New York Academic Press.
9. Floyd, R.W.: "Assigning Meanings to Programs," Proc. Symp. Appl. Math. 19, in J.T. Schwartz (ed.) Mathematical Aspects of Computer Science, pp. 19-32, 1967.
10. Francez, N.: "The Analysis of Cyclic Programs," Ph.D. thesis, Weizmann Institute of Science, Rehovot, Israel 1976.
11. Francez, N. and Pnueli, A: "A Proof Method For Cyclic Programs," Proceedings of the 1976 Conference on Parallel Processing, 235-245.
12. Francez, N. and Pnueli, A.: "Proving Properties of Parallel Programs by Global Invariants," to appear.
13. Keller, R.M.: "Formal Verification of Programs," CACM 19 (7) 1976.
14. Kröger, F.: "Logical Rules of Natural Reasoning About Programs," Third Intern. Symposium on Automata, Languages and Programming, Edinburgh, Edinburgh University Press, 1976, 87-98.
15. Kröger, F: "A Uniform Logical Basis For The Description, Specification and Correctness Proof Techniques of Programs". Institute fur Informatik der Technischen Universitat Munchen.
16. Lamport, L (1976): "Proving the Correctness of Multiprocess Program," Massachusetts Canputer Associates, Inc. Mass. 01880.
17. Manna Z: 'Mathematical Theory of Computation," McCraw-Hill (1974).
18. Manna Z. and Pnueli, A: "Axiomatic Approach to Total Correctness," Acta Informatica 3, 243-263.
19. Manna Z. and Weldinger, R: "Is "sometime" sometimes better than "always"? Intermittent assertions in proving Program Correctness. Proc. 2nd Internatlatal Conference on Software Engineering, San Francisco (Calif.) 1976, 32-39.
20. McCarthy, J., Hayes, P.J: "Sore Philosophic Problems from the Standpoint of Artificial Intelligence" in B. Meltzer and D. Michie (eds.) Machine Intelligence 4 (1969) 463-502, Edinburgh.
21. Owicki, S. and Gries, D.: "An Axiomatic Proof Technique for Parallel Programs I ", Acta Informatica 6,319-339.
22. Owicki, S. and Gries, D: "Verifying Properties of Parallel Programs: An Axiomatic Approach", CACM 19(5) 1976, 279-284.
23. Rescher, N. and Urquhart, A: "Temporal Logic," Springer Verlag 1971.
24. Schwarz, J: "Event Based Reasoning - A System for Proving Correct Termination of Programs". Research Report No. 12, Dept. of Artificial Intelligence, University of Edinburgh, Edinburgh, Scotland.
25. Sites, R.L.: "Proving that Computer Programs Terminate Cleanly," Stanford University, Technical Report, May 1974.
26. Constable, R.L: "On the Theory of Programming Logic," Proc. of the 9th Annual Symposium on Theory of Computing, Boulder, Colorado, May 1977.
27. Hughes, G.E. and Creswell, M.J: "An Introduction to Modal Logic," London: Methuen and Co. Ltd, 1972.
28. Harel, D., Meyer, A.R. and Pratt, V.R: "Computability and Completeness in Logics of Programs," Proc. of the 9th Annual Symp. on Theory of Computing, Boulder, Colorado, May 1977.
29. Fischer, M.J. and Ladner, R.E. : "Propositional Modal Logic of Programs," Proc. of the 9th Annual Symp. on Theory of Computing, Boulder, Colorado, May 1977.
30. Kripke, S.A. : "Semantical Analysis of Modal Logic I: Normal Modal Propositional Calculi," Zeitschr. f. Math. Logik and Grundlagen d. Math. 9 (1963) pp. 67-96.