Higher-order Program Verification as Satisfiability Modulo Theories with Algebraic Data-types
Higher-order Program Verification as Satisfiability Modulo Theories with Algebraic Data-types
复制标题
作为具有代数数据类型的可满足性模理论的高阶程序验证
DOI：
--
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
A. Rybalchenko
中科院分区：
文献类型：
--
作者：
Nikolaj S. Bjørner;K. McMillan;A. Rybalchenko
我们报告了用于证明用高阶函数语言编写的程序的属性的自动过程的进展情况。我们的方法将高阶程序直接编码为 Horn 子句上的一阶 SMT 问题。将一阶程序的霍尔式验证简化为霍恩子句的可满足性是直接的。闭包的存在带来了几个挑战：相对完整的证明系统必须考虑闭包；在实践中，搜索过程的有效性取决于编码策略和底层求解器的能力。 We here use algebraic data-types to encode closures and rely on solvers that support algebraic data-types.使用高阶程序验证文献中的示例来检验该方法的可行性。
We report on work in progress on automatic procedures for proving properties of programs written in higher-order functional languages. Our approach encodes higher-order programs directly as first-order SMT problems over Horn clauses. It is straight-forward to reduce Hoare-style verification of first-order programs into satisfiability of Horn clauses. The presence of closures offers several challenges: relatively complete proof systems have to account for closures; and in practice, the effectiveness of search procedures depend on encoding strategies and capabilities of underlying solvers. We here use algebraic data-types to encode closures and rely on solvers that support algebraic data-types. The viability of the approach is examined using examples from the literature on higher-order program verification.
解决存在量化的喇叭子句
DOI：
10.1007/978-3-642-39799-8_61
发表时间：
2013
期刊：
影响因子：
--
作者：
Tewodros A. Beyene;Corneliu Popeea;Andrey Rybalchenko
通讯作者：
Andrey Rybalchenko