Targeted Greybox Fuzzing with Static Lookahead Analysis
Not on the map. Why?
Abstract (arXiv)
Automatic test generation typically aims to generate inputs that explore new paths in the program under test in order to find bugs. Existing work has, therefore, focused on guiding the exploration toward program parts that are more likely to contain bugs by using an offline static analysis. In this paper, we introduce a novel technique for targeted greybox fuzzing using an online static analysis that guides the fuzzer toward a set of target locations, for instance, located in recently modified parts of the program. This is achieved by first semantically analyzing each program path that is explored by an input in the fuzzer's test suite. The results of this analysis are then used to control the fuzzer's specialized power schedule, which determines how often to fuzz inputs from the test suite. We implemented our technique by extending a state-of-the-art, industrial fuzzer for Ethereum smart contracts and evaluate its effectiveness on 27 real-world benchmarks. Using an online analysis is particularly suitable for the domain of smart contracts since it does not require any code instrumentation---instrumentation to contracts changes their semantics. Our experiments show that targeted fuzzing significantly outperforms standard greybox fuzzing for reaching 83% of the challenging target locations (up to 14x of median speed-up).
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 May 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 1.
2 papers.
- 2026Program Analysis Guided LLM Agent for Proof-of-Concept Generationcited by 1
- 2023Revisiting Neural Program Smoothing for Fuzzingcited by 0
- 2026Program Analysis Guided LLM Agent for Proof-of-Concept Generation8 Apr 2026
- 2023Revisiting Neural Program Smoothing for Fuzzing28 Sep 2023