Benchmarking the Capabilities and Limitations of SAT Solvers in Defeating Obfuscation Schemes.
Shervin RoshanisefatHarshith K. ThirumalaKris GajHouman HomayounAvesta SasanPublished in: IOLTS (2018)
Keyphrases
- sat solvers
- orders of magnitude
- sat solving
- propositional satisfiability
- sat problem
- search space
- boolean satisfiability
- max sat
- search strategies
- sat instances
- constraint satisfaction
- search tree
- clause learning
- clause learning sat solvers
- weighted max sat
- propositional logic
- sat encodings
- satisfiability problem
- temporal logic
- co occurrence