About
I just finished my PhD in LaBRI, Bordeaux, under the supervision of Anca Muscholl and Igor
Walukiewicz.
My thesis is about verification and control problems over models of distributed systems,
but I am interested in everything related to automata, logics and games.
Before that, from 2017 to 2021, I was a student at the ENS Paris-Saclay.
Publications
-
On the Minimisation of Deterministic and History-Deterministic
Generalised (co)Büchi Automata
with Antonio Casares, Denis Kuperberg, Olivier Idir and Aditya Prakash, CSL 2025
pdf
-
The Complexity of Simplifying ω-Automata through the Alternating Cycle
Decomposition
with Antonio Casares, MFCS 2024
pdf
-
Verification of Population Protocols with Unordered Data
with Steffen van Bergerem, Roland Guttenberg, Sandra Kiefer, Nicolas Waldburger and Chana
Weil-Kennedy, ICALP 2024
pdf
-
Parameterized Broadcast Networks with Registers:
from NP to the Frontiers of Decidability
with Lucie Guillou and Nicolas Waldburger, FoSSaCS 2024
pdf
-
Model-checking parametric lock-sharing systems against regular
constraints
with Anca Muscholl and Igor Walukiewicz, CONCUR 2023.
pdf
-
Distributed controller synthesis for deadlock avoidance.
with Hugo Gimbert, Anca Muscholl and Igor Walukiewicz, ICALP 2022.
pdf
-
Keyboards as a New Model of Computation.
with Yoan Géran, Bastien Laboureix and Valentin D. Richard, MFCS 2021.
pdf /
arxiv with french version
-
Responsibility and verification: Importance value in temporal logics.
with Christel Baier, Florian Funke, Simon Jantsch and Stefan Kiefer, LICS 2021.
pdf
-
From LTL to rLTL Monitoring: Improved Monitorability through Robust
Semantics.
with Daniel Neider, Maximilian Schwenger, Paulo Tabuada, Alexander Weinert and Martin
Zimmermann, HSCC 2020.
pdf / journal version
-
The Keys to Decidable HyperLTL Satisfiability: Small Models or Very
Simple Formulas.
with Martin Zimmermann, CSL 2020
pdf
-
On Finite Monoids over Nonnegative Integer Matrices and Short Killing
Words.
with Stefan Kiefer, STACS 2019.
pdf / journal
version
Unpublished work
-
Model-checking lock-sharing systems against regular constraints
pdf
-
Learning temporal formulas from examples is hard
with Nathanaël Fijalkow and Guillaume Lagarde.
pdf
-
Controlling a Random Population is EXPTIME-hard
with Mahsa Shirmohammadi and Patrick Totzke.
pdf
Talks
Despite some differences between presentations, I am only giving one representative set of slides
for each subject.
-
Verification and synthesis of distributed systems with weak synchronisation
PhD defense (November 2024)
slides
-
Verification and controller synthesis for dynamic systems with locks and
variables
Highlights (September 2024), LMF InFormal seminar (October 2024),
IRISA seminar (October 2024), Synthesis days (November 2024)
slides
-
Verification of population protocols with unordered data
ICALP (July
2024), AlgoDist seminar at LaBRI (November 2024)
slides
-
Strategy shapes for population games
Dagstuhl on stochastic games (June
2024)
slides
-
Minimisation of (history-)deterministic generalised (co-)Büchi automata
MTV seminar at LaBRI (May 2024)
slides
-
Proving hardness of LTL learning
GT DAAL (April 2024)
slides
-
Simplifying acceptance conditions of omega-automata
ATLAS (April 2024)
slides
-
Parameterized Broadcast Networks with Registers
MTV seminar at LaBRI
(June 2023), Highlights (July 2023), YR-CONCUR (September 2023), Seminar at LIS (september 2023)
slides
-
Model-checking lock-sharing systems against regular constraints
GT DAAL
(April 2023), CONCUR (September 2023)
slides
-
Distributed controller synthesis for lock-sharing systems
Seminar at LMF
(April 2022), Highlights (June 2022), ICALP (July 2022), RP (October 2022), Seminar at IRISA
(February 2023)
slides
-
Keyboards
Computer Science department seminar at ENS Paris-Saclay (February 2021), QuantLA seminar at TU
Dresden (April 2021), MFCS (August 2021), LX Seminar at LaBRI (September 2021)
slides
-
Responsibility in verification
LICS (June 2021), Highlights (September 2021), ARPE internship defense (September 2021), MTV
seminar at LaBRI (October 2021), IRIF seminar (January 2022)
slides
-
Limits of decidability for HyperLTL satisfiabilty
M1 internship defense (September 2019), CSL (January 2020)
slides
-
Killing words
L3 internship defense (September 2018), STACS (March 2019), Verification seminar at IRIF
(February 2020)
slides
Teaching (as an assistant)
-
Jeux, synthèse et contrôle
(replacement for three classes), Master 2 Informatique, ENSEIRB, 2023/2024
-
Programmation C
, Licence 2 Informatique, 2023/2024
-
Techniques d'algorithmique et de programmation
, Licence 3 Informatique, 2022/2023
-
Calculabilité et complexité
, Master 1 Informatique, 2022/2023
-
Algorithmique et programmation fonctionnelle
, Licence 2 Maths-Info, 2021/2022