Data representation synthesis

Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin Rinard, Mooly Sagiv

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationPLDI'11 - Proceedings of the 2011 ACM Conference on Programming Language Design and Implementation
Pages38-49
Number of pages12
DOIs
StatePublished - 2011
Event32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI'11 - San Jose, CA, United States
Duration: 4 Jun 20118 Jun 2011

Publication series

NameProceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Conference

Conference32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI'11
Country/TerritoryUnited States
CitySan Jose, CA
Period4/06/118/06/11

Keywords

  • composite data structures
  • synthesis

Fingerprint

Dive into the research topics of 'Data representation synthesis'. Together they form a unique fingerprint.

Cite this