Ph.D. Students

  1. Maxime Bridoux. Agrégé informatique. PhD Student in Computer Science (2022-2025). Thesis entitled Inferring and exploiting necessary conditions for the existence of Darboux polynomials. Defense scheduled for November 28th 2025.

    Maxime’s thesis focused on exploring necessary conditions for the the existence of (algebraic) particular integrals also known as Darboux polynomials. The thesis provides a new, fully automated proof that the Liénard planar systems have no Darboux polynomials except for very special conditions (the famous Van der Pol oscillator belongs to this class). The inferred necessary conditions are furthermore exploited to speed up existing generation algorithms which operate up to a fixed bound on the total degree.

  2. Joan Thibault. Élève normalien. PhD in Computer Science (2019-2024). Thesis entitled Introduction to structure theory and its application to Boolean functions. Manuscript

    Joan’s thesis investigated concise and functional representations of Boolean functions as a special case of a broader class of objects he coined structures. This point of view not only unifies most existing variants of Binary Decision Diagrams but also suggests new ones in a principled way. He implemented several functional variants and showed encouraging experimental results supporting the claim that structure-based representations are competitive in practice.

  3. Christelle Kozaily. PhD in Mathematics (2018-2024). Thesis entitled On the existence of solutions for linear complementarity problems : a quest for effectively solving Linear Complementarity Systems. Manuscript

    Christelle’s thesis revolved around the well-posedness of linear complementarity systems (LCSs) which are hybrid dynamical systems constrained by particular non-linear conditions known as linear complementarity problems (LCP). Such quest requires a profound understanding of the solvability of these latter conditions as well as the characterizations of their related classes of matrices.

Research Internships

Typically 6 months for second year master students or equivalent.

  1. Maxime Bridoux. ENS Rennes. 08/02/2021–02/07/2021. Optimisation combinatoire de graphes : application à l’analyse structurelle. (co-supervised with Joan Thibault)
  2. Joan Thibault. Élève normalien. Feb. 2019–August 2019. Invariant Aware Binary Decision Diagrams.
  3. Hussein Albazzal. Université de Limoges. 11/03/2019–10/09/2019. Exact Semidefinite Approximations of Reachable Sets. (Supervised with Victor Magron, CNRS, LAAS, Toulouse.)
  4. Julien Morane. Élève ingénieur polytechnicien 3A. 02/04/2018–27/07/2018. Vérification et modélisation de systèmes micro-grides hybrides. (co-supervised with Benoît Caillaud.)

Short Internships

Typically 2 months for first year master students or equivalent.

  1. Damien Lejosne. Élève normalien. 19/05/2025–05/07/2025. Formal Verification of Electric Power Systems.
  2. Carybe Bégué. Élève normalien. 17/05/2021–24/07/2021. Efficient Checking of Positively Invariant Sets.
  3. Julien Duron. Élève normalien. 01/06/2020–31/07/2020. Weighted Adjacency Graphs for Boolean Functions. (co-supervised with Joan Thibault).
  4. Joan Thibault. Élève normalien. 02/07/2018–31/08/2018. Structural Analysis for Boolean Functions.

Projets de recherche M1 de l’ENS Rennes

Un projet de recherche est un travail de recherche sur toute l’année (de mi-septembre à fin avril)), proche d’un stage de recherche classique, mais en alternance des cours des étudiants. L’encadrement d’un projet ne donne pas lieu à une convention de stage ni à une rémunération de l’étudiant ou de l’encadrant.

  1. William Hasley. Sep 2025–Avril 2026. Feasability of Linear Complementarity Problems.
  2. Damien Lejosne. Sep 2025–Avril 2026. Simulation and Formal Verification of Electric Power Systems. (co-supervised with Benoît Caillaud)
  3. Clara Bégué and Julien Duron. Sep 2019–Avril 2020. Combinatorial optimization: Weighted Adjacency Propagation. (co-supervised with Joan Thibault)
  4. Aurèle Barrière, Solène Mirliaz, and Jérémy Thibault. Sep 2016–Avril 2017. Simulating Dynamic Logic Programs with Synchronous Languages.