Optimization of Boolean satisfiability solver by caching intermediate results
Recently, a number of dynamic analysis tools were developed that perform tainted data flow tracing and use algorithms for solving the CNF SAT problem for input data generation and path alteration. SAT problem is known to be NP-complete and it requires a lot of optimizations to partially solve the ex...
| Main Authors: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | English |
| Publicado em: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2018-10-01
|
| Colecção: | Труды Института системного программирования РАН |
| Assuntos: | |
| Acesso em linha: | https://ispranproceedings.elpub.ru/jour/article/view/1014 |