About me

I am currently working on my PhD thesis under the joint direction of Emmanuel Filiot (at Département d’Informatique, Université Libre de Bruxelles) and Pierre-Alain Reynier (at LIS, Aix-Marseille Université). I am mainly interested in the Verification and Automatic Synthesis of Computer Systems and its theoretical aspects: mathematical models and algorithms to analyze them. This includes, but is not limited to Automata, Logic and Game Theory. The goal of my thesis is to extend synthesis methods to systems operating with an infinite alphabet, more precisely over Data Words.

I am also interested in Sociology (I completed in 2017 the first year of a Master of Sociology at the EHESS), specifically in its methodology, on both the qualitative and quantitative aspects, and epistemology. I am particularly curious about its links with Computer Science and Mathematics, and about the epistemological consequences of recent discoveries in Complex Networks theory on the conceptualisation of social dynamics.

Interests

  • Verification
  • Automatic Synthesis
  • Automata
  • Logic
  • Game Theory

Education

  • M1 in General Sociology, 2017

    École des Hautes Études en Sciences Sociales

  • M2 in Computer Science, 2016

    Université Paris Diderot (MPRI)

  • L3 in Computer Science, 2014

    École Normale Supérieure de Lyon

Publications

My list of publications is also available on dblp.

Church Synthesis on Register Automata over Linearly Ordered Data Domains (STACS 2021)

The Church game for register automata over $(\mathbb{N}, \leq)$ is undecidable, but the one-sided game is, for deterministic ones.

Computability of Data-Word Transductions over Different Data Domains (submitted to the LMCS Special Issue dedicated to FoSSaCS 2020)

We extend the correspondence between computability and continuity over regular functions to the case of data words.

Synthesis of Data Word Transducers (LMCS Special Issue dedicated to CONCUR 2019)

Register automata are a counterpart of finite automata over data words. Synthesis algorithms can (sometimes) be extended to them.

On Computability of Data Word Functions Defined by Transducers (FoSSaCS 2020)

We extend the correspondence between computability and continuity over regular functions to the case of data words.

Synthesis of Data Word Transducers (CONCUR 2019)

Register automata are a counterpart of finite automata over data words. Synthesis algorithms can (sometimes) be extended to them.

The Complexity of Transducer Synthesis from Multi-Sequential Specifications (MFCS 2018)

Multi-sequential specifications are recognised by unions of sequential transducers. Their synthesis problem is PSpace-complete.

Two-Way Two-Tape Automata (DLT 2017)

Two-way two-tape automata are devices recognising relations over words. Alternating ones are not closed under complement.

Recent & Upcoming Talks

On Computability of Data Word Functions Defined by Transducers @ ETAPS 2021

We extend the correspondence between computability and continuity over regular functions to the case of data words.

On Computability of Data Word Functions Defined by Transducers @ HIGHLIGHTS 2020

We extend the correspondence between computability and continuity over regular functions to the case of data words.

On Computability of Data Word Functions Defined by Transducers @ MOVEP 2020

We extend the correspondence between computability and continuity over regular functions to the case of data words.

Teaching

Université libre de Bruxelles (2019-2020)

  • Informatique Fondamentale

Le matériel du cours est disponible en ligne sur l’ Université Virtuelle.

Université libre de Bruxelles (2018-2019)

  • Introduction to Language Theory and Compiling

All the course material is available online at the Université Virtuelle.

Aix-Marseille Université (2017-2018)

  • Algorithmique et Programmation
  • Programmation

All the course material is available online on AMETiCE.

Université libre de Bruxelles (2017-2018)

  • Introduction to Language Theory and Compiling

All the course material is available online at the Université Virtuelle.

Contact