A fully abstract semantics and a proof system for an algol-like language with sharing

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

Volumn 239 LNCS, Issue , 1986, Pages 59-100

  Brookes, Stephen D ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADA (PROGRAMMING LANGUAGE); ALGOL (PROGRAMMING LANGUAGE); COMPUTER PROGRAMMING LANGUAGES; FORMAL METHODS; LOCATION; PROGRAMMABLE LOGIC CONTROLLERS; STRUCTURAL PROPERTIES; STRUCTURED PROGRAMMING; SYNTACTICS;

ABSTRACT SEMANTICS; CONVENTIONAL APPROACH; DENOTATIONAL SEMANTICS; PARTIAL CORRECTNESS; PROCEDURAL LANGUAGES; REASONING ABOUT PROGRAMS; SEMANTIC STRUCTURES; SOUNDNESS AND RELATIVE COMPLETENESS;

SEMANTICS;

EID: 33746041780     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-16816-8_26     Document Type: Conference Paper

References (32)

1. Apt, K. R., Ten Years of Hoare’s Logic: A survey-Part 1, ACM TOPLAS, Vol. 3 pp 431-483 (1981).
2. de Bakker, J. W., Mathematical Theory of Program Correctness, Prentice-Hall 1980.
3. Cartwright, R, and Oppen, D., The Logic of Aliasing, Acta Informatica 15, pp 365-384 (1981).
4. Cartwright, R., and Oppen, D., Unrestricted Procedure Calls in Hoare’s Logic, Proc. 5th ACM Symposium on Principles of Programming Languages, ACM New York.
5. Clarke, E. M., Programming language constructs for which it is impossible to obtain good Hoare axioms, JACM 26 pp 129-147 (1979).
6. Cook, S., Soundness and completeness of an axiom system for program verification, SIAM J. Comput. 7, pp 70-90 (1978).
7. Donahue, James, Locations Considered Unnecessary, Acta Informatica 8, pp 221-242 (1977).
8. Gordon, M., The Denotational Description of Programming Languages, Springer Verlag 1978.
9. Gries, D., The Multiple Assignment Statement, IEEE Trans. Software Engrg, SE-4, pp 89-93 (1978).
10. Gries, D., and Levin, G., Assignment and procedure call proof rules, ACM TOPLAS 2, pp 564-579 (1980).
11. Halpern, J., A Good Hoare Axiom System for an Algol-like language, Proc. POPL 1984.
12. Halpern, J., Meyer, A., and Trakhtenbrot, B., The Semantics of Local Storage, or What Makes the Free-list Free?, Proc. POPL 1984.
13. Halpern, J., Meyer, A., and Trakhtenbrot, B., From Denotational to Operational and Axiomatic Semantics for ALGOL-like languages; An Overview, Proc. 1983 Workshop on Logics of Programs, Springer Verlag LNCS 164 (1984).
14. Hoare, C. A. R., An Axiomatic Basis for Computer Programming, CACM 12, pp 576-580 (1969).
15. Hoare, C. A. R., Procedures and parameters: An axiomatic approach, in: Symposium on Semantics of Algorithmic Languages, Springer Verlag LNCS 188 (1971).
16. Jones, C. B., Yet Another Proof of the Correctness of Block Implementation, IBM Laboratory, Vienna (August 1970).
17. Landin, P. J., A Correspondence between Algol 60 and Church’s lambda notation, CACM 8, 89-101 and 158-165 (1965).
18. Langmaack, H.,On Termination Problems for Finitely Interpreted ALGOL-like Programs, Acta Informatica 18, pp 79-108 (1972).
19. Milne, R., and Strachey, C., A Theory of Programming Language Semantics, Chapman and Hall 1976.
20. Milner, R., Fully Abstract Models of Typed X-calculi, Theoretical Computer Science (1977).
21. Mosses, P. D., The Mathematical Semantics of ALGOL 60, Technical Monograph PRG-12, Oxford University Computing Laboratory, Programming Research Group (1974).
22. Olderog, E-R., Correctness of Programs with Pascal-like Procedures without Global Variables, Theoretical Computer Science 30 (1984) 49-90.
23. Olderog, E-R., Sound and Complete Hoare-like Calculi Based on Copy Rules, Acta Informatica 16, pp 161-197 (1981).
24. Oles, F. J., A Category-theoretic Approach to the Semantics of ALGOL-like Languages, Ph. D. thesis, Syracuse University (August 1982).
25. Plotkin, G. D., LCF Considered as a Programming Language, Theoretical Computer Science 5, pp 223-255 (1977).
26. , and Hennessy, M. C. B., Full Abstraction for a Simple Parallel Programming Language, Proc. MFCS. 1979, Springer LNCS 74, pp 108-120 (1979).
27. Reynolds, J., The Craft of Programming, Prentice-Hall 1981.
28. Reynolds, J., Idealized Algol and its specification logic, Technical Report 1-81, Dept, of Computer and Information Science, Syracuse University (July 1981).
29. Reynolds, J., Syntactic control of interference, Proceedings of the 5th ACM Symposium on Principles of Programming Languages, ACM New York, pp 39-46 (1978).
30. Stoy, J. E., Denotational Semantics, MIT Press 1977.
31. Strachey, C., Towards a formal semantics, in: Formal Language Description Languages for Computer Programming, ed. T. B. Steel, Jr., North-Holland, Amsterdam (1966).
32. Tennent, R. D., Semantics of interference control, Theoretical Computer Science 27 (1983) 293-310.