We present an algorithm for synthesizing a context-free grammar encoding the language of valid program inputs from a set of input examples and blackbox access to the program. Our algorithm addresses shortcomings of existing grammar inference algorithms, which both severely overgeneralize and are prohibitively slow. Our implementation, GLADE, leverages the grammar synthesized by our algorithm to fuzz test programs with structured inputs. We show that GLADE substantially increases the incremental coverage on valid inputs compared to two baseline fuzzers.
Bastani et al. REF present an algorithm to synthesize a context-free grammar given a set of input examples, which is then used to generate new inputs for fuzzing.
Synthesizing program input grammars
PLDI 2017
Computer Science