L
Leonardo de Moura
Researcher at Microsoft
Publications - 96
Citations - 15247
Leonardo de Moura is an academic researcher from Microsoft. The author has contributed to research in topics: Satisfiability modulo theories & Automated theorem proving. The author has an hindex of 42, co-authored 95 publications receiving 13498 citations. Previous affiliations of Leonardo de Moura include Stanford University & SRI International.
Papers
More filters
BookDOI
Automated Deduction – CADE 26
TL;DR: This work in the Trustworthy Systems group at Data61 (formerly NICTA) in reasoning about concurrency in highassurance, high-performance software systems, in which concurrency may come from three different sources: multiple cores, interrupts and application-level interleaving.
Tractability and Modern Satisfiability Modulo Theories Solvers.
TL;DR: Tractability and Modern Satisfiability Modulo Theories Solvers page 3 1.1 Tractable and Modern satisfaction modulo theories Solvers pages 3 and 3.
Book ChapterDOI
Beyond first-order satisfaction: fixed points, interpolants, automata and polynomials
TL;DR: Four initiatives from Microsoft Research that build upon Z3 and move beyond first-order satisfaction are summarized.
Patent
Propagation of don't cares for efficient theory combination
TL;DR: In this paper, a relevancy propagation for efficient theory combination is described, and an efficient SMT solver dynamically applies relevance propagation to limit propagation of unnecessary constraints in a DPLL-based solver.
Posted Content
Sealing Pointer-Based Optimizations Behind Pure Functions
TL;DR: This work shows how to use dependent types to seal the necessary pointer-address manipulations behind pure functional interfaces while requiring only a negligible amount of additional trust.