H-fuzzing: a new heuristic method for fuzzing data generation

  • Authors:
  • Jinjing Zhao;Yan Wen;Gang Zhao

  • Affiliations:
  • Beijing Institute of System Engineerring, Beijing, China and National Key Laboratory of Science and Technology on Information System Security, Beijing, China;Beijing Institute of System Engineerring, Beijing, China and National Key Laboratory of Science and Technology on Information System Security, Beijing, China;Beijing Institute of System Engineerring, Beijing, China and National Key Laboratory of Science and Technology on Information System Security, Beijing, China

  • Venue:
  • NPC'11 Proceedings of the 8th IFIP international conference on Network and parallel computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.