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

从验证运行中推导近似公差约束

Deriving approximation tolerance constraints from verification runs

Tobias Isenberg, Marie-Christine Jakobs, Felix Pauck, Heike Wehrheim

摘要:

近似计算(AC)是一种新兴的节能计算模式。AC的基本思想是通过允许仅执行"近似正确"计算的硬件来牺牲高精度以实现低能耗。对于软件验证,这对在近似硬件上运行的程序的验证结果的有效性提出了挑战。在本文中,我们提出了一种新的方法来检查程序的正确性,在近似计算的上下文中。与所有现有方法相比,我们从标准程序验证开始,并从该验证运行计算AC硬件的允许公差。更确切地说,我们得到一组约束条件,当满足AC硬件保证验证结果结转到AC。我们的方法是基于抽象解释的框架。在实践方面,我们进一步(1)展示了如何提取公差约束验证运行采用谓词抽象作为抽象解释的实例,以及(2)展示了如何检查这样的硬件设计上的约束。我们将我们的技术的例子C程序和一些最近提出的近似加法器。

英文摘要:

Approximate computing (AC) is an emerging paradigm for energy-efficient computation. The basic idea of AC is to sacrifice high precision for low energy by allowing for hardware which only carries out "approximately correct" calculations. For software verification, this challenges the validity of verification results for programs run on approximate hardware. In this paper, we present a novel approach to examine program correctness in the context of approximate computing. In contrast to all existing approaches, we start with a standard program verification and compute the allowed tolerances for AC hardware from that verification run. More precisely, we derive a set of constraints which - when met by the AC hardware - guarantees the verification result to carry over to AC. Our approach is based on the framework of abstract interpretation. On the practical side, we furthermore (1) show how to extract tolerance constraints from verification runs employing predicate abstraction as an instance of abstract interpretation, and (2) show how to check such constraints on hardware designs. We exemplify our technique on example C programs and a number of recently proposed approximate adders.

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

↑