I completed a PhD in the Computer Science department of the University of Mons (UMONS) in Belgium. I was co-supervised by Véronique Bruyère (UMONS) and Jean-François Raskin (Université libre de Bruxelles). My research interests regarded solving parity and generalized parity games efficiently and notions of equilibria in non-zero-sum multiplayer games. I am also very interested in the field of machine learning.

Interests

- Algorithmic Game Theory
- Equilibria Notions in Games
- Reactive System Synthesis
- Formal Verification
- Machine Learning

Education

PhD in Computer Science, 2022

University of Mons

University Certificate in AI, 2020

University of Mons

MSc in Computer Science, 2018

University of Mons

BSc in Computer Science, 2016

University of Mons

Teaching Assistant

- Directed the project for the course Algorithmics and Bioinformatics (Java 8 program for DNA fragment assembly).
- Obtained very positive student evaluation (good to excellent).
- Supervised 2 research internships on symbolic solving of games using Binary Decision Diagrams.
- Advised a Master student for a project on window techniques for solving parity games.

Software Developer Intern

- Designed and implemented a constraint programming model for network generation in a radio configuration tool (using Java 8 and the Choco Solver constraint programming library).

Student Teaching Assistant

- Tutored students for the Programming and Algorithmics I & II courses (Python 3 & Java 8).

Pareto-Rational Verification.
CONCUR 2022.

(2022).
(2022).
(2022).
Stackelberg-Pareto Synthesis.
CONCUR 2021.

(2021).
(2021).
**2022**

- CONCUR 2022: 33rd International Conference on Concurrency Theory, Warsaw, Poland
- Highlights of Logic, Games and Automata, Paris, France
- Workshop - Current Trends in Graph and Stochastic Games, Maastricht, the Netherlands

**2021**

- Journées annuelles du GT Vérification du GDR IM, Gif-sur-Yvette, France
- Highlights of Logic, Games and Automata, Aachen, Germany, online
- CONCUR 2021: 32nd International Conference on Concurrency Theory, Paris, France, online
- SYNT 2021: 10th Workshop on Synthesis (CAV 2021 Workshop), Los Angeles, USA, online
- Reinforcement Learning: from Theory to Practice, The Alan Turing Institute, online
- Theoretical Foundations of Computer Systems Boot Camp, online

**2020**

- GandALF: Games, Automata, Logics, and Formal Verification, online
- Highlights of Logic, Games and Automata, online
- Modelling and Verification of Parallel Processes, online
- Dynamics and Information Workshop, Tel-Aviv, Israel

**2019**

- Highlights of Logic, Games and Automata, Warsaw, Poland
- 13th International Conference on Reachability Problems, Brussels, Belgium
- LearnAut: Learning au Automata (LICS’19 workshop), Vancouver, Canada
- MoRe: Multi-objective Reasoning in Verification and Synthesis, Vancouver, Canada
- Workshop - Theory and Algorithms in Graph and Stochastic Games, Mons, Belgium
- MdC: Mardi des Chercheurs, Mons, Belgium
- CFV Seminar, Brussels, Belgium
- MFV Seminar, Brussels, Belgium

**2018**

- Highlights of Logic, Games and Automata, Berlin, Germany
- MOVEP Summer School, Cachan, France
- FoPSS Logic And Learning Summer School, Oxford, United Kingdom

.js-id-Deep-Learning#### SPORE (Symbolic Partial sOlvers for REalizability)

#### Time Series Forecasting Using Neural Networks and Statistical Models

#### Forest fire detection using CNN

#### Game solver

A prototype symbolic implementation of partial solvers for (generalized) parity games applied to LTL realizability.

The goal of this project is to forecast future web traffic for Wikipedia articles using different techniques ranging from statistical models to deep neural networks.

Using convolutional neural networks (CNN) to detect the presence or the start of a forest fire in an image. This model could be applied to detect a fire or a start of a fire from (aerial) surveillance footage of a forest.

Python implementation of reachability/safety games solver as well as weak parity and strong parity games solver.