| Boolector 2.0 A Niemetz, M Preiner, A Biere Journal on Satisfiability, Boolean Modeling and Computation 9 (1), 53-58, 2014 | 104 | 2014 |
| Resolution-based certificate extraction for QBF A Niemetz, M Preiner, F Lonsing, M Seidl, A Biere International Conference on Theory and Applications of Satisfiability …, 2012 | 56 | 2012 |
| Btor2 , BtorMC and Boolector 3.0 A Niemetz, M Preiner, C Wolf, A Biere International Conference on Computer Aided Verification, 587-595, 2018 | 32 | 2018 |
| Analysis of Portfolio-Style Parallel SAT Solving on Current Multi-Core Architectures. M Aigner, A Biere, CM Kirsch, A Niemetz, M Preiner POS@ SAT 29, 28-40, 2013 | 24 | 2013 |
| Counterexample-guided model synthesis M Preiner, A Niemetz, A Biere International Conference on Tools and Algorithms for the Construction and …, 2017 | 22 | 2017 |
| Solving Quantified Bit-Vectors Using Invertibility Conditions A Niemetz, M Preiner, A Reynolds, C Barrett, C Tinelli International Conference on Computer Aided Verification, 236-255, 2018 | 19 | 2018 |
| Improving local search for bit-vector logics in SMT with path propagation A Niemetz, M Preiner, A Biere, A Fröhlich Proceedings of the Fourth International Workshop on Design and …, 2015 | 18 | 2015 |
| Propagation based local search for bit-precise reasoning A Niemetz, M Preiner, A Biere Formal Methods in System Design 51 (3), 608-636, 2017 | 16 | 2017 |
| Precise and complete propagation based local search for satisfiability modulo theories A Niemetz, M Preiner, A Biere International Conference on Computer Aided Verification, 199-217, 2016 | 15 | 2016 |
| Model-based API testing for SMT solvers A Niemetz, M Preiner, A Biere Proceedings of the 15th International Workshop on Satisfiability Modulo …, 2017 | 13 | 2017 |
| Lemmas on demand for lambdas M Preiner, A Niemetz, A Biere Program Proceedings, 28, 2013 | 13 | 2013 |
| Turbo-charging Lemmas on demand with don't care reasoning A Niemetz, M Preiner, A Biere 2014 Formal Methods in Computer-Aided Design (FMCAD), 179-186, 2014 | 12 | 2014 |
| ddSMT: a delta debugger for the SMT-LIB v2 format A Niemetz, A Biere Proceedings of the 11th International Workshop on Satisfiability Modulo …, 2013 | 12 | 2013 |
| Syntax-Guided Rewrite Rule Enumeration for SMT Solvers A Nötzli, A Reynolds, H Barbosa, A Niemetz, M Preiner, C Barrett, ... Theory and Applications of Satisfiability Testing (SAT), 2019 | 10* | 2019 |
| CVC4 at the SMT Competition 2018 C Barrett, H Barbosa, M Brain, D Ibeling, T King, P Meng, A Niemetz, ... arXiv preprint arXiv:1806.08775, 2018 | 10 | 2018 |
| Bit-Precise Reasoning Beyond Bit-Blasting A Niemetz Universität Linz, 2017 | 5 | 2017 |
| The SMT Competition 2015–2018 T Weber, S Conchon, D Déharbe, M Heizmann, A Niemetz, G Reger Journal on Satisfiability, Boolean Modeling and Computation 11 (1), 221-259, 2019 | 4 | 2019 |
| Towards Bit-Width-Independent Proofs in SMT Solvers A Niemetz, M Preiner, A Reynolds, Y Zohar, C Barrett, C Tinelli International Conference on Automated Deduction, 366-384, 2019 | 3 | 2019 |
| Better lemmas with lambda extraction M Preiner, A Niemetz, A Biere 2015 Formal Methods in Computer-Aided Design (FMCAD), 128-135, 2015 | 3 | 2015 |
| Extracting and Checking Q-Resolution Proofs from a State-Of-The-Art QBF-Solver A Niemetz | 2* | |
Mathias PreinerStanford UniversityVerified email at cs.stanford.edu
