Taming Compiler Fuzzers Public Deposited

http://ir.library.oregonstate.edu/concern/defaults/dz010r329

© ACM, 2013. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM SIGPLAN Notices, {VOL# 48, ISS# 6, (June 2013)}  http://doi.acm.org/10.1145/2491956.2462173

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • 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.
Resource Type
DOI
Date Available
Date Issued
Citation
  • Chen, Y., Groce, A., Zhang, C., Wong, W., Fern, X., Eide, E., & Regehr, J. (2013). Taming compiler fuzzers. ACM SIGPLAN Notices, 48(6), 197-207.
Series
Keyword
Rights Statement
Funding Statement (additional comments about funding)
Publisher
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Submitted by Deanne Bruner (deanne.bruner@oregonstate.edu) on 2013-09-11T00:15:50Z No. of bitstreams: 1 GroceAlexElectricalEngineeringComputerScienceTamingCompilerFuzzers.pdf: 345401 bytes, checksum: a8ed0dc5e140e69932f1771a2f71026b (MD5)
  • description.provenance : Approved for entry into archive by Deanne Bruner(deanne.bruner@oregonstate.edu) on 2013-09-11T00:18:27Z (GMT) No. of bitstreams: 1 GroceAlexElectricalEngineeringComputerScienceTamingCompilerFuzzers.pdf: 345401 bytes, checksum: a8ed0dc5e140e69932f1771a2f71026b (MD5)
  • description.provenance : Made available in DSpace on 2013-09-11T00:18:27Z (GMT). No. of bitstreams: 1 GroceAlexElectricalEngineeringComputerScienceTamingCompilerFuzzers.pdf: 345401 bytes, checksum: a8ed0dc5e140e69932f1771a2f71026b (MD5) Previous issue date: 2013-06

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items