.png){kind=icon}
返回
An Introduction to Data Representation Synthesis
.png){kind=icon}
OA
AI
DOI：10.1145/2380656.2380677.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is 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 an auto-tuner that automatically identifies the best decomposition for a particular workload. 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.
Keyword:
SHAPE-ANALYSIS
VERIFICATION
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12.2
论文数:
1.2W
被引数:
3.7W
机构
引用论文
A novel hybrid pelican-particle swarm optimization algorithm (HPPSO) for global optimization problem
PREAI
分享收藏Neutrophil derived LTB4 induces macrophage aggregation in response to encapsulated Streptococcus iniae infection.png)
PLOS ONEOAAI
PLOS ONEIF0
OAAI分享收藏Comparison of the Early Permian vertebrate faunas of the Four Corners region and north-central Texas
OAAI
OAAI分享收藏
查看更多内容