63 citations · 252 across the 39 of their papers we have counts for
3 papers · 1 filter
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…
Z3str3: A String Solver with Theory-aware Branching
Murphy Berzish, Yunhui Zheng, Vijay Ganesh
We present a new string SMT solver, Z3str3, that is faster than its competitors Z3str2, Norn, CVC4, S3, and S3P over a majority of three industrial-strength benchmarks, namely Kalu…
Reasoning about Probabilistic Defense Mechanisms against Remote Attacks
Martín Ochoa, Sebastian Banescu, Cynthia Disenfeld +2
Despite numerous countermeasures proposed by practitioners and researchers, remote control-flow alteration of programs with memory-safety vulnerabilities continues to be a realisti…