具有有序数据的双溯因问题
Bi-Abduction for Shapes with Ordered Data
摘要:
形状分析对于验证堆操作程序的正确性和内存安全性具有重要意义,但这类分析已被证明是非常困难的问题。将分离逻辑集成到形状分析中提高了技术的有效性,但在这一领域最重要的进步是双溯推理。通过分离逻辑,双溯因-溯因推理和框架推理的组合-是组合推理的关键使能器,有助于显著地扩展验证。事实上,双向绑架的成功导致了Infer的发展,该工具每天用于验证Facebook数百万行代码的代码库。然而,这种成功目前主要停留在形状领域。为了扩展这种影响的形状和算术域的组合,在这项工作中,我们提出了一种新的一级双溯过程的组合的数据结构和排序值。该程序的设计精神的展开和匹配的范例,推理是用来推导任何不匹配的部分。我们还实现了一个原型求解器,基于Cyclist库,并展示了它的能力在一系列的基准从SL-COMP竞争。实验结果表明,我们的建议表明,规范推理的自动验证堆操作程序的承诺。
英文摘要:
Shape analysis is of great importance for the verification of the correctness and memory-safety of heap-manipulating programs, yet such analyses have been shown to be highly difficult problems. The integration of separation logic into shape analyses has improved the effectiveness of the techniques, but the most significant advancement in this area is bi-abductive inference. Enabled by separation logic, bi-abduction - a combination of abductive inference and frame inference - is the key enabler for compositional reasoning, helping to scale up verification significantly. Indeed, the success of bi-abduction has led to the development of Infer, the tool used daily to verify Facebook's codebase of millions of lines of code. However, this success currently stays largely within the shape domain. To extend this impact towards the combination of shape and arithmetic domains, in this work, we present a novel one-stage bi-abductive procedure for a combination of data structures and ordering values. The procedure is designed in the spirit of the Unfold-and-Match paradigm where the inference is utilized to derive any mismatched portion. We have also implemented a prototype solver, based on the Cyclist library, and demonstrate its capabilities over a range of benchmarks from the SL-COMP competition. The experimental results show that our proposal shows promise for the specification inference in an automated verification of heap-manipulating programs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。