World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
47
Citations
20484
World Ranking
6291
National Ranking
2813

Overview

Leonardo de Moura is a researcher affiliated with Microsoft in the United States with a focus on computer science. Their scholarly work spans several core areas including artificial intelligence, computational theory and mathematics, computer networks and communications, and information systems.

The scientist has contributed extensively to topics such as logic, programming, and type systems; formal methods in verification; logic, reasoning, and knowledge; mathematics, computing, and information processing; software engineering research; advanced database systems and queries; and security and verification in computing.

Key recent publications include:

  • Lean Formalization of Completeness Proof for Coalition Logic with Common Knowledge, 2024, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Use and Abuse of Instance Parameters in the Lean Mathematical Library, 2022, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • 'do' unchained: embracing local imperativity in a purely functional language (functional pearl), 2022, Proceedings of the ACM on Programming Languages
  • Beyond Notations: Hygienic Macro Expansion for Theorem Proving Languages, 2022, Logical Methods in Computer Science
  • Universal Policies for Software-Defined MDPs, 2020, arXiv (Cornell University)

These publications commonly appear in venues such as Leibniz-Zentrum für Informatik (Schloss Dagstuhl), Proceedings of the ACM on Programming Languages, arXiv (Cornell University), Logical Methods in Computer Science, and the Journal of Automated Reasoning.

Leonardo de Moura collaborates frequently with several co-authors, including Sebastian Ullrich, Daniel Selsam, Jeremy Avigad, Soonho Kong, and Cody Roux.

Best Publications

  • Z3: an efficient SMT solver

    Leonardo De Moura;Nikolaj Bjørner

  • Clone detection using abstract syntax trees

    I.D. Baxter;A. Yahin;L. Moura;M. Sant'Anna

  • A fast linear-arithmetic solver for DPLL(T)

    Bruno Dutertre;Leonardo De Moura

  • Satisfiability modulo theories: introduction and applications

    Leonardo De Moura;Nikolaj Bjørner

  • The YICES SMT Solver

    Bruno Dutertre;Leonardo de Moura

  • The Lean Theorem Prover (System Description)

    Leonardo Mendonça de Moura;Soonho Kong;Jeremy Avigad;Floris van Doorn

  • Solving non-linear arithmetic

    Dejan Jovanović;Leonardo de Moura

  • Efficient E-Matching for SMT Solvers

    Leonardo Moura;Nikolaj Bjørner

  • Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories

    Yeting Ge;Leonardo Moura

  • Satisfiability Modulo Theories: An Appetizer

    Leonardo Moura;Nikolaj Bjørner

  • Learning a SAT Solver from Single-Bit Supervision

    Daniel Selsam;Matthew Lamm;Benedikt Bünz;Percy Liang

  • Bounded Model Checking and Induction: From Refutation to Verification

    Leonardo Mendonça de Moura;Harald Rueß;Maria Sorea

  • Lazy Theorem Proving for Bounded Model Checking over Infinite Domains

    Leonardo M. de Moura;Harald Rueß;Maria Sorea;Maria Sorea

  • Generalized, efficient array decision procedures

    Leonardo de Moura;Nikolaj Bjorner

  • Efficiently solving quantified bit-vector formulas

    Christoph M. Wintersteiger;Youssef Hamadi;Leonardo Moura

  • Lazy theorem proving for bounded model checking over infinite domains

    Leonardo De Moura;Harald Ruess;Maria Sorea

  • Generating efficient test sets with a model checker

    G. Hamon;L. de Moura;J. Rushby

  • The SAL Language Manual

    Leonardo de Moura;Sam Owre;N. Shankar

  • The Lean 4 Theorem Prover and Programming Language.

    Leonardo de Moura;Sebastian Ullrich

  • A Model-Constructing Satisfiability Calculus

    Leonardo Moura;Dejan Jovanović

  • Bounded model checking and induction: From refutation to verification

    Leonardo De Moura;Harald Ruess;Maria Sorea

Frequent Co-Authors

Nikolaj Bjørner
Nikolaj Bjørner Microsoft (United States)
Clark Barrett
Clark Barrett Stanford University
Natarajan Shankar
Natarajan Shankar SRI International
Thomas Ball
Thomas Ball Microsoft (United States)
Percy Liang
Percy Liang Stanford University
John Rushby
John Rushby SRI International
David L. Dill
David L. Dill Stanford University
Christopher S. Lynch
Christopher S. Lynch University of California, Riverside
Cesare Tinelli
Cesare Tinelli University of Iowa
Margus Veanes
Margus Veanes Microsoft (United States)

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens doors to diverse academic and professional options. Many students start with an associates degree, which provides foundational knowledge and can be completed quickly and affordably online.

For those aiming for advanced roles, pursuing one of the affordable master degree programs can offer in-depth expertise and improve job prospects without incurring heavy debt.

Leadership-oriented professionals might consider the cheapest online doctorate in organizational leadership, which equips graduates for top executive positions and organizational transformation. Similarly, educators can enhance their credentials with ed.d educational leadership programs, focusing on effective administration and policy.

The evolution of online education ensures flexible access to a variety of degree pathways, helping you align your education with your chosen career while balancing affordability and quality.

Best Scientists Citing Leonardo de Moura

Trending Scientists

Recently Published Articles