Reachability Logic for Low-Level Programs
Reachability Logic for Low-Level Programs
复制标题
低级程序的可达性逻辑
DOI：
10.48550/arxiv.2204.00076
复制
发表时间：
2022
期刊：
影响因子：
--
通讯作者：
B. Ravindran
中科院分区：
文献类型：
--
作者：
N. Naus;Freek Verbeek;Marc Schoolderman;B. Ravindran
自动漏洞利用生成是一个相对较新的研究领域。这一领域的工作旨在自动执行查找软件漏洞的手动和劳动密集型任务。在本文中，我们提出了一种新的程序逻辑，以支持自动利用生成。我们开发了一个程序逻辑称为可达性逻辑，它正式定义了可达性之间的关系的断言和允许它们发生的先决条件。然后，这个关系被用来计算前提条件的搜索空间。我们表明，可达性逻辑是一个强大的工具，在自动寻找证据，断言是可达的。我们验证了该系统适用于小石蕊测试，以及现实世界的算法。一个实现已经开发出来，整个系统被证明是健全的和完整的定理证明。这项工作是迈向正式验证的自动利用生成的重要一步。
Automatic exploit generation is a relatively new area of research. Work in this area aims to automate the manual and labor intensive task of finding exploits in software. In this paper we present a novel program logic to support automatic exploit generation. We develop a program logic called Reachability Logic, which formally defines the relation between reachability of an assertion and the preconditions which allow them to occur. This relation is then used to calculate the search space of preconditions. We show that Reachability Logic is a powerful tool in automatically finding evidence that an assertion is reachable. We verify that the system works for small litmus tests, as well as real-world algorithms. An implementation has been developed, and the entire system is proven to be sound and complete in a theorem prover. This work represents an important step towards formally verified automatic exploit generation.
影响因子：
3.5
作者：
Anand, Saswat;Burke, Edmund K.;Zhu, Hong
通讯作者：
Zhu, Hong