Shaping Test Inputs in Grammar-Based Fuzzing
Open Access
- 11 September 2024
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1901-1905
Abstract
Fuzzing is an essential method for finding vulnerabilities. Conventional fuzzing looks across a wide input space, but it cannot handle systems that need intricate and specialized input patterns. Grammar-based fuzzing uses formal grammars to shape the inputs the fuzzer generates. This method is crucial for directing fuzzers to generate complicated inputs that adhere to syntactical requirements. However, existing approaches are biased towards certain input features, leading to significant portions of the solution space being under-explored or ignored. In this paper, we review the state-of-the-art methods, emphasizing the limitations of grammar-based fuzzing, and we provide a first approach for incorporating distribution sampling into fuzzing, accompanied by encouraging first findings. This work can represent a significant step towards achieving comprehensive input space exploration in grammar-based fuzzing, with implications for enhancing the robustness and reliability of the fuzzing targets.Keywords
Funding Information
- ERC S3 (101093186)
This publication has 10 references indexed in Scilit:
- Look Ma, No Input Samples! Mining Input Grammars from Code with Symbolic Parsing2024
- Input invariants2022
- Grammar-Based Fuzzing2018
- Algorithms and Theory of Computation Handbook, Volume 12009
- Automatic detection and exploitation of branch constraints for timing analysisIEEE Transactions on Software Engineering, 2002
- A Quasi-polynomial-time Algorithm for Sampling Words from a Context-Free LanguageInformation and Computation, 1997
- Generating words in a context-free language uniformly at randomInformation Processing Letters, 1994
- The complexity of computing the number of strings of given length in context-free languagesTheoretical Computer Science, 1991
- Uniform Random Generation of Strings in a Context-Free LanguageSIAM Journal on Computing, 1983
- On formai properties oî simple phreise structure grammarsSTUF - Language Typology and Universals, 1961