@inproceedings{4997f782e9e94509a491a39d2456d904,
title = "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.",
keywords = "composite data structures, synthesis",
author = "Peter Hawkins and Alex Aiken and Kathleen Fisher and Martin Rinard and Mooly Sagiv",
year = "2011",
doi = "https://doi.org/10.1145/1993498.1993504",
language = "الإنجليزيّة",
isbn = "9781450306638",
series = "Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)",
pages = "38--49",
booktitle = "PLDI'11 - Proceedings of the 2011 ACM Conference on Programming Language Design and Implementation",
note = "32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI'11 ; Conference date: 04-06-2011 Through 08-06-2011",
}