2012
DOI: 10.1145/2380656.2380677
|View full text |Cite
|
Sign up to set email alerts
|

An introduction to 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 permits the user to specify different concrete representations for relations, and show that operations on concrete representations soundly implement their relational specification. We also describe … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 21 publications
0
2
0
Order By: Relevance
“…Even if we ignore the run-time inefficiencies that this solution introduces, the programmer will have to maintain the collection on her own, and the common approaches do not provide any solution to the composition problem. [11], [17]. Composability of collections is closely coupled to evolvability, comprehensibility and modularity.…”
Section: Fig 1 the Linux Inodementioning
confidence: 99%
“…Even if we ignore the run-time inefficiencies that this solution introduces, the programmer will have to maintain the collection on her own, and the common approaches do not provide any solution to the composition problem. [11], [17]. Composability of collections is closely coupled to evolvability, comprehensibility and modularity.…”
Section: Fig 1 the Linux Inodementioning
confidence: 99%
“…For instance, Paige and Henglein [34] show the derivation of initial implementations of the ADT-based specification employing fix-point iterations, and later optimizing the implementation using finite differencing. Lately, in [35], Hawkins et al have applied the deductive synthesis to derive ADT-based implementations based on abstract relational descriptions for various database operations, e.g., query and update.…”
Section: ) Deductive Synthesis Of Security Propertiesmentioning
confidence: 99%