PLDI, ECOOP, Curry On, DEBS, LCTES and ISMM (series) / PLDI 2017 (series) / PLDI Research Papers /
Synthesizing Program Input Grammars
Mon 19 Jun 2017 11:40 - 12:05 at Actes, Civil Engineering - Learning and Probabilistic Chair(s): Swarat Chaudhuri
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.
Mon 19 Jun Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
Mon 19 Jun
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
10:50 - 12:30: Learning and ProbabilisticPLDI Research Papers at Actes, Civil Engineering Chair(s): Swarat ChaudhuriRice University | |||
10:50 - 11:15 Talk | DemoMatch: API Discovery from Demonstrations PLDI Research Papers Media Attached | ||
11:15 - 11:40 Talk | Similarity of Binaries through re-Optimization PLDI Research Papers | ||
11:40 - 12:05 Talk | Synthesizing Program Input Grammars PLDI Research Papers Osbert BastaniStanford University, Rahul SharmaMicrosoft Research, Alex AikenStanford University, Percy LiangStanford University Media Attached | ||
12:05 - 12:30 Talk | Compiling Markov Chain Monte Carlo Algorithms for Probabilistic Modeling PLDI Research Papers Media Attached |