arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1107.5980cs.LO
收藏

基于整数单调性约束的SAT终止性分析

SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers

Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl

摘要:

我们描述了一个算法证明终止的程序抽象到系统的单调性约束的整数域。单调性约束是著名的尺寸变化终止方法的非平凡扩展。虽然决定终止系统的单调性约束是PSPACE完成的,我们专注于一个定义良好的和重要的子集,我们称之为MCNP,旨在服从SAT为基础的解决方案。我们的技术是基于搜索一种特殊类型的排名功能定义的整数值的多集之间的有界差异。我们描述了应用我们的方法作为后端的Java字节码(JBC)的终止分析。在前端,系统的单调性约束,通过抽象的信息,使用两个不同的终止分析:AProVE和COSTA。初步结果表明,我们的方法提供了一个很好的权衡精度和成本的分析。

英文摘要:

We describe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension of the well-known size-change termination method. While deciding termination for systems of monotonicity constraints is PSPACE complete, we focus on a well-defined and significant subset, which we call MCNP, designed to be amenable to a SAT-based solution. Our technique is based on the search for a special type of ranking function defined in terms of bounded differences between multisets of integer values. We describe the application of our approach as the back-end for the termination analysis of Java Bytecode (JBC). At the front-end, systems of monotonicity constraints are obtained by abstracting information, using two different termination analyzers: AProVE and COSTA. Preliminary results reveal that our approach provides a good trade-off between precision and cost of analysis.

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

↑