17 citations · 38 across the 6 of their papers we have counts for
1 paper · 1 filter
Aaron Bembenek, Michael Greenberg, Stephen Chong
Satisfiability modulo theories (SMT) solving has become a critical part of many static analyses, including symbolic execution, refinement type checking, and model checking. We prop…