Programs expecting structured inputs often consist of both a syntactic analysis stage, which parses raw input, and a semantic analysis stage, which conducts checks on the parsed input and executes the core logic of the program. Generator-based testing tools in the lineage of QuickCheck are a promising way to generate random syntactically valid test inputs for these programs. But often, to effectively explore the semantic analysis stage, these tools require tedious manual tuning of the generators. We present Zest, a technique which automatically guides QuickCheck-like random input generators to better explore the semantic analysis stage of test programs. Zest converts random input generators into deterministic parametric input generators. We present the key insight that mutations in the untyped parameter domain map to structural mutations in the input domain. Zest leverages this insight to perform generator-based mutational fuzzing, directed by program feedback in the form of code coverage and input validity. We implement Zest in Java and evaluate it against AFL and QuickCheck on five real-world benchmarks: Maven, Ant, BCEL, the Google Closure compiler, and Mozilla Rhino. We find that Zest outperforms baseline techniques in terms of code coverage within the semantic analysis stages of these benchmarks. Further, we find 10 new bugs in the semantic analysis stage across these benchmarks. Zest is the most effective technique in finding these bugs, requiring at most 10 minutes on average to find each such bug.
Fri 19 Jul Times are displayed in time zone: (GMT+08:00) Beijing, Chongqing, Hong Kong, Urumqi change
|16:00 - 16:22|
Rohan PadhyeUniversity of California, Berkeley, Caroline LemieuxUniversity of California, Berkeley, Koushik SenUniversity of California, Berkeley, Mike PapadakisUniversity of Luxembourg, Yves Le TraonUniversity of LuxembourgLink to publication DOI Pre-print
|16:22 - 16:45|
|16:45 - 17:07|
|17:07 - 17:30|