| DRAT-trim: Efficient checking and trimming using expressive clausal proofs N Wetzler, MJH Heule, WA Hunt Jr International Conference on Theory and Applications of Satisfiability …, 2014 | 275 | 2014 |
| Trimming while checking clausal proofs MJH Heule, WA Hunt, N Wetzler 2013 Formal Methods in Computer-Aided Design, 181-188, 2013 | 152 | 2013 |
| Verifying refutations with extended resolution MJH Heule, WA Hunt Jr, N Wetzler International Conference on Automated Deduction, 345-359, 2013 | 105 | 2013 |
| Efficient, verified checking of propositional proofs M Heule, W Hunt, M Kaufmann, N Wetzler Interactive Theorem Proving: 8th International Conference, ITP 2017 …, 2017 | 60 | 2017 |
| Expressing symmetry breaking in DRAT proofs MJH Heule, WA Hunt Jr, N Wetzler International Conference on Automated Deduction, 591-606, 2015 | 48 | 2015 |
| Mechanical Verification of SAT Refutations with Extended Resolution N Wetzler, MJH Heule, WA Hunt Jr Interactive Theorem Proving (ITP) 7998, 229-244, 2013 | 38 | 2013 |
| Bridging the gap between easy generation and efficient verification of unsatisfiability proofs MJH Heule, WA Hunt Jr, N Wetzler Software Testing, Verification and Reliability 24 (8), 593-607, 2014 | 30 | 2014 |
| Partial words and the critical factorization theorem revisited F Blanchet-Sadri, ND Wetzler Theoretical Computer Science 385 (1-3), 179-192, 2007 | 16 | 2007 |
| Efficient, mechanically-verified validation of satisfiability solvers ND Wetzler The University of Texas at Austin, 2015 | 5 | 2015 |
Marijn HeuleAssociate Professor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu
