Sylvain Schmitz Professor of computer science, Université de Paris Junior member of IUF Works at IRIF in the automata and applications and the modelling and verification teams address IRIF, case 7014 Université de Paris 75205 Paris Cedex 13, France office 3048 phone +33 (0)1 57 27 92 16 email sylvain.schmitz@irif.fr Research keywords logic, well quasi orders, verification, formal languages, database theory talks; upcoming talks: no upcoming talks scheduled publications (); latest: Ranko Lazić and Sylvain Schmitz. The ideal view on Rackoff's coverability technique. Information and Computation, 2020. In press. Mirna Džamonja, Sylvain Schmitz, and Philippe Schnoebelen. On ordinal invariants in well quasi orders and finite antichain orders. In Well-quasi orders in computation, logic, language and reasoning, Trends in Logic 53, pages 29–54. Springer, 2020. PhD students Aliaume Lopez (2019–); joint supervision with Jean Goubault-Larrecq Anthony Lick (2016–2019); joint supervision with David Baelde; defended on July 8, 2019 Simon Halfon (2015–2018); joint supervision with Philippe Schnoebelen; defended on June 29, 2018 main funding IUF junior (2018–2023) ANR BraVAS (2017–2020) ANR PRODAQ (2015–2019) ANR ReacHard (2011–2014) ANR AVeriSS (2007–2009) activities Steering committee of GT-Verif PC member for conferences RP'20 (co-chair), AutoMathA'20, MFCS'20, MOVEP'20, NAACL-HLT'19 (theory and formalisms), LICS'18, Petri nets'17, STACS'17, and workshops RP'15, RP'12, CSLP'12, LDTA'12, LDTA'11, TAG+10, TAG+9 organizing committees of RP'20 (chair), Highlights 2014 (co-chair), GT-Vérif 2014, GT-Vérif 2013 (co-chair), CIAA'05 Teaching Bachelor of computer science 3rd year logic course Master of computer science 1st year advanced databases tutorials Preparation to agregation lessons Here is some course material from previous years.