We present cvc 4 sy, a syntax-guided synthesis (SyGuS) solver based on three bounded
term enumeration strategies. The first encodes term enumeration as an extension of the …

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 …

Program synthesis is the mechanised construction of software. One of the main difficulties is
the efficient exploration of the very large solution space, and tools often require a user …

This tutorial provides a programmer's introduction to the Satisfiability Modulo Theories
Solver Z3. It describes how to use Z3 through scripts, provided in the Python scripting …

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 …

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

In this paper we introduce a new approach for proving quantified theorems over inductively
defined data-types. We present an automated prover that searches for a sequence of …

The performance of modern Satisfiability Modulo Theories (SMT) solvers relies crucially on
efficient decision procedures as well as static simplification techniques, which include large …

This paper concerns the scalability challenges of symbolic abstraction: given a formula ϕ in
a logic L and an abstract domain A, find a most precise element in the abstract domain that …

This paper applies machine learning (ML) to solve quantified satisfiability modulo theories
(SMT) problems more efficiently. The motivating idea is that the solver should learn from …