Computer science student at ENS Rennes.
A nine-week internship.
👤Malo Monin, Mathieu Fehr, Tobias Grosser.
Part of the 2025 LLVM Developpers’ Meeting technical talk Automatically generating pattern rewrites in MLIR.
A year-long, one-day-a-week research project.
👤Malo Monin, Djamel E. Khelladi, Arnaud Blouin.
Large codebases with many contributors inevitably fall victim to the emergence of bugs and vulnerabilities. The precise way they are progressively introduced is not yet fully understood. Prior works have focused mainly on small amounts of Java codebases because they rely on slow tools and require human intervention. We propose and evaluate a novel process for extracting from a Git commit history the changes that induce a fixing commit and mining patterns from those changes. For tracking down fix-inducing changes, we use HyperAST, a tool that far surpasses its predecessors both in terms of memory usage and in terms of execution time.
An eight-week internship.
👤Malo Monin, Florian Angeletti.
Small mistakes in OCaml modules often result in huge error messages that are both hard to read and uninformative, although technically correct. Indeed, some modules contain many thousands of items. Detecting typos in field names can greatly improve error messages by providing a few “did you mean”-like suggestions to the user instead of a long list of missing fields. In order to display those hints in reasonable time, we have explored a way to compute them efficiently using an ingenious combination of commonly known data structures and algorithms.