Correctness of data representations involving heap data structures

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

Volumn 2618, Issue , 2003, Pages 223-237

  Reddy, Uday S ^a,b   Yang, Hongseok ^a,b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; PASCAL (PROGRAMMING LANGUAGE);

DATA REPRESENTATIONS; HEAP DATA STRUCTURES; KEEP TRACK OF; LOCAL VARIABLES; PARAMETRICITY; REASONING PRINCIPLES; RELATIONAL REASONING; SEMANTIC MODEL;

SEMANTICS;

EID: 35248867803     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36575-3_16     Document Type: Article

References (28)

1. ABRAMSKY, S., HONDA, K., AND MCCUSKER, G. A fully abstract game semantics for general references. In LICS 1998 (1998), pp. 334-344.
2. BANERJEE, A., AND NAUMANN, D. A. Representation independence, confinement and access control. In POPL 2002 (2002), ACM.
3. DUNPHY, B. P. Parametricity as a Notion of Uniformity in Reflexive Graphs. PhD thesis, University of Illinois, Dep. of Mathematics, 2002.
4. GHICA, D. R. Semantics of dynamic variables in Algol-like languages. Master's thesis, Queen's University, Kingston, Canada, Mar 1997. (available electronically from ftp://ftp.qucis.queensu.ca/pub/rdt).
5. GHICA, D. R. Parameters and linked structures in algol-like languages. In Report of the Dagstuhl Seminar 98261: The Semantic Challenge of Object-oriented Programming (1998), Schloss Dagstuhl.
6. LAUNCHBURY, J., AND PEYTON JONES, S. L. State in Haskell. J. Lisp and Symbolic Comput. 8, 4 (1995), 293-341.
7. LEVY, P. B. Call-by-Push-Value. PhD thesis, Queen Mary, University of London, March 2001.
8. LEVY, P. B. Possible world semantics for general storage in call-by-value. In CSL 2002 (2002), pp. 232-246.
9. MEYER, A. R., AND SIEBER, K. Towards fully abstract semantics for local variables. In Fifteenth Ann. ACM Symp. on Princ. of Program. Lang. (1988), ACM, pp. 191-203. (Reprinted as Chapter 7 of [15]).
10. MITCHELL, J. C., AND PLOTKIN, G. D. Abstract types have existential types. ACM Trans. Program. Lang. Syst. 10, 3 (1988), 470-502.
11. O'HEARN, P., REYNOLDS, J., AND YANG, H. Local reasoning about programs that alter data structures. In CSL 2001 (Berlin, 2001), L. Fribourg, Ed., vol. 2142 of LNCS, Springer-Verlag, pp. 1-19.
12. O'HEARN, P. W., AND REYNOLDS, J. C. From Algol to polymorphic linear lambda-calculus. J. ACM 47, 1 (2000), 167-223.
13. O'HEARN, P. W., AND TENNENT, R. D. Semantics of local variables. In Applications of Categories in Computer Science, M. P. Fourman, P. T. Johnstone, and A. M. Pitts, Eds. Cambridge Univ. Press, 1992, pp. 217-238.
14. O'HEARN, P. W., AND TENNENT, R. D. Parametricity and local variables. J. ACM 42, 3 (1995), 658-709. (Reprinted as Chapter 16 of [15]).
15. O'HEARN, P. W., AND TENNENT, R. D. Algol-like Languages (Two volumes). Birkhäuser, Boston, 1997.
16. OLES, F. J. A Category-Theoretic Approach to the Semantics of Programming Languages. PhD thesis, Syracuse University, 1982.
17. REDDY, U. S. When parametricity implies naturality. Electronic manuscript, July 1997. URL http://www.cs.bham.ac.uk/~udr.
18. REDDY, U. S. Objects and classes in Algol-like languages. In Fifth Intern. Workshop on Foundations of Object-oriented Languages (Jan 1998), electronic proceedings at http://pauillac.inria.fr/~remy/fool/proceedings.html.
19. REDDY, U. S. Objects and classes in Algol-like languages. Information and Computation 172 (2002), 63-97.
20. REYNOLDS, J. C. Towards a theory of type structure. In Coll. sur la Programmation, vol. 19 of LNCS. Springer-Verlag, 1974, pp. 408-425.
21. REYNOLDS, J. C. The essence of Algol. In Algorithmic Languages, J. W. de Bakker and J. C. van Vliet, Eds. North-Holland, 1981, pp. 345-372. (Reprinted as Chapter 3 of [15]).
22. REYNOLDS, J. C. Intuitionistic reasoning about shared mutable data structure. In Millenial Perspectives in Computer Science. Palgrave, 2000.
23. ROBINSON, E., AND ROSOLINI, G. Reflexive graphs and parametric polymorphism. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science (July 1994), IEEE Computer Society Press.
24. STARK, I. Names and higher-order functions. Technical Report 363, University of Cambridge Computer Laboratory, April 1995.
25. STARK, I. Categorical models for local names. Lisp and Symbolic Computation 9, 1 (Feb. 1996), 77-107.
26. TENNENT, R. D. Correctness of data representations in Algol-like languages. In A Classical Mind: Essays in Honor of C. A. R. Hoare, A. W. Roscoe, Ed. Prentice-Hall International, 1994, pp. 405-417.
27. WIRTH, N., AND HOARE, C. A. R. A contribution to the development of Algol. Comm. ACM 9, 6 (June 1966), 413-432.
28. YANG, H. Local reasoning for stateful programs. Tech. Rep. UIUCDCS-R-2001-2227, University of Illinois, Dep. of Computer Science, July 2001.