| Refutation-based synthesis in SMT | 4 | 0.47 | 2019 |
| Efficient solving of string constraints for security analysis. | 1 | 0.35 | 2016 |
| Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction | 8 | 0.43 | 2016 |
| An efficient SMT solver for string constraints. | 4 | 0.41 | 2016 |
| Temporal logics on strings with prefix relation. | 2 | 0.38 | 2016 |
| Fine Grained SMT Proofs for the Theory of Fixed-Width Bit-Vectors. | 3 | 0.41 | 2015 |
| Separation logics and modalities: a survey. | 5 | 0.48 | 2015 |
| Counterexample-Guided Quantifier Instantiation For Synthesis In Smt | 30 | 0.91 | 2015 |
| The 2012 SMT Competition. | 2 | 0.39 | 2014 |
| A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions. | 48 | 1.19 | 2014 |
| Expressive completeness of separation logic with two variables and no separating conjunction | 0 | 0.34 | 2014 |
| Quantifier instantiation techniques for finite model finding in SMT | 14 | 0.62 | 2013 |
| 6 Years of SMT-COMP | 26 | 1.33 | 2013 |
| Witness Runs for Counter Machines - (Abstract). | 0 | 0.34 | 2013 |
| Witness Runs for Counter Machines. | 0 | 0.34 | 2013 |
| Reducing chaos in SAT-like search: finding solutions close to a given one | 5 | 0.45 | 2011 |
| CVC4 | 47 | 1.43 | 2011 |
| The SMT Execution Service: Features, Fairness, and the Future. | 0 | 0.34 | 2010 |
| Verified programming in Guru | 21 | 0.98 | 2009 |
| Design And Results Of The 3rd Annual Satisfiability Modulo Theories Competition (Smt-Comp 2007) | 14 | 0.97 | 2008 |
| Signature Compilation for the Edinburgh Logical Framework | 3 | 0.48 | 2008 |
| Static determination of allocation rates to support real-time garbage collection | 10 | 0.68 | 2005 |
| Automated discovery of scoped memory regions for real-time Java | 27 | 2.08 | 2002 |
| Storage Allocation for Real-Time, Embedded Systems | 9 | 1.46 | 2001 |
