This action will delete this post on this instance and on all federated instances, and it cannot be undone. Are you certain you want to delete this post?
New post: Test-case Reducers Are Underappreciated Debugging Tools. The more I've used these tools, the more ways I realise they can be used! This post starts at the basics and works up to things like reducing on properties other than just the length of the input. https://tratt.net/laurie/blog/2026/test_case_reducers_are_underappreciated_debugging_tools.html
I have been selected into the inaugural class of the ACM SIGSOFT Software Engineering Academy: https://www2.sigsoft.org/academy/inaugural-class.html
Rahul Gopinath posted Jul 12, 2026
Can input reduction with delta debugging be faster without sacrificing 1-minimality?
We revisited the ddmin family and found the culprit: a chronic case of unnecessary restarts.
Meet Dr. DD: 1-Minimal Isolation of Failure Causes via Deferred Restarts
A drop-in replacement for ddmin that preserves 1-minimality while avoiding redundant oracle calls, accepted at ISSRE 2026. Joint work with Aarush Kumbhakern, Feiyang Chen, Danushka Liyanage, Xi Wu, Mohammad Amin Alipour, and Rahul Gopinath (me).
Read it here: https://rahul.gopinath.org/resources/issre2026/kumbhakern2026.pdf
Rahul Gopinath posted Jul 1, 2026
Our work "Maximal Format-Free Data Repair" has been accepted for publication at ASE 2026. This is a joint work by Jack Luo, Xi Wu, Hong Jin Kang, Alan Fekete, and Rahul Gopinath (me). It shows how to repair syntactically rich text data with minimal effort even when the syntax specification is unavailable. It combines passive and active blackbox grammar inference to achieve this feat.
You can read it here.
Rahul Gopinath posted Jun 24, 2026
A tutorial of the #TTT algorithm for inferring regular input grammars using active membership queries. I had posted the L* algorithm (active grammar inference using membership queries), and the RPNI algorithm (passive grammar inference using examples) earlier.
This is part of my ongoing effort to document various algorithms relating to grammars including various algorithms for parsing, random sampling of fixed size strings, and grammar fuzzing.
Note: Pyodide takes a little time to initialize, but it should be faster to initialize than spinning up the binder service from Jupyter (but slower to execute).
https://rahul.gopinath.org/post/2026/06/09/ttt-grammar-inference/
Rahul Gopinath posted May 21, 2026
A Simple Runtime Invariant Miner: A tutorial on how to build a Daikon like program invariant miner for Python.
At ICST workshops today, giving a keynote on how test generation and dynamic analysis will boost AI agents: https://conf.researchr.org/details/ise-2026/ise-2026/1/The-power-of-experimentation
Rahul Gopinath posted May 20, 2026
A tutorial of the #RPNI algorithm for inferring regular input grammars when given only accepted and rejected examples (positive and negative examples). I had posted the L* algorithm before.
This is part of my ongoing effort to document various algorithms relating to grammars including various algorithms for parsing, random sampling of fixed size strings, and grammar fuzzing.
Note: Pyodide takes a little time to initialize, but it should be faster to initialize than spinning up the binder service from Jupyter (but slower to execute).
https://rahul.gopinath.org/post/2025/10/24/rpni-learning-regular-languages/
Rahul Gopinath posted Oct 24, 2025
Rahul Gopinath posted Oct 24, 2025