Semantical considerations on Floyd-Hoare logic

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

Volumn 1976-October, Issue , 1976, Pages 109-121

  Pratt, Vaughan R ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; SEMANTICS;

AXIOM SYSTEM; BINARY RELATION; DEFINABILITY; DIFFERENT LIGHTS; FLOYD-HOARE LOGIC; LOGIC OF PROGRAMS; PARTIAL CORRECTNESS; TRUTH VALUES;

COMPUTER CIRCUITS;

EID: 85034789348     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1976.4567894     Document Type: Conference Paper

References (35)

1. Aho, A. V. Indexed Grammars. JACM 15, 4, 647-671, 1988.
2. -, J. E. Hopcroft and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass. 1974.
3. Ashcroft, E. and Z. Manna. The translation of 'go to' programs to 'while' programs. STAN-CS-71-188, Stanford, CA. 1971.
4. Berztiss, A. T. Data Structures. (2nd Ed.) Academic Press, N. Y. 1975.
5. Burstall, R. M. Program Proving as Hand Simulation with a Little Induction. IFIP 1974, Stockholm.
6. Chomsky, N. Aspects of the Theory of Syntax. MIT Press, Cambridge, Mass. 1965.
7. Cook, S. A. Axiomatic and Interpretive Semantics for an Algol Fragment. TR-79, Toronto, Feb. 1975.
8. Craig, U. Linear Reasoning. A New Form of the Herbrand-Gentzen Theorem. JSL 22, 250-268, 1957.
9. De Bakker, J. W., and D. Scott. An outline of a theory of programs. Unpublished manuscript, 1969.
10. -, and W. P. De Roever. A calculus for recursive program schemes, in Automata, Languages and Programming (ed. Nivat), 167-196. North Holland, 1972.
11. -, and L. G. L. T. Meertens. On the Completeness of the Inductive Assertion Method. JCSS 11. 323-357, 1975.
12. Dijkstra, E. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, N. J. 1976.
13. Eilenberg, S, and C. Elgot. Recursiveness. Academic Press, N. Y. 1970.
14. Elgot, C. C. Structured Programming With and Without GO TO Statements. IEEE Transactions on Software Engineering, SE-2, 1, 41-53, March 1976.
15. Floyd, R. W. Assigning Meanings to Programs, in Mathematical Aspects of Computer Science (ed. J. T. Schwartz), 19-32, 1967.
16. Hoare, C. A. R. An Axiomatic Basis for Computer Programming. CACM 12, 576-580, 1969.
17. Karp, R. M. Some applications of logical syntax to digital computing. Ph. D. Thesis, Harvard, 1959.
18. King, J. A Program Verifier. Ph. D. Thesis, Carnegie-Mellon University, Pittsburgh, Pa,. 1969.
19. Knuth, D. E. The Art of Computer Programming. 1, Addison-Wesley, Reading, MA. 1968.
20. Kripke, S. Semantical considerations on Modal Logic. Acta Philosophica Fennica, 83-94, 1963.
21. Kroeger, F. Logical Rules of Natural Reasoning about Programs. In Automata. Languages and Programming 3 (ed. Michaelson, S. and R. Milner), 87-98. Edinburgh University Press, 1976.
22. Luckham, D. and N. Suzuki. Automatic Program Verification IV: Proof of Termination within a Weak Logic of Programs. STAN-CS-75-522, Stanford, October 1975.
23. Manna, Z. Mathematical Theory of Computation. McGraw-Hill, 1974.
24. -, and A. Pnueli. Axiomatic Approach to Total Correctness of Programs. Acta Informatica, 3, 243-263, 1974.
25. Mendelsohn, E. Introduction to Mathematical Logic. Van Nostrand, N. Y. 1964.
26. Minsky, M. L. Computation - Finite and Infinite Machines. Prentice-Hall, N. J. 1967.
27. Pratt, V. R. Semantics of Programming Languages. Lecture notes for 6.892, Fall 1974, M. I. T.
28. Quine, W. V. O. Word and Object. MIT Press, MA. 1960
29. Reingold, E. M. On the Optimality of Some Set Algorithms. JACM 19, 4, 649-659, April 1972.
30. Rogers, H. Theory of Recursive Functions and Effective Computability. McGraw-Hill, 1967.
31. Scott, O. Toward a Mathematical Semantics for Computer Languages. Symposium on Computers and Automata, Microwave Research Institute Proceedings, 21, Poly technical Institute of Brooklyn, 1971.
32. Schwarz, J. S. Semantics of Partial Correctness Formalisms. Ph. D. Dissertation, Syracuse, Dec. 1974.
33. -, Event Based Reasoning - A System for Proving Correct Termination of Programs. In Automata. Languages and Programming 3 (ed. Michaelson, S. and R. Milner), 131-146. Edinburgh University Press, 1976.
34. Tarski, A. The semantic conception of truth and the foundations of semantics. Philos. and Phenom. Res, 4. 341-376, 1944.
35. Wirth, N. The programming language Pascal. Acta Informatica, 1, 35-63, 1971.