Correctness of Data Representations involving Heap Data Structures

Cited 22 time in webofscience Cited 0 time in scopus
  • Hit : 303
  • Download : 0
While the semantics of local variables in programming languages is by now well-understood, the semantics of pointer-addressed heap variables is still an outstanding issue. In particular, the commonly. assumed relational reasoning principles or data representations have not been validated in a semantic model of heap variables. In this paper, we define a parametricity semantics for a Pascal-like language with pointers and heap variables which gives such reasoning principles. It turns out that the correspondences between data representations cannot simply be relations between states, but more intricate correspondences that also need to keep track of visible locations whose pointers can be stored and leaked. (C) 2004 Elsevier B.V. All rights reserved.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2004-03
Language
English
Article Type
Article; Proceedings Paper
Citation

SCIENCE OF COMPUTER PROGRAMMING, v.50, no.1-3, pp.129 - 160

ISSN
0167-6423
DOI
10.1016/j.scico.2004.01.007
URI
http://hdl.handle.net/10203/225299
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 22 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0