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 …

Many compilers, synthesizers, and theorem provers rely on rewrite rules to simplify
expressions or prove equivalences. Develo** rewrite rules can be difficult: rules may be …

Abstract Semantics-Guided Synthesis (SemGuS) is a programmable framework for defining
synthesis problems in a domain-and solver-agnostic way. This paper presents the …

This paper presents MachSMT, an algorithm selection tool for Satisfiability Modulo Theories
(SMT) solvers. MachSMT supports the entirety of the SMT-LIB language and standardized …

Ensuring the equality of SMT solvers is critical due to its broad spectrum of applications in
academia and industry, such as symbolic execution and program verification. Existing …

Satisfiability Modulo Theories (SMT) solvers serve as the core engine of many techniques,
such as symbolic execution. Therefore, ensuring the robustness and correctness of SMT …

We present an ef cient approach to learn past-time linear temporal logic formulas (PLTL)
from a set of propositional variables and a sample of nite traces over those variables. The ef …

Rewrite rules are critical in equality saturation, an increasingly popular technique in
optimizing compilers, synthesizers, and verifiers. Unfortunately, develo** high-quality …

Embedded applications extract the best power-performance trade-off from digital signal
processors (DSPs) by making extensive use of vectorized execution. Rather than …

Many SMT solvers implement efficient SAT-based procedures for solving fixed-size bit-
vector formulas. These approaches, however, cannot be used directly to reason about bit …