Towards fully abstract semantics for local variables: Preliminary report

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

Volumn Part F130193, Issue , 1988, Pages 191-203

  Meyer, Albert R ^a   Sieber, Kurt ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

ABSTRACT MODELING; ABSTRACT SEMANTICS; COMPLETE PARTIAL ORDERS; COUNTER EXAMPLES; LOCAL VARIABLES; PROOF RULES; PROOF SYSTEM;

ALGOL (PROGRAMMING LANGUAGE);

EID: 33846545518     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/73560.73577     Document Type: Conference Paper

References (28)

1. G. Berry, P. Curien, and J. Levy. Full abstraction for sequential languages: the state of the art. In M. Nivat and J. C. Reynolds, editors, Algebraic Methods in Semantics, chapter 00, page 0, Cambridge Univ. Press, 1985.
2. (2] E. M. Clarke, Jr. Programming language constructs for which it is impossible to obtain good Hoare axiom systems. J. ACM, 26:129-147, 1979.
3. E. M. Clarke, Jr., S. M. German, and J. Halpern. On effective axiomatizations of Hoare logics. J. ACM, 30:612-636, 1983.
4. W. Damm. The 10- and OI-hierarchies. Theoretical Computer Sci., 20:95-207, 1982.
5. W. Damm and E. Fehr. A schematological approach to the analysis of the procedure concept in ALGOL-languages. In 5ieme Coll. sur les Arbes en Algebre et en Programmation, pages 130-134, Lille, 1980.
6. J. DeBakker. Mathematical Theory of Program Correctness. Prentice-Hall, 1980.
7. S. German, E. M. Clarke, and J. Halpern. Reasoning about procedures as parameters. In E. M. Clarke, Jr. and D. Kozen, editors, Logic of Programs, 1983, pages 206-220, Volume 164 of Lect. Notes in Computer Sci., Springer-Verlag, 1984.
8. A. Goerdt. Hoare logic for lambda-terms as basis of Hoare logic for imperative languages. In Symp. Logic in Computer Sci., pages 293-299, IEEE, 1987.
9. M. J. C. Gordon. The Denotational Description of Programming Languages. Springer-Verlag, 1979.
10. J. Y. Halpern, A. R. Meyer, and B. A. Trakhtenbrot. The semantics of local storage, or what makes the free-list free? In 11th Symp. on Principles of Programming Languages, pages 245-257, ACM, 1984.
11. Z. Manna and R. Waldinger. Problematic features of programming languages: a situational-calculus approach. Acta Informatica, 16:371-426, 1981.
12. R. Milne and C. Strachey. A Theory of Programming Language Semantics. Chapman and Hall, 1976.
13. K. Mulmuley. Full abstraction and semantic equivalence. Ph.D. thesis, Carnegie-Mellon Univ., Pittsburgh, PA, 1985. Available as Technical Report CMU-CS-85-148.
14. M. J. O'Donnell. A critique of the foundations of Hoare-style programming logic. Commun. ACM, 25:927-934, 1982.
15. E. Olderog. A characterization of Hoare's logic for programs with Pascal-like procedures. In 15th Symp. on Theory of Computing, pages 320-329, ACM, 1983.
16. E. Olderog. Correctness of programs with PASCAL-like procedures without global variables. Theoretical Computer Sci, 30:49-90, 1984.
17. E. Olderog. Hoare's logic for program with procedures-what has been accomplished? In E. Clarke and D. Kozen, editors, Logic of Programs, Proceedings 1983, pages 383-395, Volume 164 of Lect. Notes in Computer Sci., Springer-Verlag, 1984.
18. F. J. Oles. A category-theoretic approach to the semantics of programming languages. Ph.D. thesis, Syracuse Univ., 1982.
19. F. J. Oles. Type algebras, functor categories, and block structure. In M. Nivat and J. C. Reynolds, editors, Algebraic Methods in Semantics, chapter 15, pages 543-573, Cambridge Univ. Press, 1985.
20. G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Sci., 5:223-256, 1977.
21. J. C. Reynolds. The Craft of Programming. Prentice-Hall Int'l., 1981.
22. J. C. Reynolds. The essence of Algol. In J. DeBakker and van Vliet, editors, Int'l. Syrup. Algorithmic Languages, pages 345-372, IFIP, North-Holland, 1981.
23. J. C. Reynolds. Idealized Algol and its specification logic. In D. Neel, editor, Tools and Notions for Program Construction, pages 121-161, Cambridge Univ. Press, 1982.
24. R. L. Schwartz. An axiomatic treatment of Algol 68 routines. In H. Maurer, editor, 6th Int'l. Coll. Automata, Languages and Programming, pages 530-545, Volume 71 of Lect. Notes in Computer Sci., Springer-Verlag, 1979.
25. K. Sieber. A partial correctness logic for programs (in an ALGOL-like language). In R. Parikh, editor, Logics of Programs, pages 320-342, Volume 193 of Lect. Notes in Computer Sci., Springer-Verlag, 1985.
26. R. D. Tennent. Semantical analysis of specification logic (preliminaray report). In R. Parikh, editor, Logics of Programs, pages 373-386, Volume 193 of Lect. Notes in Computer Sci., Springer-Verlag, 1985.
27. R. D. Tennent. Semantical analysis of specification logic. 1987. Submitted, 22 pp.
28. B. A. Trakhtenbrot, J. Y. Halpern, and A. R. Meyer. From denotational to operational and axiomatic semantics for ALGOL-like languages: an overview. In E. Clarke and D. Kozen, editors, Logic of Programs, Proceedings 1983, pages 474-500, Volume 164 of Lect. Notes in Computer Sci., Springer-Verlag, 1984.