International Colloquium on Automata, Languages and Programming · 2024
Cited
2
Resume (English only)
Academic Achievements
Contributed to the development of several formal proof libraries and algorithms, including K4-free = TW2 in graph theory, Chebyshev rigorous approximations, a new library for impredicative coinduction in Coq, and Relation Algebra and KAT in Coq. Published numerous papers and presented at various academic conferences and research schools.
Research Experience
Held multiple teaching and research positions at ENS Lyon, covering areas such as relation algebraic methods, coinduction and Coq, certified approximation, automata, coinduction, and relation algebra.
Background
CNRS researcher, in charge of the Plume team. Research interests include Kleene algebra, automata, logic, bisimulation, pi, lambda, ccs, coalgebra, up-to techniques, and Coq.