Breaking Parsers: Mutation-based Generation of Programs with Guaranteed Syntax Errors
Grammar-based test case generation has focused almost exclusively on generating syntactically correct programs (i.e., positive tests) from a reference grammar but a positive reference test suite cannot detect when the unit under test accepts words outside the language (i.e., false positives). Here, we investigate the converse problem and describe two mutation-based approaches for generating programs with guaranteed syntax errors (i.e., negative tests). Word mutation systematically modifies positive tests by deleting, inserting, substituting, and transposing tokens in such a way that at least one impossible token pair emerges. Rule mutation applies such operations to the symbols of the right-hand sides of productions in such a way that each derivation that uses the mutated rule yields a word outside the language.
This program is tentative and subject to change.
Mon 21 Oct
|16:00 - 16:30|
|16:30 - 17:00|
|17:00 - 17:30|