H-Fuzzing: A New Heuristic Method for Fuzzing Data Generation - Network and Parallel Computing
Conference Papers Year : 2011

H-Fuzzing: A New Heuristic Method for Fuzzing Data Generation

Abstract

How to efficiently reduce the fuzzing data scale while assuring high fuzzing veracity and vulnerability coverage is a pivotal issue in program fuzz test. This paper proposes a new heuristic method for fuzzing data generation named with H-Fuzzing. H-Fuzzing achieves a high program execution path coverage by retrieving the static information and dynamic property from the program. Our experiments evaluate H-Fuzzing, Java Path Finder (JPF) and random fuzzing method. The evaluation results demonstrate that H-Fuzzing can use fewer iterations and testing time to reach more test path coverage compared with the other two methods.
Fichier principal
Vignette du fichier
978-3-642-24403-2_3_Chapter.pdf (971.24 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01593032 , version 1 (25-09-2017)

Licence

Identifiers

Cite

Jinjing Zhao, Yan Wen, Gang Zhao. H-Fuzzing: A New Heuristic Method for Fuzzing Data Generation. 8th Network and Parallel Computing (NPC), Oct 2011, Changsha,, China. pp.32-43, ⟨10.1007/978-3-642-24403-2_3⟩. ⟨hal-01593032⟩
166 View
253 Download

Altmetric

Share

More