TY - JOUR
T1 - SymDict
T2 - A novel hybrid fuzzing method based on symbolic dictionaries
AU - Fei, Chengyu
AU - Sun, Jiajun
AU - Tian, Donghai
AU - Tao, Leng
AU - Hu, Changzhen
N1 - Publisher Copyright:
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2026.
PY - 2026/12
Y1 - 2026/12
N2 - Fuzzing has proven effective at discovering software vulnerabilities. To improve performance when facing complex constraints, hybrid fuzzing combines fuzzing with symbolic execution. However, existing approaches face two key challenges: redundant constraint solving when multiple test cases share common path segments, and the underutilization of symbolic execution when full-path solving does not directly yield useful mutation guidance. To address these challenges, we propose SymDict, a hybrid fuzzing system based on symbolic dictionaries. SymDict reduces redundant symbolic execution by performing constraint solving only at uncovered branches in frontier basic blocks, i.e., blocks with at least one still-uncovered control-flow successor. To overcome the underutilization problem under hard-to-solve constraints, SymDict partitions constraint sets into solvable subsets, combines solutions with offset information to create symbolic dictionaries, and uses these dictionaries to guide fuzzing mutations. To mitigate the additional time overhead introduced by symbolic execution, SymDict employs a deterministic mutation filter and a critical bytes filter. We evaluate SymDict by comparing it with a representative hybrid fuzzing system based on AFL and SymCC, using real-world programs from FuzzBench as benchmarks. The evaluation results indicate that SymDict leads to noticeable gains in both path and edge coverage, supporting the effectiveness of our optimizations.
AB - Fuzzing has proven effective at discovering software vulnerabilities. To improve performance when facing complex constraints, hybrid fuzzing combines fuzzing with symbolic execution. However, existing approaches face two key challenges: redundant constraint solving when multiple test cases share common path segments, and the underutilization of symbolic execution when full-path solving does not directly yield useful mutation guidance. To address these challenges, we propose SymDict, a hybrid fuzzing system based on symbolic dictionaries. SymDict reduces redundant symbolic execution by performing constraint solving only at uncovered branches in frontier basic blocks, i.e., blocks with at least one still-uncovered control-flow successor. To overcome the underutilization problem under hard-to-solve constraints, SymDict partitions constraint sets into solvable subsets, combines solutions with offset information to create symbolic dictionaries, and uses these dictionaries to guide fuzzing mutations. To mitigate the additional time overhead introduced by symbolic execution, SymDict employs a deterministic mutation filter and a critical bytes filter. We evaluate SymDict by comparing it with a representative hybrid fuzzing system based on AFL and SymCC, using real-world programs from FuzzBench as benchmarks. The evaluation results indicate that SymDict leads to noticeable gains in both path and edge coverage, supporting the effectiveness of our optimizations.
KW - Hybrid fuzzing
KW - Symbolic dictionary
KW - Symbolic execution
UR - https://www.scopus.com/pages/publications/105047550771
U2 - 10.1007/s10515-026-00657-2
DO - 10.1007/s10515-026-00657-2
M3 - Article
AN - SCOPUS:105047550771
SN - 0928-8910
VL - 33
JO - Automated Software Engineering
JF - Automated Software Engineering
IS - 4
M1 - 109
ER -