Data representation synthesis

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.

DOI: 10.1145/1993498.1993504
View Slides

Extracted Key Phrases

05102011201220132014201520162017
Citations per Year

69 Citations

Semantic Scholar estimates that this publication has 69 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Hawkins2011DataRS, title={Data representation synthesis}, author={Peter Hawkins and Alexander Aiken and Kathleen Fisher and Martin C. Rinard and Shmuel Sagiv}, booktitle={PLDI}, year={2011} }