Summary

I am a PhD student co-supervised by Véronique Bruyère from the Computer Science department at the University of Mons (UMONS) and by Guillermo A. Perez from the Computer Science department at the University of Antwerp (UAntwerpen). My PhD Thesis started in October 2020 and is funded by the F.R.S.-FNRS. My research interests include

  • One-counter automata learning;
  • Formal verification, using automata;
  • Game theory

Research experience

PhD Thesis

Oct 2020 - Present
UMONS (University of Mons) and UAntwerpen (University of Antwerp), Belgium

Title: Improvement of the state of the art regarding the theory of learning algorithms for automata models extended with resources and its applications to black-box model-checking.
Supervisors: Véronique Bruyère (UMONS) and Guillermo A. Perez (UAntwerpen).
F.R.S.-FNRS Research Fellow.

Master's Thesis

Dec 2019 - Jun 2020
UMONS, Belgium

Title: Efficient Learning of Automata and Automata with One Counter.
Supervisor: Véronique Bruyère (UMONS). Grade: 19/20.

Internship

Sep 2019 - Dec 2019
UAntwerpen, Belgium

Implementation of an active learning algorithm for Visibly One-Counter Automata.
Supervisor: Guillermo A. Perez.

Research initiation internship

Aug 2018
UMONS, Belgium

Subject: Efficient algorithms for Nash equilibrium computation.
Supervisors: Aline Goeminne, Thomas Brihaye, Véronique Bruyère, and Hadrien Mélot.

Publications

Peer-reviewed conference proceedings

  • Learning Realtime One-Counter Automata: Véronique Bruyère, Guillermo A. Pérez, and Gaëtan Staquet, 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 16 (long version: 48) pages, 2022. [PDF] [arXiv (long version)]
  • Optimization of Answer Set Programs for Consistent Query Answering by Means of First-Order Rewriting: Aziz Amezian El Khalfioui, Jonathan Joertz, Dorian Labeeuw, Gaëtan Staquet and Jef Wijsen, 29th ACM International Conference on Information and Knowledge Management (CIKM), 2020. [ACM Digital Library]

Supervision

Introductory research internship

Christophe Grandmont

Aug 2021
Solving generalized parity games using a symbolic representation. Co-supervised with Clément Tamines, and Véronique Bruyère.

Projects

Benchmarks for Learning Realtime One-Counter Automata [link]
  • Implementation of an active automata learning algorithm dedicated to realtime one-counter automata, and benchmarks based on randomly generated automata and on JSON documents.
  • See our paper "Learning Realtime One-Counter Automata" for more information.
Master's Thesis
  • Title: Efficient Learning of Automata and Automata with One Counter.
  • Supervisor: Véronique Bruyère (UMONS).
LearningVCA [link]

Talks

Attended events

Teaching

Logic programming

Teaching assistant
BA3 Computer Science
Second semester of academic year 2021 - 2022
Teaching assistant supervising the practical sessions (Prolog).

Functional programming

Teaching assistant
BA3 Computer Science and BA2 Mathematics
First semester of academic year 2021 - 2022
Teaching assistant supervising the practical sessions (Scheme).

Challenges in Artificial Intelligence

Teaching assistant
MSc Computer Science
First semester of academic year 2020 - 2021
Teaching assistant supervising the practical sessions.

Programming and Algorithms I

Student teaching assistant
BA1 Computer Science, BA1 Mathematics, and BA2 Physics
First semester of academic years 2018 - 2019, and 2019 - 2020
Student teaching assistant supervising the practical sessions (Python 3).

Programming and Algorithms II

Student teaching assistant
BA1 Computer Science, and BA1 Mathematics
Second semester of academic years 2018 - 2019, and 2019 - 2020
Student teaching assistant supervising the practical sessions (Java 11).

Programming and Algorithms I and II

Student tutor
BA1 Computer Science, BA1 Mathematics, and BA2 Physics
August 2016
Gave courses to students retaking an exam.

Miscellaneous

Programming contests

During the academic year 2016-2017, I won the 454th place (out of 5558) in University CodeSprint, and my team won the 43d place in the Benelux Algorithm Programming Contest (BAPC).