Data structure fusion

Author(s)
Hawkins, Peter; Aiken, Alex; Fisher, Kathleen; Rinard, Martin C.; Sagiv, Mooly
Thumbnail
DownloadRinard_Data structure.pdf (402.4Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by/3.0
Metadata
Show full item record
Abstract
We consider the problem of specifying data structures with complex sharing in a manner that is both declarative and results in provably correct code. In our approach, abstract data types are specified using relational algebra and functional dependencies; a novel fuse operation on relational indexes specifi es where the underlying physical data structure representation has sharing. We permit the user to specify diff erent concrete shared representations for relations, and show that the semantics of the relational specifi cation are preserved.
Date issued
2010-11
URI
http://hdl.handle.net/1721.1/63114
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
Papers of the Eighth ASIAN Symposium on Programming Languages and Systems, APLAS 2010
Publisher
Asian Association for Foundation of Software
Citation
Hawkins, Peter et al. "Data Structure Fusion." in Papers of the Eighth ASIAN Symposium on Programming Languages and Systems, APLAS 2010, Shanghai, China, Nov. 28-Dec.1, 2010.
Version: Author's final manuscript
Collections