Abstract cvc5 is the latest SMT solver in the cooperating validity checker series and builds
on the successful code base of CVC4. This paper serves as a comprehensive system …

Formal methods applications often rely on SMT solvers to automatically discharge proof
obligations. SMT solvers handle quantified formulas using incomplete heuristic techniques …

SMT solvers have throughout the years been able to cope with increasingly expressive
formulas, from ground logics to full first-order logic (FOL). In contrast, the extension of SMT …

We propose SE2GIS, a novel inductive recursion synthesis approach with the ability to both
synthesize code and declare a problem unsolvable. SE2GIS combines a symbolic variant of …

We present a framework for processing formulas in automatic theorem provers, with
generation of detailed proofs. The main components are a generic contextual recursion …

This paper presents a symbolic method for automatic theorem generation based on
deductive inference. Many software verification and reasoning tasks require proving …

Many practical applications of satisfiability solving employ multiple steps to encode an
original problem formulation into conjunctive normal form. Often circuits are used as …

We present a fast and reliable reconstruction of proofs generated by the SMT solver veriT in
Isabelle. The fine-grained proof format makes the reconstruction simple and efficient. For …

Existing proof-generating quantified Boolean formula (QBF) solvers must construct a
different type of proof depending on whether the formula is false (refutation) or true …

SMT solvers generally tackle quantifiers by instantiating their variables with tuples of terms
from the ground part of the formula. Recent enumerative approaches for quantifier …