%0 Conference Proceedings
%T H-Fuzzing: A New Heuristic Method for Fuzzing Data Generation
%+ National Key Laboratory of Science and Technology on Information System Security
%+ Beijing Institute of System Engineering
%A Zhao, Jinjing
%A Wen, Yan
%A Zhao, Gang
%Z Part 1: Session 1: Filesystems and Data
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 8th Network and Parallel Computing (NPC)
%C Changsha,, China
%Y Erik Altman
%Y Weisong Shi
%I Springer
%3 Network and Parallel Computing
%V LNCS-6985
%P 32-43
%8 2011-10-21
%D 2011
%R 10.1007/978-3-642-24403-2_3
%K Fuzzing test
%K static analysis
%K dynamic analysis
%K program slicing
%K control flow graph
%K program security testing
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 10
%Z WG 10.3
%2 https://inria.hal.science/hal-01593032/document
%2 https://inria.hal.science/hal-01593032/file/978-3-642-24403-2_3_Chapter.pdf
%L hal-01593032
%U https://inria.hal.science/hal-01593032
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-AICT
%~ IFIP-TC
%~ IFIP-TC10
%~ IFIP-NPC
%~ IFIP-WG10-3
%~ IFIP-LNCS-6985