Sylvain SchmitzView profile
Professor
Sylvain Schmitz is a Professor of Computer Science at Université Paris Cité, affiliated with the IRIF institute. He leads the Automata and Applications team and contributes to modeling and verification research. Key Research Areas: Logic, Well Quasi Orders, Program Verification, Formal Languages, Database Theory Grants: ANR BraVAS (2017–2022), ANR PRODAQ (2015–2019), ANR ReacHard (2011–2014), ANR AVeriSS (2007–2009) His work focuses on the algorithmic complexity of well-quasi-orders, with applications to vector addition systems, Petri nets, and complexity hierarchies. He has delivered lectures on Algorithmic Aspects of WQO Theory (MPRI), Model-Checking Finite Structures (LMFI), and logic for the agrégation preparation. Recent publications analyze complexity bounds for vector addition systems and lossy counter machines, often leveraging ideal decompositions of well-quasi-orders. His 2024 ICALP paper with Lia Schütze addresses strongly monotone descending chains over ℕᵈ, while 2024 LICS work with Anand et al. explores unboundedness verification. Scientific Awards: IUF junior fellowship (2018–2023) He supervises PhD students Hector Buffière (2024–present), Aliaume Lopez (2019–2023), Anthony Lick (2016–2019), and Simon Halfon (2015–2018). He has served on steering committees for STACS (co-chair) and GT-Verif, and organized conferences like Highlights 2014.





