Leonardo de Moura
Leonardo de Moura
Senior Principal Researcher at Microsoft
microsoft.com의 이메일 확인됨 - 홈페이지
제목
인용
인용
연도
Z3: An efficient SMT solver
L De Moura, N Bjørner
International conference on Tools and Algorithms for the Construction and …, 2008
72932008
Clone detection using abstract syntax trees
ID Baxter, A Yahin, L Moura, M Sant'Anna, L Bier
Proceedings. International Conference on Software Maintenance (Cat. No …, 1998
16831998
A fast linear-arithmetic solver for DPLL (T)
B Dutertre, L De Moura
International Conference on Computer Aided Verification, 81-94, 2006
8712006
The yices smt solver
B Dutertre, L De Moura
Tool paper at http://yices. csl. sri. com/tool-paper. pdf 2 (2), 1-2, 2006
8132006
Satisfiability modulo theories: introduction and applications
L De Moura, N Bjørner
Communications of the ACM 54 (9), 69-77, 2011
6592011
SAL 2
L De Moura, S Owre, H Rueß, J Rushby, N Shankar, M Sorea, A Tiwari
International Conference on Computer Aided Verification, 496-500, 2004
3532004
The Lean theorem prover (system description)
L de Moura, S Kong, J Avigad, F Van Doorn, J von Raumer
International Conference on Automated Deduction, 378-388, 2015
2772015
Efficient E-matching for SMT solvers
L De Moura, N Bjørner
International Conference on Automated Deduction, 183-198, 2007
2742007
Solving non-linear arithmetic
D Jovanović, L De Moura
International Joint Conference on Automated Reasoning, 339-354, 2012
2672012
Complete instantiation for quantified formulas in satisfiabiliby modulo theories
Y Ge, L De Moura
International Conference on Computer Aided Verification, 306-320, 2009
2502009
Satisfiability modulo theories: An appetizer
L De Moura, N Bjørner
Brazilian Symposium on Formal Methods, 23-36, 2009
2482009
Bounded model checking and induction: From refutation to verification
L De Moura, H Rueß, M Sorea
Computer Aided Verification, 14-26, 2003
2012003
Lazy theorem proving for bounded model checking over infinite domains
L De Moura, H Rueß, M Sorea
International Conference on Automated Deduction, 438-455, 2002
1822002
Learning a SAT solver from single-bit supervision
D Selsam, M Lamm, B Bünz, P Liang, L de Moura, DL Dill
arXiv preprint arXiv:1802.03685, 2018
1762018
Generating efficient test sets with a model checker
G Hamon, L De Moura, J Rushby
Proceedings of the Second International Conference on Software Engineering …, 2004
1692004
The SAL language manual
L De Moura, S Owre, N Shankar
Computer Science Laboratory, SRI International, Menlo Park, Tech. Rep. CSL-01-01, 2003
1432003
Generalized, efficient array decision procedures
L De Moura, N Bjørner
2009 Formal Methods in Computer-Aided Design, 45-52, 2009
1352009
Efficiently solving quantified bit-vector formulas
CM Wintersteiger, Y Hamadi, L De Moura
Formal Methods in System Design 42 (1), 3-23, 2013
1232013
SMT-COMP: Satisfiability modulo theories competition
C Barrett, L De Moura, A Stump
International Conference on Computer Aided Verification, 20-23, 2005
1172005
μZ– An Efficient Engine for Fixed Points with Constraints
K Hoder, N Bjørner, L De Moura
International Conference on Computer Aided Verification, 457-462, 2011
1102011
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20