| 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel | 0 | 0.34 | 2022 |
| Synthesizing Reactive Systems Using Robustness and Recovery Specifications | 0 | 0.34 | 2019 |
| Program Equivalence (Dagstuhl Seminar 18151). | 0 | 0.34 | 2018 |
| The impact of Entropy and Solution Density on selected SAT heuristics. | 0 | 0.34 | 2018 |
| Special issue: program equivalence. | 0 | 0.34 | 2018 |
| Decision-Making with Cross-Entropy for Self-Adaptation. | 6 | 0.40 | 2017 |
| Near-Optimal Course Scheduling at the Technion | 0 | 0.34 | 2017 |
| Regression Verification for Unbalanced Recursive Functions. | 5 | 0.42 | 2016 |
| Minimal unsatisfiable core extraction for SMT. | 0 | 0.34 | 2016 |
| Cyclic Routing Of Unmanned Aerial Vehicles | 3 | 0.43 | 2016 |
| Learning General Constraints in CSP. | 2 | 0.39 | 2016 |
| Learning the Language of Error. | 5 | 0.45 | 2015 |
| Mining Backbone Literals in Incremental SAT - A New Kind of Incremental Data. | 0 | 0.34 | 2015 |
| Proving mutual termination | 2 | 0.36 | 2015 |
| Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra | 1 | 0.37 | 2015 |
| Regression verification for multi-threaded programs (with extensions to locks and dynamic thread creation) | 2 | 0.36 | 2015 |
| Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores. | 0 | 0.34 | 2014 |
| Ultimately Incremental SAT. | 4 | 0.39 | 2014 |
| Preface to the special issue "SI: Satisfiability Modulo Theories" | 0 | 0.34 | 2013 |
| Efficient MUS extraction with resolution | 16 | 0.60 | 2013 |
| Verifying periodic programs with priority inheritance locks | 3 | 0.38 | 2013 |
| Beyond vacuity: towards the strongest passing formula | 6 | 0.46 | 2013 |
| Regression verification: proving the equivalence of similar programs. | 29 | 0.85 | 2013 |
| A New Class of Lineage Expressions over Probabilistic Databases Computable in P-Time. | 4 | 0.39 | 2013 |
| Compositional Sequentialization Of Periodic Programs | 6 | 0.49 | 2013 |
| Proving mutual termination of programs | 1 | 0.37 | 2012 |
| Preprocessing in incremental SAT | 4 | 0.47 | 2012 |
| Regression verification for multi-threaded programs | 12 | 0.55 | 2012 |
| Reducing the size of resolution proofs in linear time | 6 | 0.46 | 2011 |
| Time-bounded analysis of real-time systems | 14 | 0.81 | 2011 |
| Faster extraction of high-level minimal unsatisfiable cores | 27 | 1.01 | 2011 |
| A probabilistic analysis of coverage methods | 1 | 0.36 | 2011 |
| Linear completeness thresholds for bounded model checking | 13 | 0.65 | 2011 |
| Underapproximation for model-checking based on universal circuits | 0 | 0.34 | 2010 |
| Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings | 31 | 1.98 | 2010 |
| Variants of LTL query checking | 2 | 0.38 | 2010 |
| Inference rules for proving the equivalence of recursive procedures | 30 | 1.43 | 2010 |
| A framework for Satisfiability Modulo Theories | 3 | 0.40 | 2009 |
| Translation Validation: From Simulink to C | 11 | 0.71 | 2009 |
| Decision diagrams for linear arithmetic | 13 | 0.69 | 2009 |
| HaifaSat: a SAT solver based on an Abstraction/Refinement model | 0 | 0.34 | 2009 |
| An abstraction-based decision procedure for bit-vector arithmetic | 12 | 0.70 | 2009 |
| Before and after vacuity | 7 | 0.43 | 2009 |
| Regression verification | 30 | 1.30 | 2009 |
| A theory-based decision heuristic for DPLL(T) | 5 | 0.52 | 2008 |
| Linear-Time Reductions of Resolution Proofs | 20 | 1.02 | 2008 |
| Three optimizations for Assume---Guarantee reasoning with L* | 6 | 0.48 | 2008 |
| An approach for extracting a small unsatisfiable core | 10 | 0.62 | 2008 |
| Generating Minimum Transitivity Constraints in P-time for Deciding Equality Logic | 1 | 0.35 | 2008 |
| Easier and More Informative Vacuity Checks | 15 | 0.63 | 2007 |
