Benchmarking the Capabilities and Limitations of SAT Solvers in Defeating Obfuscation Schemes.
Shervin RoshanisefatHarshith K. ThirumalaKris GajHouman HomayounAvesta SasanPublished in: CoRR (2018)
Keyphrases
- sat solvers
- orders of magnitude
- propositional satisfiability
- search space
- constraint satisfaction
- search strategies
- boolean satisfiability
- sat problem
- max sat
- sat solving
- sat instances
- search tree
- clause learning
- weighted max sat
- clause learning sat solvers
- sat encodings
- boolean formula
- symmetry breaking
- branch and bound algorithm
- max sat solver
- upper bound