| Cvc4 C Barrett, CL Conway, M Deters, L Hadarean, D Jovanović, T King, ... International Conference on Computer Aided Verification, 171-177, 2011 | 1273 | 2011 |
| A DPLL (T) theory solver for a theory of strings and regular expressions T Liang, A Reynolds, C Tinelli, C Barrett, M Deters International Conference on Computer Aided Verification, 646-662, 2014 | 147 | 2014 |
| Counterexample-guided quantifier instantiation for synthesis in SMT A Reynolds, M Deters, V Kuncak, C Tinelli, C Barrett International Conference on Computer Aided Verification, 198-216, 2015 | 145* | 2015 |
| Induction for SMT solvers A Reynolds, V Kuncak International Workshop on Verification, Model Checking, and Abstract …, 2015 | 86 | 2015 |
| Quantifier instantiation techniques for finite model finding in SMT A Reynolds, C Tinelli, A Goel, S Krstić, M Deters, C Barrett International Conference on Automated Deduction, 377-391, 2013 | 80 | 2013 |
| Finding conflicting instances of quantified formulas in SMT A Reynolds, C Tinelli, L De Moura 2014 Formal Methods in Computer-Aided Design (FMCAD), 195-202, 2014 | 76 | 2014 |
| SMTCoq: A plug-in for integrating SMT solvers into Coq B Ekici, A Mebsout, C Tinelli, C Keller, G Katz, A Reynolds, C Barrett International Conference on Computer Aided Verification, 126-133, 2017 | 70 | 2017 |
| Finite model finding in SMT A Reynolds, C Tinelli, A Goel, S Krstić International Conference on Computer Aided Verification, 640-655, 2013 | 69 | 2013 |
| SMT proof checking using a logical framework A Stump, D Oe, A Reynolds, L Hadarean, C Tinelli Formal Methods in System Design 42 (1), 91-118, 2013 | 68 | 2013 |
| An efficient SMT solver for string constraints T Liang, A Reynolds, N Tsiskaridze, C Tinelli, C Barrett, M Deters Formal Methods in System Design 48 (3), 206-234, 2016 | 52 | 2016 |
| A tour of CVC4: how it works, and how to use it M Deters, A Reynolds, T King, C Barrett, C Tinelli 2014 Formal Methods in Computer-Aided Design (FMCAD), 7-7, 2014 | 52 | 2014 |
| cvc4sy: Smart and Fast Term Enumeration for Syntax-Guided Synthesis A Reynolds, H Barbosa, A Nötzli, C Barrett, C Tinelli International Conference on Computer Aided Verification, 74-83, 2019 | 48 | 2019 |
| Revisiting enumerative instantiation A Reynolds, H Barbosa, P Fontaine International Conference on Tools and Algorithms for the Construction and …, 2018 | 47 | 2018 |
| A decision procedure for (co) datatypes in SMT solvers A Reynolds, JC Blanchette International Conference on Automated Deduction, 197-213, 2015 | 43 | 2015 |
| A decision procedure for separation logic in SMT A Reynolds, R Iosif, C Serban, T King International Symposium on Automated Technology for Verification and …, 2016 | 39 | 2016 |
| Extending SMT solvers to higher-order logic H Barbosa, A Reynolds, DE Ouraoui, C Tinelli, C Barrett International Conference on Automated Deduction, 35-54, 2019 | 38* | 2019 |
| Congruence closure with free variables H Barbosa, P Fontaine, A Reynolds International Conference on Tools and Algorithms for the Construction and …, 2017 | 38 | 2017 |
| Solving quantified linear arithmetic by counterexample-guided instantiation A Reynolds, T King, V Kuncak Formal Methods in System Design 51 (3), 500-532, 2017 | 37* | 2017 |
| Scaling up DPLL (T) string solvers using context-dependent simplification A Reynolds, M Woo, C Barrett, D Brumley, T Liang, C Tinelli International Conference on Computer Aided Verification, 453-474, 2017 | 36 | 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 | 31 | 2018 |
Cesare TinelliProfessor of Computer Science, The University of IowaVerified email at uiowa.edu
