In this paper, we present SeaHorn, a software verification framework. The key distinguishing
feature of SeaHorn is its modular design that separates the concerns of the syntax of the …

Automatic program verification and symbolic model checking tools interface with theorem
proving technologies that check satisfiability of formulas. A theme pursued in the past years …

This paper presents the ELDARICA version 2 model checker. Over the last years we have
been develo** and maintaining ELDARICA as a state-of-the-art solver for Horn clauses …

Regression verification is an approach complementing regression testing with formal
verification. The goal is to formally prove that two versions of a program behave either …

We present a data-driven technique to solve Constrained Horn Clauses (CHCs) that encode
verification conditions of programs containing unconstrained loops and recursions. Our CHC …

Program proving can be viewed as solving for unknown relations (such as loop invariants,
procedure summaries and so on) that occur in the logical verification conditions of a …

Building a competitive program verifiers is becoming cheaper. On the front-end side, openly
available compiler infrastructure and optimization frameworks take care of hairy problems …

Satisfiability modulo theory solvers are increasingly being used to solve quantified formulas
over structures such as integers and term algebras. Quantifier instantiation combined with …

We present version 1.0 of the Norn SMT solver for string constraints. Norn is a solver for an
expressive constraint language, including word equations, length constraints, and regular …

Verification problems of programs in various paradigms can be reduced to problems of
solving Horn clause constraints on predicate variables that represent unknown inductive …