Data structure fusion
We consider the problem of specifying 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; a novel fuse operation on relational indexe...
Main Authors: | Hawkins, Peter, Aiken, Alex, Fisher, Kathleen, Rinard, Martin C., Sagiv, Mooly |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Asian Association for Foundation of Software
2011
|
Online Access: | http://hdl.handle.net/1721.1/63114 https://orcid.org/0000-0001-8095-8523 |
Similar Items
-
Data representation synthesis
by: Hawkins, Peter, et al.
Published: (2012) -
Concurrent data representation synthesis
by: Hawkins, Peter, et al.
Published: (2012) -
An introduction to data representation synthesis
by: Hawkins, Peter, et al.
Published: (2020) -
Text and structured data fusion in data tamer at scale
by: Gubanov, Michael, et al.
Published: (2014) -
Automatic Detection and Repair of Errors in Data Structures
by: Demsky, Brian, et al.
Published: (2023)