| Title | JIGSAW: Efficient and Scalable Path Constraints Fuzzing |
| Publication Type | Conference Paper |
| Year of Publication | 2022 |
| Authors | Chen, Ju, Wang, Jinghan, Song, Chengyu, Yin, Heng |
| Conference Name | 2022 IEEE Symposium on Security and Privacy (SP) |
| Date Published | may |
| Keywords | Computer bugs, fuzzing, privacy, Prototypes, pubcrawl, resilience, Resiliency, Scalability, search problems, Security Heuristics, Test pattern generators, Throughput |
| Abstract | Coverage-guided testing has shown to be an effective way to find bugs. If we model coverage-guided testing as a search problem (i.e., finding inputs that can cover more branches), then its efficiency mainly depends on two factors: (1) the accuracy of the searching algorithm and (2) the number of inputs that can be evaluated per unit time. Therefore, improving the search throughput has shown to be an effective way to improve the performance of coverage-guided testing.In this work, we present a novel design to improve the search throughput: by evaluating newly generated inputs with JIT-compiled path constraints. This approach allows us to significantly improve the single thread throughput as well as scaling to multiple cores. We also developed several optimization techniques to eliminate major bottlenecks during this process. Evaluation of our prototype JIGSAW shows that our approach can achieve three orders of magnitude higher search throughput than existing fuzzers and can scale to multiple cores. We also find that with such high throughput, a simple gradient-guided search heuristic can solve path constraints collected from a large set of real-world programs faster than SMT solvers with much more sophisticated search heuristics. Evaluation of end-to-end coverage-guided testing also shows that our JIGSAW-powered hybrid fuzzer can outperform state-of-the-art testing tools. |
| DOI | 10.1109/SP46214.2022.9833796 |
| Citation Key | chen_jigsaw_2022 |
JIGSAW: Efficient and Scalable Path Constraints Fuzzing