arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.07923cs.PLcs.SE
收藏

高效的路径敏感数据依赖分析

Efficient Path-Sensitive Data-Dependence Analysis

Peisen Yao, Jinguo Zhou, Xiao Xiao, Qingkai Shi, Rongxin Wu, Charles Zhang

摘要:

本文提出了一种可扩展的路径和上下文敏感的数据依赖分析。关键是通过稀疏的、需求驱动的和融合的方法来解决别名路径爆炸问题,该方法将指针信息的计算与数据依赖的解决方案相结合。具体来说,我们的方法分解的析取推理的计算工作分为1)上下文和半路径敏感的分析,简明扼要地总结数据依赖的符号和storeless值流图,和2)需求驱动的阶段,解决了传递数据依赖的图形。我们已经将该方法应用于两个客户端,即薄切片和价值流分析。使用一套16个程序,范围从13 KLoC到8 MLoC,我们将我们的技术与一组不同的最先进的分析进行比较,说明了我们的方法的显著精度和可扩展性优势。

英文摘要:

This paper presents a scalable path- and context-sensitive data-dependence analysis. The key is to address the aliasing-path-explosion problem via a sparse, demand-driven, and fused approach that piggybacks the computation of pointer information with the resolution of data dependence. Specifically, our approach decomposes the computational efforts of disjunctive reasoning into 1) a context- and semi-path-sensitive analysis that concisely summarizes data dependence as the symbolic and storeless value-flow graphs, and 2) a demand-driven phase that resolves transitive data dependence over the graphs. We have applied the approach to two clients, namely thin slicing and value flow analysis. Using a suite of 16 programs ranging from 13 KLoC to 8 MLoC, we compare our techniques against a diverse group of state-of-the-art analyses, illustrating significant precision and scalability advantages of our approach.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑