Leonardo de Moura

From MaRDI portal
Revision as of 10:26, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:438532

Available identifiers

zbMath Open de-moura.leonardoDBLPd/LeonardoMdeMouraWikidataQ84844322 ScholiaQ84844322MaRDI QIDQ438532

List of research outcomes





PublicationDate of PublicationType
Beyond Notations: Hygienic Macro Expansion for Theorem Proving Languages2022-11-09Paper
https://portal.mardi4nfdi.de/entity/Q50941292022-08-02Paper
The Lean 4 theorem prover and programming language2021-12-01Paper
https://portal.mardi4nfdi.de/entity/Q52199232020-03-09Paper
Congruence Closure in Intensional Type Theory2016-09-05Paper
The Lean Theorem Prover (System Description)2015-12-02Paper
Cutting to the chase.2015-06-23Paper
A Model-Constructing Satisfiability Calculus2014-11-03Paper
Efficiently solving quantified bit-vector formulas2014-03-28Paper
Model-based Theory Combination2013-12-06Paper
https://portal.mardi4nfdi.de/entity/Q28480592013-09-25Paper
Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals2013-06-14Paper
The Strategy Challenge in SMT Solving2013-04-16Paper
Real Algebraic Strategies for MetiTarski Proofs2012-09-07Paper
Solving Non-linear Arithmetic2012-09-05Paper
On deciding satisfiability by theorem proving with speculative inferences2012-07-31Paper
Cutting to the Chase Solving Linear Integer Arithmetic2011-07-29Paper
Symbolic Automata Constraint Solving2010-10-12Paper
Bugs, Moles and Skeletons: Symbolic Reasoning for Software Development2010-09-14Paper
Deciding effectively propositional logic using DPLL and substitution sets2010-05-26Paper
Computer Aided Verification2010-04-20Paper
Satisfiability Modulo Theories: An Appetizer2009-12-09Paper
On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving2009-07-28Paper
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories2009-06-30Paper
Efficient E-Matching for SMT Solvers2009-03-06Paper
Deciding Effectively Propositional Logic Using DPLL and Substitution Sets2008-11-27Paper
Engineering DPLL(T) + Saturation2008-11-27Paper
A Tutorial on Satisfiability Modulo Theories2007-11-29Paper
Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)2007-11-28Paper
Automated Reasoning2007-09-25Paper
Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)2007-01-30Paper
Computer Aided Verification2006-01-10Paper
Computer Aided Verification2005-08-25Paper
Computer Aided Verification2005-08-25Paper
https://portal.mardi4nfdi.de/entity/Q48090772004-08-12Paper

Research outcomes over time

This page was built for person: Leonardo de Moura