Showing papers by "Leonardo de Moura published in 2014"
21 Oct 2014
TL;DR: The experimental results show that the technique significantly reduces the number of instantiations required by an SMT solver to answer "unsatisfiable" for several benchmark libraries, and consequently leads to improvements over state-of-the-art implementations.
Abstract: In the past decade, Satisfiability Modulo Theories (SMT) solvers have been used successfully in a variety of applications including verification, automated theorem proving, and synthesis. While such solvers are highly adept at handling ground constraints in several decidable background theories, they primarily rely on heuristic quantifier instantiation methods such as E-matching to process quantified formulas. The success of these methods is often hindered by an overproduction of instantiations which makes ground level reasoning difficult. We introduce a new technique that alleviates this shortcoming by first discovering instantiations that are in conflict with the current state of the solver. The solver only resorts to traditional heuristic methods when such instantiations cannot be found, thus decreasing its dependence upon E-matching. Our experimental results show that our technique significantly reduces the number of instantiations required by an SMT solver to answer "unsatisfiable" for several benchmark libraries, and consequently leads to improvements over state-of-the-art implementations.
60 citations
18 Jul 2014
TL;DR: Satisfiability Modulo Theories (SMT) solvers check the satisfiability of first-order formulas written in a language containing interpreted predicates and functions as mentioned in this paper, where interpreted symbols can be defined either by firstorder axioms (e.g. the axiom of equality, or array axiom for operators read and write,... ) or by a structure, such as the integer numbers equipped with constants, addition, equality, and inequalities.
Abstract: Satisfiability Modulo Theories (SMT) solvers check the satisfiability of firstorder formulas written in a language containing interpreted predicates and functions. These interpreted symbols are defined either by first-order axioms (e.g. the axioms of equality, or array axioms for operators read and write,. . . ) or by a structure (e.g. the integer numbers equipped with constants, addition, equality, and inequalities). Theories frequently implemented within SMT solvers include the empty theory (a.k.a. the theory of uninterpreted symbols with equality), linear arithmetic on integers and/or reals, bit-vectors, and the theory of arrays. A very small example of an input formula for an SMT solver is
22 citations
01 Jan 2014
TL;DR: Tractability and Modern Satisfiability Modulo Theories Solvers page 3 1.1 Tractable and Modern satisfaction modulo theories Solvers pages 3 and 3.
Abstract: 1 Tractability and Modern Satisfiability Modulo Theories Solvers page 3 1.
2 citations