.png){kind=icon}
返回
Memory efficient context-sensitive program analysis
.png){kind=icon}
OA
AI
DOI：10.1016/j.jss.2021.110952.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Static program analysis is in general more precise if it is sensitive to execution contexts (execution paths). But then it is also more expensive in terms of memory consumption. For languages with conditions and iterations, the number of contexts grows exponentially with the program size. This problem is not just a theoretical issue. Several papers evaluating inter-procedural context-sensitive data-flow analysis report severe memory problems, and the path-explosion problem is a major issue in program verification and model checking. In this paper we propose chi-terms as a means to capture and manipulate context-sensitive program information in a data-flow analysis. chi-terms are implemented as directed acyclic graphs without any redundant subgraphs. To show the efficiency of our approach we run experiments comparing the memory usage of x -terms with four alternative data structures. Our experiments show that x-terms clearly outperform all the alternatives in terms of memory efficiency. (C) 2021 Elsevier Inc. All rights reserved.
Keyword:
Static program analysis
Data-flow analysis
Context-sensitivity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
5.4K
被引数:
8.4K
机构
引用论文
Evaluating the Benefits of Context-Sensitive Points-to Analysis Using a BDD-Based Implementation
PREAI
分享收藏Functional connectivity among brain networks in continuous feedback of finger force.png)
Neuroscience
NeuroscienceIF0
PREAI
分享收藏Widespread dissemination of gelfoam particles complicating occlusion of renal circulationUrology
UrologyIF0
PREAI
分享收藏
查看更多内容