| 2013 | ||
|---|---|---|
| j12 | Christoph M. Wintersteiger, Youssef Hamadi, Leonardo Mendonça de Moura: Efficiently solving quantified bit-vector formulas. Formal Methods in System Design 42(1): 3-23 (2013) | |
| j11 | Clark Barrett, Morgan Deters, Leonardo Mendonça de Moura, Albert Oliveras, Aaron Stump: 6 Years of SMT-COMP. J. Autom. Reasoning 50(3): 243-277 (2013) | |
| j10 | Dejan Jovanovic, Leonardo Mendonça de Moura: Cutting to the Chase - Solving Linear Integer Arithmetic. J. Autom. Reasoning 51(1): 79-108 (2013) | |
| c38 | Leonardo Mendonça de Moura, Dejan Jovanovic: A Model-Constructing Satisfiability Calculus. VMCAI 2013: 1-12 | |
| 2012 | ||
| c37 | Grant Olney Passmore, Lawrence C. Paulson, Leonardo Mendonça de Moura: Real Algebraic Strategies for MetiTarski Proofs. AISC/MKM/Calculemus 2012: 358-370 | |
| c36 | ||
| c35 | ||
| c34 | Thomas Ball, Nikolaj Bjørner, Leonardo Mendonça de Moura, Kenneth L. McMillan, Margus Veanes: Beyond First-Order Satisfaction: Fixed Points, Interpolants, Automata and Polynomials. SPIN 2012: 1-6 | |
| 2011 | ||
| j9 | Leonardo Mendonça de Moura, Nikolaj Bjørner: Satisfiability modulo theories: introduction and applications. Commun. ACM 54(9): 69-77 (2011) | |
| j8 | Maria Paola Bonacina, Christopher Lynch, Leonardo Mendonça de Moura: On Deciding Satisfiability by Theorem Proving with Speculative Inferences. J. Autom. Reasoning 47(2): 161-189 (2011) | |
| c33 | Dejan Jovanovic, Leonardo Mendonça de Moura: Cutting to the Chase Solving Linear Integer Arithmetic. CADE 2011: 338-353 | |
| c32 | Krystof Hoder, Nikolaj Bjørner, Leonardo Mendonça de Moura: μZ- An Efficient Engine for Fixed Points with Constraints. CAV 2011: 457-462 | |
| c31 | ||
| c30 | ||
| 2010 | ||
| j7 | Ruzica Piskac, Leonardo Mendonça de Moura, Nikolaj Bjørner: Deciding Effectively Propositional Logic Using DPLL and Substitution Sets. J. Autom. Reasoning 44(4): 401-424 (2010) | |
| c29 | Leonardo Mendonça de Moura, Nikolaj Bjørner: Bugs, Moles and Skeletons: Symbolic Reasoning for Software Development. IJCAR 2010: 400-411 | |
| c28 | Christoph M. Wintersteiger, Youssef Hamadi, Leonardo Mendonça de Moura: Efficiently solving quantified bit-vector formulas. FMCAD 2010: 239-246 | |
| c27 | Clark Barrett, Leonardo Mendonça de Moura, Silvio Ranise, Aaron Stump, Cesare Tinelli: The SMT-LIB Initiative and the Rise of SMT - (HVC 2010 Award Talk). Haifa Verification Conference 2010: 3 | |
| c26 | Leonardo Mendonça de Moura, Carsten Lutz, Monica M. C. Schraefel, Bernhard Nebel: Tutorial Presentations at the Twelfth International Conference on Principles of Knowledge Representation and Reasoning. KR 2010 | |
| c25 | Margus Veanes, Nikolaj Bjørner, Leonardo Mendonça de Moura: Symbolic Automata Constraint Solving. LPAR (Yogyakarta) 2010: 640-654 | |
| 2009 | ||
| c24 | Maria Paola Bonacina, Christopher Lynch, Leonardo Mendonça de Moura: On Deciding Satisfiability by DPLL(G+T) and Unsound Theorem Proving. CADE 2009: 35-50 | |
| c23 | ||
| c22 | Christoph M. Wintersteiger, Youssef Hamadi, Leonardo Mendonça de Moura: A Concurrent Portfolio Approach to SMT Solving. CAV 2009: 715-720 | |
| c21 | Leonardo Mendonça de Moura, Nikolaj Bjørner: Generalized, efficient array decision procedures. FMCAD 2009: 45-52 | |
| c20 | Nikolaj Bjørner, Leonardo Mendonça de Moura: Tapas: Theory Combinations and Practical Applications. FORMATS 2009: 1-6 | |
| c19 | Leonardo Mendonça de Moura, Nikolaj Bjørner: Satisfiability Modulo Theories: An Appetizer. SBMF 2009: 23-36 | |
| c18 | Grant Olney Passmore, Leonardo Mendonça de Moura: Superfluous S-polynomials in Strategy-Independent Groebner Bases. SYNASC 2009: 45-53 | |
| 2008 | ||
| j6 | Leonardo Mendonça de Moura, Nikolaj Bjørner: Model-based Theory Combination. Electr. Notes Theor. Comput. Sci. 198(2): 37-49 (2008) | |
| c17 | Leonardo Mendonça de Moura, Nikolaj Bjørner: Deciding Effectively Propositional Logic Using DPLL and Substitution Sets. IJCAR 2008: 410-425 | |
| c16 | ||
| c15 | ||
| c14 | ||
| 2007 | ||
| j5 | Clark W. Barrett, Leonardo Mendonça de Moura, Aaron Stump: Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006). Formal Methods in System Design 31(3): 221-239 (2007) | |
| c13 | ||
| c12 | Leonardo Mendonça de Moura, Nikolaj Bjørner: Efficient E-Matching for SMT Solvers. CADE 2007: 183-198 | |
| c11 | Leonardo Mendonça de Moura, Bruno Dutertre, Natarajan Shankar: A Tutorial on Satisfiability Modulo Theories. CAV 2007: 20-36 | |
| 2006 | ||
| c10 | Bruno Dutertre, Leonardo Mendonça de Moura: A Fast Linear-Arithmetic Solver for DPLL(T). CAV 2006: 81-94 | |
| 2005 | ||
| j4 | Leonardo Mendonça de Moura, Harald Rueß, Natarajan Shankar: Justifying Equality. Electr. Notes Theor. Comput. Sci. 125(3): 69-85 (2005) | |
| j3 | Clark W. Barrett, Leonardo Mendonça de Moura, Aaron Stump: Design and Results of the First Satisfiability Modulo Theories Competition (SMT-COMP 2005). J. Autom. Reasoning 35(4): 373-390 (2005) | |
| c9 | Clark W. Barrett, Leonardo Mendonça de Moura, Aaron Stump: SMT-COMP: Satisfiability Modulo Theories Competition. CAV 2005: 20-23 | |
| 2004 | ||
| c8 | Leonardo Mendonça de Moura, Sam Owre, Harald Rueß, John M. Rushby, Natarajan Shankar: The ICS Decision Procedures for Embedded Deduction. IJCAR 2004: 218-222 | |
| c7 | Leonardo Mendonça de Moura, Harald Rueß: An Experimental Evaluation of Ground Decision Procedures. CAV 2004: 162-174 | |
| c6 | Leonardo Mendonça de Moura, Sam Owre, Harald Rueß, John M. Rushby, Natarajan Shankar, Maria Sorea, Ashish Tiwari: SAL 2. CAV 2004: 496-500 | |
| c5 | Grégoire Hamon, Leonardo Mendonça de Moura, John M. Rushby: Generating Efficient Test Sets with a Model Checker. SEFM 2004: 261-270 | |
| 2003 | ||
| c4 | Leonardo Mendonça de Moura, Harald Rueß, Maria Sorea: Bounded Model Checking and Induction: From Refutation to Verification (Extended Abstract, Category A). CAV 2003: 14-26 | |
| c3 | Harald Rueß, Leonardo Mendonça de Moura: Simulation and verification I: from simulation to verification (and back). Winter Simulation Conference 2003: 888-896 | |
| 2002 | ||
| c2 | Leonardo Mendonça de Moura, Harald Rueß, Maria Sorea: Lazy Theorem Proving for Bounded Model Checking over Infinite Domains. CADE 2002: 438-455 | |
| 1999 | ||
| j2 | Leonardo Mendonça de Moura, Carlos José Pereira de Lucena, Arndt von Staa: The Spider Environment. Softw., Pract. Exper. 29(2): 99-124 (1999) | |
| 1998 | ||
| c1 | Ira D. Baxter, Andrew Yahin, Leonardo Mendonça de Moura, Marcelo Sant'Anna, Lorraine Bier: Clone Detection Using Abstract Syntax Trees. ICSM 1998: 368-377 | |
| 1997 | ||
| j1 | Leonardo Mendonça de Moura, Carlos José Pereira de Lucena: O Ambiente Visual Spider para o Desenvolvimento de Aplicações para a Internet. RITA 4(2): 59-78 (1997) | |
Colors in the list of coauthors
Last update Sun May 26 08:56:43 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page