Publications

Conference Papers

MSR ' 24
( )
P3: A Dataset of Partial Program Fixes
Dirk Beyer,  Lars Grunske,  Matthias Kettl,  Marian Lingsch-Rosenfeld,  Moeketsi Raselimo

New dataset for the SE community: P3—a curated collection of incomplete bug fixes from real-world C projects. Each case documents multiple partial fixes leading to a complete fix, enabling reproducible studies on patch correctness, fix evolution, and automated repair.

SLE ' 21
( )
Automatic grammar repair
Moeketsi Raselimo,  Bernd Fischer

Meet gfixr: the first system to automatically repair context-free grammars. Using spectrum-based fault localization + targeted patches, it iteratively fixes faulty rules until all tests pass—shown effective on student grammars & even Pascal dialects.

SLE ' 20
( )
Grammar-based testing for little languages: an experience report with student compilers
Phillip van Heerden,  Moeketsi Raselimo,  Kostis Sagonas,  Bernd Fischer

In testing 61 student compilers, we found that no single grammar-based method matched the instructor’s suite, but combining systematic and random suites did better. By adding semantic mark-up tokens to grammars—encoding scope and type constraints—we could automatically generate tests that respect context, match instructor coverage, and expose more real bugs, including in the reference compiler.

SLE ' 20
( )
An interactive feedback system for grammar development (tool paper)
Chelsea Barraball,  Moeketsi Raselimo,  Bernd Fischer

gtutr: an interactive feedback system for learning context-free grammars with ANTLR. It clusters failing tests via sequence alignment, avoids overload, adds light gamification, and visualizes progress—helping students debug smarter, not harder.

SLE ' 19
( )
Spectrum-based fault localization for context-free grammars
Moeketsi Raselimo,  Bernd Fischer

New approach to debugging grammars! We present the first spectrum-based fault localization for context-free grammars—ranking suspicious rules via grammar spectra from LL/LR parsers. Evaluated on real & student grammars, it pinpoints faults in up to 40% of cases.

SLE ' 19
( )
Breaking parsers: mutation-based generation of programs with guaranteed syntax errors
Moeketsi Raselimo,  Jan Taljaard,  Bernd Fischer
⟬   ACM SIGPLAN Distinguished Paper ⟭  

We explore two mutation-based methods for generating programs with guaranteed syntax errors — word mutation (token edits) and rule mutation (grammar edits) — to complement traditional grammar-based testing focused only on valid programs.

Journal Papers

Elsevier: JSS ' 24
( )
Spectrum-based rule- and item-level localization of faults in context-free grammars.
Moeketsi Raselimo,  Bernd Fischer

New approach to debugging grammars! We present the first spectrum-based fault localization for context-free grammars—ranking suspicious rules via grammar spectra from LL/LR parsers. Evaluated on real & student grammars, it pinpoints faults in up to 40% of cases.

Workshop & Industry Papers

APR @ ICSE ' 25
( )
Which Inputs Trigger my Patch?
Martin Eberlein,  Moeketsi Raselimo,  Lars Grunske

Automated Program Repair is powerful, but can devs trust the fixes? We present AVICENNAPATCH: a tool that explains what inputs a patch actually fixes using differential testing + grammar-based constraints. More transparency, better trust in APR!

ATest @ ASE ' 23
( )
Static Test Case Prioritization Strategies for Grammar-Based Testing
Moeketsi Raselimo,  Lars Grunske,  Bernd Fischer

Grammar-based test generators can produce huge suites, but running them is costly. We show that simple prioritization strategies (e.g., input length, novel rule coverage, rule frequency) can improve fault detection vs. random ordering—though performance varies across suites.


Reports & Theses

SSRN ' 23
( )
Passive and Active Automatic Grammar Repair
Moeketsi Raselimo,  Bernd Fischer
PhD Dissertation ' 23
( )