OREGON STATE UNIVERSITY

You are here

Taming compiler fuzzers

TitleTaming compiler fuzzers
Publication TypeConference Paper
Year of Publication2013
AuthorsChen, Y., A. Groce, C. Zhang, W-K. Wong, X. Z. Fern, E. Eide, and J. Regehr
Conference NameACM SIGPLAN Conference on Programming Language Design and Implementation
Pagination197-208
Date Published06/2013
PublisherSeattle, Washington
Abstract

Aggressive random testing tools ("fuzzers") are impressively effective at finding compiler bugs. For example, a single test-case generator has resulted in more than 1,700 bugs reported for a single JavaScript engine. However, fuzzers can be frustrating to use: they indiscriminately and repeatedly find bugs that may not be severe enough to fix right away. Currently, users filter out undesirable test cases using ad hoc methods such as disallowing problematic features in tests and grepping test results. This paper formulates and addresses the fuzzer taming problem: given a potentially large number of random test cases that trigger failures, order them such that diverse, interesting test cases are highly ranked. Our evaluation shows our ability to solve the fuzzer taming problem for 3,799 test cases triggering 46 bugs in a C compiler and 2,603 test cases triggering 28 bugs in a JavaScript engine.