Improving Fuzzing Coverage with Execution Path Length Selection
Wenxi Zhang, Kazunori Sakamoto, Hironori Washizaki, Yoshiaki Fukazawa
Abstract
Wenxi Zhang, Kazunori Sakamoto, Hironori Washizaki, Yoshiaki Fukazawa
Abstract
Coverage-guided fuzzing is one of the most effective types of fuzz testing. Code coverage is an important parameter of performance evaluation of the coverage-guided fuzzing tools since normally higher coverage result means a higher chance of fault detection. To expand the overall code covered, based on previous basic block analysis, we propose a method for selecting the mutants of inputs that are able to execute some specific length of the execution path.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Coverage-guided fuzzing is one of the most effective types of fuzz testing. Code coverage is an important parameter of performance evaluation of the coverage-guided fuzzing tools since normally higher coverage result means a higher chance of fault detection. To expand the overall code covered, based on previous basic block analysis, we propose a method for selecting the mutants of inputs that are able to execute some specific length of the execution path.
Key concepts: Fuzz testing, Computer science, Code coverage, Path (computing), Block (permutation group theory), Selection (genetic algorithm), Code (set theory), Process (computing)