HoCHC: A refutationally complete and semantically invariant system of higher-order logic modulo theories

CHL Ong, D Wagner - … 34th Annual ACM/IEEE Symposium on …, 2019 - ieeexplore.ieee.org
We present a simple resolution proof system for higher-order constrained Horn clauses
(HoCHC)-a system of higher-order logic modulo theories-and prove its soundness and …

[PDF][PDF] Автоматический вывод реляционных инвариантов для нелинейных систем дизъюнктов Хорна с ограничениями

ДА Мордвинов - 2020 - iis.nsk.su
Актуальность темы. В условиях современного мира, когда компьютеры управляют
многочисленными критически важными аспектами жизни челове ка, доказательство …

Reducing Higher-order Recursion Scheme Equivalence to Coinductive Higher-order Constrained Horn Clauses

J Jochems - arXiv preprint arXiv:2109.04632, 2021 - arxiv.org
Higher-order constrained Horn clauses (HoCHC) are a semantically-invariant system of
higher-order logic modulo theories. With semi-decidable unsolvability over a semi-decidable …

Higher-order constrained Horn clauses for higher-order program verification

J Jochems - 2020 - ora.ox.ac.uk
Higher-order constrained Horn clauses (HoCHC) are a fragment of higher-order logic
modulo theories recently introduced by Cathcart Burn et al.(2018). This thesis explores the …

[PDF][PDF] Resolution for Higher-Order Constrained Horn Clauses

D Wagner - 2018 - cs.ox.ac.uk
In this work we continue the investigation into the algorithmic and model theoretic properties
of higher-order constrained Horn clauses, a fragment of higher-order logic with background …