Reusing Solutions Modulo Theories

Aquino, Andrea; Denaro, Giovanni; Pezzè, Mauro

doi:10.1109/tse.2019.2898199

Cited by 4 publications

(1 citation statement)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…1) Incremental mechanisms in SMT solvers: Modern SAT/SMT solvers have incremental solving facilities, which cache intermediate solving states such as the learned clauses [54] or final solutions such as the satisfying models or unsatisfiable cores [55] to accelerate the solving procedure of new constraints. However, these methods are not specially designed for fuzzing.…”

Section: B Symbolic Executionmentioning

confidence: 99%

Pangolin: Incremental Hybrid Fuzzing with Polyhedral Path Abstraction

Huang

Yao

et al. 2020

2020 IEEE Symposium on Security and Privacy (SP)

View full text Add to dashboard Cite

Hybrid fuzzing, which combines the merits of both fuzzing and concolic execution, has become one of the most important trends in coverage-guided fuzzing techniques. Despite the tremendous research on hybrid fuzzers, we observe that existing techniques are still inefficient. One important reason is that these techniques, which we refer to as non-incremental fuzzers, cache and reuse few computation results and, thus, lose many optimization opportunities. To be incremental, we propose "polyhedral path abstraction", which preserves the exploration state in the concolic execution stage and allows more effective mutation and constraint solving over existing techniques. We have implemented our idea as a tool, namely PANGOLIN, and evaluated it using LAVA-M as well as nine real-world programs. The evaluation results showed that PANGOLIN outperforms the stateof-the-art fuzzing techniques with the improvement of coverage rate ranging from 10% to 30%. Moreover, PANGOLIN found 400 more bugs in LAVA-M and discovered 41 unseen bugs with 8 of them assigned with the CVE IDs.

show abstract

Section: B Symbolic Executionmentioning

confidence: 99%