Malo MONIN

Year-long, one-day-a-week research project at IRISA in the DiverSE team, supervized by Djamel Eddine Khelladi and 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.

Project report.

As part of my first year of master, I have followed courses in the following scientific fields:

• Compilation (Simon Rokicki),
• Model checking (Sophie Pinchinat),
• Software formal analysis and design (Thomas Genet),
• Knowledge representation and reasoning (Guillaume Aucher),
• Operating systems (Isabelle Puaut),
• Computational complexity theory (Thomas Seiller),
• Information theory (Éric Fabre),
• High performance computing (Martin Quinson),
• Epistemology (Filipe Drapeau-Contim, Olivier Ridoux),
• Computer science and Anthropocene (Simon Castellan).

In those courses, we used C, Java, Scala, the Isabelle/HOL proof assistant, and the NuSMV model checker.

I also had a course on making scientific presentations, as well as many seminars, and English classes.

Archived January 2025 M1 SIF webpage (in French).

Eight-week internship within the Cambium team, supervized by 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.

During this internship, we explored a way to improve OCaml module error messages by detecting spelling mistakes efficiently using an ingenious combination of algorithms and data structures. An implementation of this work in a fork of the OCaml compiler has been done, and will soon be proposed as a pull request on the main compiler branch.

Internship report.

As part of my third year of licence, I followed courses in the following scientific fields:

• Programming language theory (David Baelde),
• Formal languages (Gilles Lesventes),
• Algorithms (François Schwarzentruber),
• Logic (David Baelde),
• Systems programming (Martin Quinson),
• Architecture (Steven Derrien),
• Software engineering (Martin Quinson),
• Distributed algorithms (Davide Frey, George Giakkoupis),
• Digital image processing (Emmanuel Caruyer),
• Networks (Guillaume Didier),
• Probability and statistics (François Schwarzentruber).

In those courses, we used C, C++, OCaml, and Python, as well as RISC-V assembly.

I also had a pedagogy module, as well as many seminars, and English classes.

Archived February 2024 L3 SIF webpage (in French).

The MP2I/MPI pathway is part of the French “CPGE” system, which is an intensive two-year preparation program for entrance exams to grandes écoles, such as ENS Rennes. It corresponds to the first two years of licence. This pathway focuses specifically on mathematics, computer science, and physics. Students follow courses on computational complexity theory, formal languages, and logic. Studied languages are C, OCaml, and SQL.

Very high honors (mention « Très bien »). Majors: computer science, mathematics and physics & chemistry.

The computer science major introduces students to basic topics such as graph theory, recursion, and object oriented programming.