.png){kind=icon}
返回
A framework to capture dynamic data structures in pointer-based codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2004.1264798.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
To successfully exploit all the possibilities of current computer/multicomputer architectures, optimization compiling techniques are a must. However, for codes based on pointers. and dynamic data structures, these optimization techniques have to be necessarily Carried out after identifying the characteristics and properties of the data structure used in the code. In this paper, we describe the framework and the analyzer we have implemented to capture complex data structures generated, traversed, and modified in codes based on pointers. Our method assigns a Reduced Set of Reference Shape Graph (RSRSG) to each statement to approximate the shape,of the data structure after the execution of such a statement. With the properties and operations that define the behavior of our RSRSG, the method can accurately detect complex recursive data structures such as a doubly linked list of pointers to trees where the leaves point to additional lists. Several experiments are carried out with real codes to validate the capabilities of our analyzer.
Keyword:
shape analysis
pointers
recursive data structures
shape graphs
optimizing compiler
irregular codes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
Lung cancer screening by spiral CT. What is the optimal target population for screening trials?.png)
Lung Cancer
Lung CancerIF0
PREAI
分享收藏
查看更多内容