Leonardo de Moura

Citirano

	Sve	Od 2020.
Citati	24490	9464
H-indeks	48	31
i10-indeks	83	53

2100

1050

525

1575

2003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202568 149 216 255 345 432 607 739 817 960 1178 1319 1356 1533 1497 1540 1620 1663 1819 1828 1983 2059 109

Javni pristup

Prikaži sve

2 članka

0 članaka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Nikolaj BjornerMicrosoft ResearchPotvrđena adresa e-pošte na cs.stanford.edu
Bruno DutertreAmazon Web ServicesPotvrđena adresa e-pošte na amazon.com
Harald RuessfortissPotvrđena adresa e-pošte na fortiss.org
Natarajan ShankarSRI International Computer Science LaboratoryPotvrđena adresa e-pošte na csl.sri.com
John RushbySRI InternationalPotvrđena adresa e-pošte na csl.sri.com
Clark BarrettStanford UniversityPotvrđena adresa e-pošte na cs.stanford.edu
Jeremy AvigadProfessor of Philosophy and Mathematical Sciences, Carnegie Mellon UniversityPotvrđena adresa e-pošte na cmu.edu
Sebastian UllrichKarlsruhe Institute of TechnologyPotvrđena adresa e-pošte na kit.edu
Daniel SelsamOpenAIPotvrđena adresa e-pošte na openai.com
Aaron StumpJohn R. and Pamela Egan Chair, Computer Science, Boston CollegePotvrđena adresa e-pošte na bc.edu
Dejan JovanovićAmazon Web ServicesPotvrđena adresa e-pošte na amazon.com
Sam OwreSRI InternationalPotvrđena adresa e-pošte na sri.com
Soonho KongAmazon Web ServicesPotvrđena adresa e-pošte na amazon.com
Grant Olney PassmoreImandra Inc. and Clare Hall, University of CambridgePotvrđena adresa e-pošte na cl.cam.ac.uk
Christoph M. WintersteigerImandraPotvrđena adresa e-pošte na imandra.ai
Ira BaxterCTO Semantic DesignsPotvrđena adresa e-pošte na semdesigns.com
Percy LiangAssociate Professor of Computer Science, Stanford UniversityPotvrđena adresa e-pošte na cs.stanford.edu
Ashish TiwariComputer Scientist, SRI International; Researcher MicrosoftPotvrđena adresa e-pošte na csl.sri.com
Floris van DoornUniversity of BonnPotvrđena adresa e-pošte na math.uni-bonn.de
Jakob von RaumerKarlsruhe Institute of TechnologyPotvrđena adresa e-pošte na von-raumer.de

Prati

Leonardo de Moura

Amazon Web Services

Potvrđena adresa e-pošte na amazon.com - Početna stranica

Automated Reasoning Theorem Proving Constraint Solving SAT SMT


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
Z3: An efficient SMT solver L De Moura, N Bjørner International conference on Tools and Algorithms for the Construction and …, 2008	11462	2008
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	2031	1998
A fast linear-arithmetic solver for DPLL (T) B Dutertre, L De Moura International Conference on Computer Aided Verification, 81-94, 2006	997	2006
Satisfiability modulo theories: introduction and applications L De Moura, N Bjørner Communications of the ACM 54 (9), 69-77, 2011	945	2011
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	894	2006
The Lean theorem prover (system description) L De Moura, S Kong, J Avigad, F Van Doorn, J von Raumer Automated Deduction-CADE-25: 25th International Conference on Automated …, 2015	775	2015
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	524	2018
Solving non-linear arithmetic D Jovanović, L De Moura International Joint Conference on Automated Reasoning, 339-354, 2012	383	2012
Efficient E-matching for SMT solvers L De Moura, N Bjørner Automated Deduction–CADE-21: 21st International Conference on Automated …, 2007	381	2007
SAL 2 L De Moura, S Owre, H Rueß, J Rushby, N Shankar, M Sorea, A Tiwari Computer Aided Verification: 16th International Conference, CAV 2004, Boston …, 2004	375	2004
Complete instantiation for quantified formulas in satisfiabiliby modulo theories Y Ge, L De Moura Computer Aided Verification: 21st International Conference, CAV 2009 …, 2009	336	2009
Satisfiability modulo theories: An appetizer L De Moura, N Bjørner Brazilian Symposium on Formal Methods, 23-36, 2009	311	2009
The Lean 4 theorem prover and programming language L Moura, S Ullrich Automated Deduction–CADE 28: 28th International Conference on Automated …, 2021	250	2021
Bounded model checking and induction: From refutation to verification L De Moura, H Rueß, M Sorea Computer Aided Verification, 14-26, 2003	231*	2003
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	191	2002
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	185	2004
Generalized, efficient array decision procedures L De Moura, N Bjørner 2009 Formal Methods in Computer-Aided Design, 45-52, 2009	183	2009
A model-constructing satisfiability calculus L De Moura, D Jovanović International Workshop on Verification, Model Checking, and Abstract …, 2013	166	2013
SMT-COMP: Satisfiability modulo theories competition C Barrett, L De Moura, A Stump Computer Aided Verification: 17th International Conference, CAV 2005 …, 2005	165	2005
The SAL language manual L De Moura, S Owre, N Shankar Computer Science Laboratory, SRI International, Menlo Park, Tech. Rep. CSL-01-01, 2003	149	2003

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori