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

形状分析的算术化

Arithmetizing Shape Analysis

Sebastian Wolff, Ekanshdeep Gupta, Zafer Esen, Hossein Hojjat, Philipp Rümmer, Thomas Wies

AI总结:

针对链式堆数据结构程序的内存安全验证难题,提出结合流抽象与视图抽象的归约方法,将内存安全证明转化为无堆程序证明,可借助现成工具验证多种链式结构的顺序及并发程序的内存安全性。

摘要:

内存安全性是软件系统的一项核心正确性属性。对于操作堆分配的链式数据结构的程序而言,证明内存安全性的问题可归结为分析数据结构的可能形状,这一研究方向催生了形状分析领域。本文提出了一种基于归约的新型内存安全分析方法,该方法依赖两种抽象形式:流抽象(flow abstraction),通过局部流方程表示堆图的全局属性;以及视图抽象(view abstraction),使验证工具能够对数量无界的堆对象进行符号化推理。两种抽象相结合,可将内存安全性证明归约为关于无堆命令式程序的证明,这类证明可使用现成的软件验证工具完成,无需工具内置堆推理支持。通过对广泛程序的实证评估,本文表明该归约方法能够有效验证操作各类链式数据结构的顺序与并发程序的内存安全性,涵盖单链表、双链表、嵌套链表以及树结构。

英文摘要:

Memory safety is an essential correctness property of software systems. For programs operating on linked heap-allocated data structures, the problem of proving memory safety boils down to analyzing the possible shapes of data structures, leading to the field of shape analysis. This paper presents a novel reduction-based approach to memory safety analysis that relies on two forms of abstraction: flow abstraction, representing global properties of the heap graph through local flow equations; and view abstraction, which enable verification tools to reason symbolically about an unbounded number of heap objects. In combination, the two abstractions make it possible to reduce memory-safety proofs to proofs about heap-less imperative programs that can be discharged using off-the-shelf software verification tools without built-in support for heap reasoning. Using an empirical evaluation on a broad range of programs, the paper shows that the reduction approach can effectively verify memory safety for sequential and concurrent programs operating on different kinds of linked data structures, including singly-linked, doubly-linked, and nested lists as well as trees.

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

↑