Oct 2026· Proceedings of the ACM on Software Engineering· Vol 3, pp. 3155 - 3178· 0 citations· 81 references
TL;DR
Repair-driven greybox fuzzing is presented, a new approach to greybox fuzzing that combines the strengths of unstructured, byte-level input mutation and grammar-guided input generation that promises to improve bug-finding ability for systems under test such as programming language interpreters that consume highly structured inputs.
Abstract
We present repair-driven greybox fuzzing, a new approach to greybox fuzzing that combines the strengths of unstructured, byte-level input mutation and grammar-guided input generation. By increasing input diversity while preserving input validity, repair-driven fuzzing promises to improve bug-finding ability for systems under test such as programming language interpreters that consume highly structured inputs. Our idea is to first mutate an input using a standard byte-level mutator, typically leading to an invalid input, and then repair the input using a grammar. Aggressively breaking and then repairing an input provides an effective way to reach parts of the input space that would be left unexplored by both byte-level and idiomatic grammar-based mutations. We put this idea into practice via RepairFuzz, a new greybox fuzzer based on AFL++, leveraging the byte level mutations of AFL++ and using the CPCT+ error recovery algorithm for input repair. We present experiments applying RepairFuzz to six SUTs covering four programming language input formats (Lua, PHP, JavaScript and Ruby), and present an experimental comparison with AFL++, Grammarinator and Nautilus, the state-of-the-art in standard greybox fuzzing and grammar-guided fuzzing. Our evaluation shows that RepairFuzz was able to find 13 confirmed bugs that were previously unknown, including 9 that were not found by AFL++, Grammarinator or Nautilus. Further, RepairFuzz yields absolute increases in code coverage for several SUTs and substantial complementary code coverage across all.
This paper presents hybrid generator space fuzzing, a method that combines the strengths of hybrid fuzzing and generator-based fuzzing to improve the syntactic validity and semantic diversity of test inputs and implements GenEvo, an LLM-driven hybrid generator space fuzzer.
Si-Wei Wei, Shi-Hao Zhu, Rui-Jie Meng et al.· Proceedings of the 41st IEEE...· 1 citation
Fuzzing finds bugs by testing software behavior with high volumes of input. To create semantically valid inputs for different targets, traditional fuzzers require significant engineering effort. LLM-based fuzzing approaches can be adapted to create inputs for a wide range of software but introduce new issues: every tes...
Lu Maltsis· Companion Proceedings of the...· 0 citations
Modern generator-based fuzzing techniques combine lightweight input generators with coverage-guided mutation as a method of exploring deep execution paths in a target program. A complementary approach in prior research focuses on creating highly customized, domain-specific generators that encode structural and semantic...
Vasudev Vikram, Rohan Padhye· Proceedings of the 41st IEEE...· 2 citations
Compiler fuzzing is critical for ensuring the reliability of modern optimizing compilers. However, traditional generators and raw Large Language Model (LLM) outputs often yield syntactically invalid or low-value programs, incurring significant computational overhead. In this paper, we present BanditFuzz, an end-to-end...
Dong-Hui Li, Ying-Ying Li, Jin-Long Xu et al.· Proceedings of the 41st IEEE...· 0 citations
Formal verification using verification-aware languages, like Dafny, ensures a program's conformance to its specification. Assuming a correct and complete specification, a verification failure may indicate an implementation fault that the developer must identify and correct. However, debugging verification failures is p...
Isabel Amaral, Álvaro F. Silva, João F. Ferreira et al.· Proceedings of the 7th Inter...· 0 citations
We present Dredd, a new tool that supports source-level mutation testing for large C/C++ codebases. Following the mutant schemata approach, Dredd applies a source-to-source transformation to a chosen set of files from the system under test (SUT), rewriting them into a metamutant that simulates a large number of distinc...
Alastair F. Donaldson, James Lee-Jones, Jonathan Foo· Companion Proceedings of the...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.