Data structure fusion

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 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 indexes specifies where the underlying physical data structure representation has sharing. We permit the user to specify different concrete shared representations for relations, and show that the semantics of the relational specification are preserved.

Original languageEnglish
Title of host publicationProgramming Languages and Systems - 8th Asian Symposium, APLAS 2010, Proceedings
Pages204-221
Number of pages18
DOIs
StatePublished - 2010
Event8th Asian Symposium on Programming Languages and Systems, APLAS 2010 - Shanghai, China
Duration: 28 Nov 20101 Dec 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6461 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th Asian Symposium on Programming Languages and Systems, APLAS 2010
Country/TerritoryChina
CityShanghai
Period28/11/101/12/10

Fingerprint

Dive into the research topics of 'Data structure fusion'. Together they form a unique fingerprint.

Cite this