Higher-order constrained horn clauses for verification
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 h...
Main Authors: | Cathcart Burn, T, Ong, C, Ramsay, S |
---|---|
格式: | Journal article |
语言: | English |
出版: |
Association for Computing Machinery
2017
|
相似书籍
-
Higher-order constrained Horn clauses for higher-order program verification
由: Jochems, J
出版: (2020) -
Initial limit Datalog: a new extensible class of decidable constrained Horn clauses
由: Cathcart Burn, T, et al.
出版: (2021) -
Decomposition by tree dimension in Horn clause verification
由: Bishoksan Kafle, et al.
出版: (2015-12-01) -
Solving Constrained Horn Clauses Using Dependence-Disjoint Expansions
由: Qi Zhou, et al.
出版: (2018-09-01) -
Removing Unnecessary Variables from Horn Clause Verification Conditions
由: Emanuele De Angelis, et al.
出版: (2016-07-01)