Research

• keywords
  logic, well quasi orders, verification, formal languages, database theory
• talks; upcoming talks:

  no upcoming talks scheduled

• publications (); latest:

  • Sylvain Schmitz and Georg Zetzsche. Coverability is undecidable in one-dimensional pushdown vector addition systems with resets. In RP'19, LNCS 11674, pages 193–201. Springer, 2019.
  • Sylvain Schmitz. The parametric complexity of lossy counter machines. In ICALP'19, LIPIcs 132, pages 129:1–129:15. LZI, 2019.
  • David Baelde, Anthony Lick, and Sylvain Schmitz. Decidable XPath fragments in the real world. In PODS'19, pages 285–302. ACM Press, 2019.
  • Jérôme Leroux and Sylvain Schmitz. Reachability in vector addition systems is primitive-recursive in fixed dimension. In LICS'19. IEEE Press, 2019.
  • Petr Jančar and Sylvain Schmitz. Bisimulation equivalence of first-order grammars is ACKERMANN-complete. In LICS'19. IEEE Press, 2019.
• 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 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 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 the course material from previous years.