40 citations · 89 across the 11 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.LO2017
Exploring Approximations for Floating-Point Arithmetic using UppSAT
Aleksandar Zeljic, Peter Backeman, Christoph M. Wintersteiger +1
We consider the problem of solving floating-point constraints obtained from software verification. We present UppSAT --- a new implementation of a systematic approximation refineme…
cs.AI2017★ 5 cited
Relating Complexity-theoretic Parameters with SAT Solver Performance
Edward Zulkoski, Ruben Martins, Christoph Wintersteiger +4
Over the years complexity theorists have proposed many structural parameters to explain the surprising efficiency of conflict-driven clause-learning (CDCL) SAT solvers on a wide va…