arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0810.0753cs.PL
收藏

类C语言指向分析的定义与实现

Definition and Implementation of a Points-To Analysis for C-like Languages

Stefano Soffia

摘要:

指向问题是确定指针变量可能的运行时目标的问题,通常被认为是更一般的别名问题的一部分,其中包括确定不同表达式是否以及何时可以引用相同的内存地址。别名信息对于每一个需要推理程序语义的工具来说都是必不可少的。然而,由于众所周知的不可判定性结果,对于所有有趣的语言,承认别名,非平凡的别名问题的精确解通常是不可计算的。这项工作的重点是近似的解决方案,这个问题提出了一个基于存储,流量敏感点的分析,在自动化软件验证领域的应用。相反,软件测试程序,其中,对有限的执行集的验证性检查程序,在这项工作中考虑的方法是静态分析,其中的计算结果是有效的所有可能的执行的分析程序。我们提出了一种简化的程序设计语言及其执行模型,然后利用抽象解释理论的思想建立了一个近似的执行模型。最后,形式化地证明了近似的可靠性。发展一个现实的点,以分析的目的是追求提出一些扩展的初始简化模型,并讨论其制定的正确性。这项工作包含原始贡献的问题的点分析,因为它提供了一个配方的过滤器操作的点抽象域和正式证明的合理性定义的抽象操作:这些,就我们现在而言,缺乏从以前的文献。

英文摘要:

The points-to problem is the problem of determining the possible run-time targets of pointer variables and is usually considered part of the more general aliasing problem, which consists in establishing whether and when different expressions can refer to the same memory address. Aliasing information is essential to every tool that needs to reason about the semantics of programs. However, due to well-known undecidability results, for all interesting languages that admit aliasing, the exact solution of nontrivial aliasing problems is not generally computable. This work focuses on approximated solutions to this problem by presenting a store-based, flow-sensitive points-to analysis, for applications in the field of automated software verification. In contrast to software testing procedures, which heuristically check the program against a finite set of executions, the methods considered in this work are static analyses, where the computed results are valid for all the possible executions of the analyzed program. We present a simplified programming language and its execution model; then an approximated execution model is developed using the ideas of abstract interpretation theory. Finally, the soundness of the approximation is formally proved. The aim of developing a realistic points-to analysis is pursued by presenting some extensions to the initial simplified model and discussing the correctness of their formulation. This work contains original contributions to the issue of points-to analysis, as it provides a formulation of a filter operation on the points-to abstract domain and a formal proof of the soundness of the defined abstract operations: these, as far as we now, are lacking from the previous literature.

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

↑