This paper surveys recent work on applying analysis and transformation techniques that
originate in the field of constraint logic programming (CLP) to the problem of verifying …

Reduction to satisfiability of constrained Horn clauses (CHCs) is a widely studied approach
to automated program verification. Current CHC-based methods, however, do not work very …

The constrained Horn clause satisfiability problem is at the core of many automated
verification methods, and Spacer is one of the most efficient solvers of this problem. The …

This paper presents a novel program verification method based on Mu-Arithmetic, a first-
order logic with integer arithmetic and predicate-level least/greatest fixpoints. We first show …

There are two kinds of higher-order extensions of model checking: HORS model checking
and HFL model checking. Whilst the former has been applied to automated verification of …

Existing approaches to temporal verification of higher-order functional programs have either
sacrificed compositionality in favor of achieving automation or vice-versa. In this paper we …

Incremental computation has recently been studied using the concepts of change structures
and derivatives of programs, where the derivative of a function allows updating the output of …

We establish proof-theoretic, constructive and coalgebraic foundations for proof search in
coinductive Horn clause theories. Operational semantics of coinductive Horn clause …

We introduce a method for proving almost sure termination in the context of lambda calculus
with continuous random sampling and explicit recursion, based on ranking …

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 …