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 …

Kind 2 is an open-source, multi-engine, SMT-based model checker for safety properties of
finite-and infinite-state synchronous reactive systems. It takes as input models written in an …

This paper describes SMTCoq, a plug-in for the integration of external solvers into the Coq
proof assistant. Based on a checker for generic first-order proof certificates fully implemented …

Abstract Amazon Web Services (AWS) is a cloud computing services provider that has made
significant investments in applying formal methods to proving correctness of its internal …

Proof production for SMT solvers is paramount to ensure their correctness independently
from implementations, which are often prohibitively difficult to verify. Historically, however …

Interactive theorem provers (ITPs), such as Lean and Coq, can express formal proofs for a
large category of theorems, from abstract math to software correctness. Consider Alice who …

Matching logic is a logic for specifying and reasoning about structure by means of patterns
and pattern matching. This paper makes two contributions. First, it proposes a sound and …

Previous work on rewriting and reachability logic establishes a vision for a language-
agnostic program verifier, which takes three inputs: a program, its formal specification, and …

SMT solvers are at the basis of many applications, such as program verification, program
synthesis, and test case generation. For all these applications to provide reliable results …