Breaking Parsers: Mutation-based Generation of Programs with Guaranteed Syntax ErrorsNEW IDEABest Paper
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.
Mon 21 Oct Times are displayed in time zone: Beirut change
16:00 - 17:30: Session 4: ParsingSLE 2019 at Templars Chair(s): Adrian JohnstoneRoyal Holloway, University of London | |||
16:00 - 16:30 Talk | Multiple Lexicalisation - A Java Based Study SLE 2019 Elizabeth ScottRoyal Holloway University of London, Adrian JohnstoneRoyal Holloway, University of London | ||
16:30 - 16:50 Talk | Breaking Parsers: Mutation-based Generation of Programs with Guaranteed Syntax ErrorsNEW IDEABest Paper SLE 2019 Moeketsi RaselimoStellenbosch University, Jan TaljaardStellenbosch University, Bernd FischerStellenbosch University | ||
16:50 - 17:20 Talk | Default disambiguation for online parsers SLE 2019 DOI Pre-print |