A Reinforcement Learning Approach to Multi-Parametric Input Mutation for Fuzzing
Fuzzing is a software testing technique that involves providing a target program with unexpected or randomly generated input to observe its behavior. Traditional fuzzing techniques generate these inputs by randomly mutating predefined seed inputs. This random mutation technique operates without feedback from the target program, making it difficult to achieve high code coverage and detect vulnerabilities in the program. Reinforcement learning (RL) has emerged as a promising approach to address that limitation by learning the optimal mutation strategies. However, existing reinforcement learning-based fuzzing methods do not handle the mutation of multi-parametric test cases, where an input contains multiple parameters that require simultaneous yet distinct mutation strategies. This paper presents a reinforcement learning-based fuzzing technique that optimizes the mutation strategy for multi-parametric test cases. Unlike traditional approaches that apply a single mutation to generate the next input, our method mutates multiple parameters within a test case in a single mutation round, each with distinct mutation strategies. We evaluate the proposed method against traditional fuzzing techniques targeting a Power Generation Supervisory Control System, achieving a $70 \%$ code coverage and twice as many crashes. Additionally, we compare our approach with an existing reinforcement learning-based fuzzing method on two widely used targets (xmllint and tcpdump) and observe a $22 \%$ increase in code coverage for xmllint and a $43 \%$ increase for tcpdump, demonstrating substantial improvements in both code coverage and crash detection.
Authors
- Marie Louise Uwibambe
- Qinghua Li (ORCID: https://orcid.org/0000-0002-7734-6216)
- Akanksha Tyagi
Institutions
- University of Arkansas at Fayetteville (US)
Publication Details
- Published
- 2025-08-04
- DOI
- https://doi.org/10.1109/csr64739.2025.11129986
- Citations
- 1
- Primary Topic
- Evolutionary Algorithms and Applications
- Type
- article
- Field-Weighted Citation Impact
- 2.48
Funders
- National Science Foundation