低水平双向外展
Low-Level Bi-Abduction
摘要:
本文提出了一种新的静态分析,旨在处理开放程序,即,程序片段,具有动态指针链接的数据结构-特别是各种列表-使用高级低级指针操作。我们的目标是允许这样的程序进行分析,而不需要编写分析工具,首先初始化正在处理的结构。该方法建立在一个特殊风味的分离逻辑和双溯因的方法。感兴趣的代码沿着调用树进行分析,从叶子开始,每个函数只分析一次,没有任何调用上下文,导致一组合同总结了分析函数的行为。为了处理所考虑的程序,溯因方法在文献中存在显着修改和扩展的文件。所提出的方法已在一个工具原型中实现,并成功地评估了不大,但复杂的程序。
英文摘要:
The paper proposes a new static analysis designed to handle open programs, i.e., fragments of programs, with dynamic pointer-linked data structures - in particular, various kinds of lists - that employ advanced low-level pointer operations. The goal is to allow such programs be analysed without a need of writing analysis harnesses that would first initialise the structures being handled. The approach builds on a special flavour of separation logic and the approach of bi-abduction. The code of interest is analyzed along the call tree, starting from its leaves, with each function analysed just once without any call context, leading to a set of contracts summarizing the behaviour of the analysed functions. In order to handle the considered programs, methods of abduction existing in the literature are significantly modified and extended in the paper. The proposed approach has been implemented in a tool prototype and successfully evaluated on not large but complex programs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。