arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1603.09597cs.PL
收藏

使用广义指向图的流和上下文相关指向分析

Flow- and Context-Sensitive Points-to Analysis using Generalized Points-to Graphs

Pritam M. Gharat, Uday P. Khedker, Alan Mycroft

摘要:

计算精确(完全流敏感和上下文敏感)和详尽的指向信息在计算上是昂贵的。许多实用的工具接近点到信息交易精度的效率。这对诸如模型检验之类的计算密集型分析具有不利影响。过去对完全流和上下文敏感的点分析(FCPA)的自上而下方法的探索尚未扩展。我们探讨了自底向上的过程间方法的替代构造摘要流函数的过程,以表示他们的调用的效果。这种方法已有效地用于许多分析。然而,对于FCPA来说,这在计算上是昂贵的,因为FCPA需要对通过指针间接访问的未知位置进行建模。这种访问通常通过使用占位符来解释未知位置或通过使用多个特定于调用的摘要流函数来处理。我们推广的概念,点到关系,通过使用间接级别的计数离开未知的位置隐含。这允许我们以广义指向图(GPG)的形式创建汇总流函数,而不需要占位符。通过设计,GPG表示内存(根据经典的点到事实)和内存Transformers(根据广义的点到事实)。我们通过逐步将广义的指向事实减少到经典的指向事实来执行FCPA。GPG区分可能和必须指针更新,从而促进调用上下文内的强更新。GPG的大小线性地受变量的数量限制,并且与过程中语句的数量无关。SPEC基准的经验测量表明,GPG确实是紧凑的,尽管大的程序大小。这使我们能够使用GPG将FCPA扩展到158 kLoC(与基于活跃度的FCPA报告的35 kLoC相比)。

英文摘要:

Computing precise (fully flow-sensitive and context-sensitive) and exhaustive points-to information is computationally expensive. Many practical tools approximate the points-to information trading precision for efficiency. This has adverse impact on computationally intensive analyses such as model checking. Past explorations in top-down approaches of fully flow- and context-sensitive points-to analysis (FCPA) have not scaled. We explore the alternative of bottom-up interprocedural approach which constructs summary flow functions for procedures to represent the effect of their calls. This approach has been effectively used for many analyses. However, it is computationally expensive for FCPA which requires modelling unknown locations accessed indirectly through pointers. Such accesses are commonly handled by using placeholders to explicate unknown locations or by using multiple call-specific summary flow functions. We generalize the concept of points-to relations by using the counts of indirection levels leaving the unknown locations implicit. This allows us to create summary flow functions in the form of generalized points-to graphs (GPGs) without the need of placeholders. By design, GPGs represent both memory (in terms of classical points-to facts) and memory transformers (in terms of generalized points-to facts). We perform FCPA by progressively reducing generalized points-to facts to classical points-to facts. GPGs distinguish between may and must pointer updates thereby facilitating strong updates within calling contexts. The size of GPG is linearly bounded by the number of variables and is independent of the number of statements in the procedure. Empirical measurements on SPEC benchmarks show that GPGs are indeed compact in spite of large procedure sizes. This allows us to scale FCPA to 158 kLoC using GPGs (compared to 35 kLoC reported by liveness-based FCPA).

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

↑