Correctness of data representations involving heap data structures

Science of Computer Programming

Volumn 50, Issue 1-3, 2004, Pages 129-160

  Reddy, Uday S ^a   Yang, Hongseok ^b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Denotational semantics; Imperative programming languages; Relational parametricity; Separation logic

Indexed keywords

COMPUTER SIMULATION; GRAPH THEORY; PASCAL (PROGRAMMING LANGUAGE); SEMANTICS; THEOREM PROVING;

DENOTATIONAL SEMANTICS; IMPERATIVE PROGRAMMING LANGUAGES; RELATIONAL PARAMETRICITY; SEPARATION LOGIC;

DATA STRUCTURES;

EID: 1442286771     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2004.01.007     Document Type: Conference Paper

References (31)

1. S. Abramsky, K. Honda, G. McCusker, A fully abstract game semantics for general references, in: Lecture Notes in Computer Science, 1998, pp. 334-344.
2. A. Banerjee, D.A. Naumann, Representation independence, confinement and access control, in: POPL, ACM, New York, 2002.
3. B.P. Dunphy, Parametricity as a notion of uniformity in reflexive graphs, Ph.D. Thesis, University of Illinois, Department of Mathematics, 2002.
4. D.R. Ghica, Semantics of dynamic variables in Algol-like languages, Master's Thesis, Queen's University, Kingston, Canada, March 1997.
5. Launchbury J., Peyton Jones S.L. State in Haskell. J. Lisp. Symbolic Comput. 8(4):1995;293-341.
6. P.B. Levy, Call-by-push-value, Ph.D. Thesis, Queen Mary, University of London, March 2001.
7. P.B. Levy, Possible world semantics for general storage in call-by-value, in: CSL, 2002, pp. 232-246.
8. A.R. Meyer, K. Sieber, Towards fully abstract semantics for local variables, in: Fifteenth Ann. ACM Symp. on Princ. of Program. Lang., ACM, New York, 1988, pp. 191-203. (Reprinted as Chapter 7 of [16]).
9. Mitchell J.C., Plotkin G.D. Abstract types have existential types. ACM Trans. Program. Lang. Systems. 10(3):1988;470-502.
10. Moggi E. Notions of computations and monads. Inform. Comput. 93:1991;55-92.
11. O'Hearn P.W., Reynolds J.C. From Algol to polymorphic linear lambda-calculus. J. ACM. 47(1):2000;167-223.
12. O'Hearn P.W., Reynolds J., Yang H. Local reasoning about programs that alter data structures. Fribourg L. CSL (Berlin, 2001). Lecture Notes in Computer Science. vol. 2142:2001;1-19 Springer, Berlin.
13. P.W. O'Hearn, J. Reynolds, H. Yang, Separation and information hiding, in: ACM Symp. on Princ. of Program. Lang., ACM, New York, 2004, pp. 268-280.
14. O'Hearn P.W., Tennent R.D. Semantics of local variables. Fourman M.P., Johnstone P.T., Pitts A.M. Applications of Categories in Computer Science. 1992;217-238 Cambridge University Press, Cambridge.
15. O'Hearn P.W., Tennent R.D. Parametricity and local variables. J. ACM. 42(3):1995;658-709. (Reprinted as Chapter 16 of [16]).
16. O'Hearn P.W., Tennent R.D. Algol-like Languages (Two volumes). 1997;Birkhäuser, Boston.
17. F.J. Oles, A category-theoretic approach to the semantics of programming languages, Ph.D. Thesis, Syracuse University, 1982.
18. U.S. Reddy, When parametricity implies naturality, Electronic manuscript, University of Birmingham, http://www.cs.bham.ac.uk/~udr/, July 1997.
19. U.S. Reddy, Objects and classes in Algol-like languages, in: FOOL 5: Fifth Intern. Workshop on Foundations of Object-oriented Languages, January 1998, electronic proceedings at http://pauillac.inria.fr/~remy/fool/proceedings.html .
20. Reddy U.S. Objects and classes in Algol-like languages. Inform. Comput. 172:2002;63-97.
21. U.S. Reddy, H. Yang, Correctness of data representations involving heap data structures, in: Programming Languages and Systems: 12th European Symposium on Programming (2003), Lecture Notes in Computer Science, vol. 2618, Springer, Berlin, pp. 223-237.
22. J.C. Reynolds, Towards a theory of type structure, in: Coll. sur la Programmation, Lecture Notes in Computer Science, vol. 19, Springer, Berlin, 1974, pp. 408-425.
23. Reynolds J.C. The essence of Algol. de Bakker J.W., van Vliet J.C. Algorithmic Languages. 1981;345-372 North-Holland, Amsterdam. (Reprinted as Chapter 3 of [16]).
24. J.C. Reynolds, Intuitionistic reasoning about shared mutable data structure, in: J. Davies, B. Roscoe, J. Woodcock (Eds.), Millenial Perspectives in Computer Science, Palgrave, Houndsmill, UK, 2000.
25. E. Robinson, G. Rosolini, Reflexive graphs and parametric polymorphism, in: Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, Silver Spring, MD, July 1994.
26. I. Stark, Names and higher-order functions, Ph.D. Thesis, University of Cambridge Computer Laboratory, Tech. Rep. 363, 1995.
27. Stark I. Categorical models for local names. Lisp Symbolic Comput. 9(1):1996;77-107.
28. Tennent R.D. Correctness of data representations in Algol-like languages. Roscoe A.W. A Classical Mind: Essays in Honor of C.A.R. Hoare. 1994;405-417 Prentice-Hall International, Englewood Cliffs, NJ.
29. P. Wadler, The essence of functional programming, in: ACM Symp. on Princ. of Program. Lang., 1992, pp. 1-14.
30. Wirth N., Hoare C.A.R. A contribution to the development of Algol. Comm. ACM. 9(6):1966;413-432.
31. H. Yang, Local reasoning for stateful programs, Ph.D. Thesis, The University of Illinois at Urbana-Champaign, Tech. Rep. UIUCDCS-R-2001-2227, 2001.