Higher-order constrained horn clauses for verification

Higher-order constrained horn clauses for verification
复制标题

用于验证的高阶约束喇叭子句

DOI:
10.1145/3158099
复制
发表时间:
2017
影响因子:
--
通讯作者:
Cathcart Burn T
Cathcart Burn T
中科院分区:
--
文献类型:
--
作者:
Cathcart Burn T

文献摘要

参考文献

被引文献

相似文献

出于高阶函数程序自动验证中的应用,我们开发了一个概念的约束霍恩条款在高阶逻辑和决策问题,其可满足性。我们表明,尽管高阶子句的可满足系统通常不具有最少模型,但存在通过约化到一类单调逻辑程序问题而获得的规范模型的概念。在高阶程序验证的工作之后,我们开发了一个细化类型的系统,以推理和自动搜索模型。这为解决决策问题提供了一个合理但不完整的方法。最后,我们表明,有一种意义上,我们可以使用细化类型来表达属性的条款,同时留在高阶约束霍恩子句框架。
Motivated by applications in automated verification of higher-order functional programs, we develop a notion of constrained Horn clauses in higher-order logic and a decision problem concerning their satisfiability. We show that, although satisfiable systems of higher-order clauses do not generally have least models, there is a notion of canonical model obtained through a reduction to a problem concerning a kind of monotone logic program. Following work in higher-order program verification, we develop a refinement type system in order to reason about and automate the search for models. This provides a sound but incomplete method for solving the decision problem. Finally, we show that there is a sense in which we can use refinement types to express properties of terms whilst staying within the higher-order constrained Horn clause framework.
作为具有代数数据类型的可满足性模理论的高阶程序验证
DOI: --
发表时间: 2013
期刊: arXiv.org
影响因子: --
作者:
Nikolaj S. Bjørner;K. McMillan;A. Rybalchenko
通讯作者: A. Rybalchenko
HMC:使用抽象解释器验证功能程序
DOI: --
发表时间: 2010
期刊: International Conference on Computer Aided Verification
影响因子: --
作者:
Ranjit Jhala;R. Majumdar;A. Rybalchenko
通讯作者: A. Rybalchenko
DOI: 10.1109/lics.2009.29
发表时间: 2009-08
期刊: 2009 24th Annual IEEE Symposium on Logic In Computer Science
影响因子: --
作者:
N. Kobayashi;C. Ong
通讯作者: N. Kobayashi;C. Ong
控制流分析和类型系统
DOI: --
发表时间: 1995
期刊: Sensors Applications Symposium
影响因子: --
作者:
N. Heintze
通讯作者: N. Heintze
DOI: 10.1145/2429069.2429081
发表时间: 2013-01
期刊: --
影响因子: --
作者:
Hiroshi Unno;Tachio Terauchi;N. Kobayashi
通讯作者: Hiroshi Unno;Tachio Terauchi;N. Kobayashi