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

While model checking safety of infinite-state systems by inferring state invariants has
steadily improved recently, most verification tools still rely on a technique based on bounded …

Transition Power Abstraction (TPA) is a recent symbolic model checking approach that
leverages Craig interpolation to create a sequence of symbolic abstractions for transition …

Abstract We present Counterexample-Guided Accelerated Abstraction Refinement
(CEGAAR), a new algorithm for verifying infinite-state transition systems. CEGAAR combines …

Proving equivalence of programs has several important applications, including algorithm
recognition, regression checking, compiler optimization verification and validation, and …

Craig interpolation is a standard method to construct and refine abstractions in model
checking. To obtain abstractions that are suitable for the verification of software programs or …

Abstract Constrained Horn Clauses (CHCs) are often used in automated program
verification. Thus, techniques for (dis-) proving satisfiability of CHCs are a very active field of …

Craig Interpolation is a standard method to construct and refine abstractions in model
checking. To obtain abstractions that are suitable for the verification of software programs or …

We propose a novel lazy bounded model checking (BMC) algorithm, Trace Inlining, that
identifies relevant behaviors of the program to compute partial proofs as procedural …

For some classes of guarded ground assignments for arrays, we show that accelerations (ie
transitive closures) are definable in the theory of arrays via∃*∀*-first order formulae. We …