Data representation synthesis
Name
Rinard_Data representation.pdf
Size
370.1 KB
Format
Adobe PDF
Checksum (MD5)
4632666cd0e31fd1c648a9777ff8a959
Author(s)
Hawkins, Peter
Aiken, Alex
Fisher, Kathleen
Rinard, Martin C.
Sagiv, Mooly
Date Issued
June 2011
Journal
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation (PLDI '11)
Publisher
Association for Computing Machinery (ACM)
Citation
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin Rinard, and Mooly Sagiv. 2011. Data representation synthesis. SIGPLAN Not. 46, 6 (June 2011), 38-49.
Version
Author's final manuscript
Abstract
We consider the problem of specifying combinations of 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. We describe a language of decompositions that permit the user to specify different concrete representations for relations, and show that operations on concrete representations soundly implement their relational specification. It is easy to incorporate data representations synthesized by our compiler into existing systems, leading to code that is simpler, correct by construction, and comparable in performance to the code it replaces.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/1993498.1993504
