| Boosting minimal unsatisfiable core extraction A Nadel Formal methods in computer aided design, 221-229, 2010 | 122 | 2010 |
| A scalable algorithm for minimal unsatisfiable core extraction N Dershowitz, Z Hanna, A Nadel Theory and Applications of Satisfiability Testing-SAT 2006: 9th …, 2006 | 117 | 2006 |
| A lazy and layered SMT () solver for hard industrial verification problems R Bruttomesso, A Cimatti, A Franzén, A Griggio, Z Hanna, A Nadel, A Palti, ... International Conference on Computer Aided Verification, 547-560, 2007 | 105 | 2007 |
| Chronological backtracking A Nadel, V Ryvchin Theory and Applications of Satisfiability Testing–SAT 2018: 21st …, 2018 | 97 | 2018 |
| Backtrack search algorithms for propositional logic satisfiability: Review and innovations A Nadel Hebrew University of Jerusalem, 2002 | 79 | 2002 |
| Efficient SAT solving under assumptions A Nadel, V Ryvchin International Conference on Theory and Applications of Satisfiability …, 2012 | 64 | 2012 |
| Generating diverse solutions in SAT A Nadel International Conference on Theory and Applications of Satisfiability …, 2011 | 57 | 2011 |
| Efficient MUS extraction with resolution A Nadel, V Ryvchin, O Strichman 2013 Formal Methods in Computer-Aided Design, 197-200, 2013 | 54 | 2013 |
| A clause-based heuristic for SAT solvers N Dershowitz, Z Hanna, A Nadel International conference on theory and applications of satisfiability …, 2005 | 49 | 2005 |
| Ultimately incremental SAT A Nadel, V Ryvchin, O Strichman International Conference on Theory and Applications of Satisfiability …, 2014 | 44 | 2014 |
| Bit-vector optimization A Nadel, V Ryvchin Tools and Algorithms for the Construction and Analysis of Systems: 22nd …, 2016 | 39 | 2016 |
| Maple lcm dist chronobt: Featuring chronological backtracking V Ryvchin, A Nadel Proceedings of SAT competition 2018, 2018 | 38 | 2018 |
| Applying SMT in symbolic execution of microcode A Franzén, A Cimatti, A Nadel, R Sebastiani, J Shalev Formal Methods in Computer Aided Design, 121-128, 2010 | 37 | 2010 |
| Anytime weighted MaxSAT with improved polarity selection and bit-vector optimization A Nadel 2019 Formal Methods in Computer Aided Design (FMCAD), 193-202, 2019 | 36 | 2019 |
| Accelerated deletion-based extraction of minimal unsatisfiable cores A Nadel, V Ryvchin, O Strichman Journal on Satisfiability, Boolean Modeling and Computation 9 (1), 27-51, 2014 | 35 | 2014 |
| Towards a better understanding of the functionality of a conflict-driven SAT solver N Dershowitz, Z Hanna, A Nadel Theory and Applications of Satisfiability Testing–SAT 2007: 10th …, 2007 | 32 | 2007 |
| Efficient Generation of Small Interpolants in CNF Y Vizel, V Ryvchin, A Nadel | 25 | 2013 |
| Preprocessing in incremental SAT A Nadel, V Ryvchin, O Strichman Theory and Applications of Satisfiability Testing–SAT 2012: 15th …, 2012 | 23 | 2012 |
| Simultaneous SAT-based model checking of safety properties Z Khasidashvili, A Nadel, A Palti, Z Hanna Hardware and Software, Verification and Testing: First International Haifa …, 2006 | 21 | 2006 |
| Bit-vector rewriting with automatic rule generation A Nadel Computer Aided Verification: 26th International Conference, CAV 2014, Held …, 2014 | 20 | 2014 |
Vadim Ryvchin在 tx.technion.ac.il 的电子邮件经过验证
