arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.12985cs.SEcs.LO
收藏

浅探C程序非终止性检查的深度

A shallow dive into the depths of non-termination checking for C programs

Ravindra Metta, Hrishikesh Karmarkar, Kumar Madhukar, R Venkatesh, Supratik Chakraborty, Samarjit Chakraborty

AI总结:

针对现有非终止性检查工具在现实程序上效果不佳的问题,提出一种基于有界模型检查的健全高效技术,通过循环内断言与迭代展开深度检查循环状态,实验表明优于现有工具。

摘要:

检查给定程序P的非终止性(NT),即确定P是否至少存在一次非终止运行,是一个不可判定问题,持续吸引着大量研究关注。尽管非预期非终止在现实世界软件开发中很常见,但即使是性能最好的非终止性检查工具,在处理现实世界程序时也往往效果不佳,有时甚至因不切实际的假设(如不存在溢出)而产生错误结果。为解决这一问题,我们提出了一种健全且高效的非终止性检查技术,该技术对现实世界软件同样有效。给定P,我们将非终止性属性编码为P中每个循环内部的一个断言,以检查该循环中的循环状态,直至固定的展开深度,并使用有界模型检查器进行验证。展开深度会迭代增加,直到发现非终止性或达到预设上限。我们在广泛多样的软件基准上的实验表明,该技术优于最先进的非终止性检查器。

英文摘要:

Checking for Non-Termination (NT) of a given program P, i.e., determining if P has at least one non-terminating run, is an undecidable problem that continues to garner significant research attention. While unintended NT is common in real-world software development, even the best-performing tools for NT checking are often ineffective on real-world programs and sometimes incorrect due to unrealistic assumptions such as absence of overflows. To address this, we propose a sound and efficient technique for NT checking that is also effective on realworld software. Given P, we encode the NT property as an assertion inside each loop of P to check for recurrent states in that loop, up to a fixed unwinding depth, using a Bounded Model Checker. The unwinding depth is increased iteratively until either NT is found or a predefined limit is reached. Our experiments on wide ranging software benchmarks show that the technique outperforms state-of-the-art NT checkers

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

↑