Patents by Inventor Leonardo Mendonca de Moura

Leonardo Mendonca de Moura has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Matching based pattern inference for SMT solvers
    Patent number: 9489221
    Abstract: A method for automatically analyzing formulas and adding pattern annotations to quantifiers based on a database of common pattern idioms. The method involves matching base pattern inference for Satisfiability Modulo Theories (SMT) solvers. The method uses a database for fault detection in externally supplied pattern annotated formulas. The method also uses matching code trees to mixed second-order pattern matching.
    Type: Grant
    Filed: June 25, 2008
    Date of Patent: November 8, 2016
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Nikolaj S. Bjorner, Leonardo Mendonca de Moura
  • Relevancy propagation for efficient theory combination
    Patent number: 8140459
    Abstract: Relevancy propagation for efficient theory combination is described. In one implementation, an efficient SMT solver dynamically applies relevancy propagation to limit propagation of unnecessary constraints in a DPLL-based solver. This provides a drastic increase in speed and performance over conventional DPLL-based solvers. The relevancy propagation is guided by relevancy rules, which in one implementation emulate Tableau rules for limiting constraint propagation, while maintaining the performance of efficient DPLL-based solvers. An exemplary solver propagates truth assignments to constraints of a formula, and tracks which truth assignments are relevant for determining satisfiability of the formula. The solver propagates truth assignments that were marked relevant to a theory solver, while avoiding propagation of irrelevant truth assignments.
    Type: Grant
    Filed: February 21, 2008
    Date of Patent: March 20, 2012
    Assignee: Microsoft Corporation
    Inventors: Nikolaj Bjorner, Leonardo Mendonca de Moura
  • Matching Based Pattern Inference for SMT Solvers
    Publication number: 20090328015
    Abstract: A method for automatically analyzing formulas and adding pattern annotations to quantifiers based on a database of common pattern idioms. The method involves matching base pattern inference for Satisfiability Modulo Theories (SMT) solvers. The method uses a database for fault detection in externally supplied pattern annotated formulas. The method also uses matching code trees to mixed second-order pattern matching.
    Type: Application
    Filed: June 25, 2008
    Publication date: December 31, 2009
    Applicant: Microsoft Corporation
    Inventors: Nikolaj S. Bjorner, Leonardo Mendonca de Moura
  • Propagation of don't cares for efficient theory combination
    Publication number: 20090216701
    Abstract: Relevancy propagation for efficient theory combination is described. In one implementation, an efficient SMT solver dynamically applies relevancy propagation to limit propagation of unnecessary constraints in a DPLL-based solver. This provides a drastic increase in speed and performance over conventional DPLL-based solvers. The relevancy propagation is guided by relevancy rules, which in one implementation emulate Tableau rules for limiting constraint propagation, while maintaining the performance of efficient DPLL-based solvers. An exemplary solver propagates truth assignments to constraints of a formula, and tracks which truth assignments are relevant for determining satisfiability of the formula. The solver propagates truth assignments that were marked relevant to a theory solver, while avoiding propagation of irrelevant truth assignments.
    Type: Application
    Filed: February 21, 2008
    Publication date: August 27, 2009
    Applicant: Microsoft Corporation
    Inventors: Nikolaj Skallerud Bjorner, Leonardo Mendonca de Moura