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 …

Abstract Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …

Inductive invariants can be robustly synthesized using a learning model where the teacher is
a program verifier who instructs the learner through concrete program configurations …

We introduce the first program synthesis engine implemented inside an SMT solver. We
present an approach that extracts solution functions from unsatisfiability proofs of the …

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

Applications in artificial intelligence, formal verification, and other areas have greatly
benefited from the recent advances in SAT. It is often the case, however, that applications in …

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 …

SMT solvers have been used successfully as reasoning engines for automated verification.
Current techniques for dealing with quantified formulas in SMT are generally incomplete …

Modern web applications serve large amounts of sensitive user data, access to which is
typically governed by data-access policies. Enforcing such policies is crucial to preventing …

Efficient reasoning about strings is essential to a growing number of security and verification
applications. We describe satisfiability checking techniques in an extended theory of strings …