{{page>academicon}} ===== Publications =====

==== 2024 ==== * Sylvain Schmitz and Lia Schütze. [[https://arxiv.org/abs/2310.02847|On the length of strongly monotone descending chains over ℕᵈ]]. In ICALP'24, LIPIcs 297, pages 153:1–153:19. LZI, 2024. * Ashwani Anand, Sylvain Schmitz, Lia Schütze, and Georg Zetzsche. [[https://arxiv.org/abs/2405.10296|Verifying unboundedness via amalgamation]]. In LICS'24. ACM Press, 2024. ==== 2022 ==== * Klara Nosan, Amaury Pouly, Sylvain Schmitz, Mahsa Shirmohammadi, and James Worrell. [[https://arxiv.org/abs/2106.01853|On the computation of the Zariski closure of finitely generated groups of matrices]]. In ISSAC'22, pages 129–138. ACM, 2022. ==== 2021 ==== * Ranko Lazić and Sylvain Schmitz. [[https://hal.inria.fr/hal-01176755|The ideal view on Rackoff's coverability technique]]. Information and Computation 227, 2021. * Sylvain Schmitz. [[https://drops.dagstuhl.de/opus/volltexte/2021/13437/|Branching in Well-Structured Transition Systems (Invited Talk)]]. In CSL'21, LIPIcs 183, pages 3:1–3:3. LZI, 2021. ==== 2020 ==== * Jérôme Leroux and Sylvain Schmitz. Accessibilité des systèmes d'addition de vecteurs. In Informatique Mathématique : Une photographie en 2020, pages 35–79. CNRS Éditions, 2020. * Mirna Džamonja, Sylvain Schmitz, and Philippe Schnoebelen. [[https://arxiv.org/abs/1711.00428|On ordinal invariants in well quasi orders and finite antichain orders]]. In /*Peter Schuster, Monika Seisenberer, and Andreas Weiermann (eds.),*/ Well-quasi orders in computation, logic, language and reasoning, Trends in Logic 53, pages 29–54. Springer, 2020. ==== 2019 ==== * Sylvain Schmitz and Georg Zetzsche. [[https://arxiv.org/abs/1906.07069|Coverability is undecidable in one-dimensional pushdown vector addition systems with resets]]. In /*Emmanuel Filliot, Raphaël Jungers, and Igor Potapov (eds.),*/ RP'19, LNCS 11674, pages 193–201. Springer, 2019. * Sylvain Schmitz. [[https://hal.archives-ouvertes.fr/hal-02020728|The parametric complexity of lossy counter machines]]. In /*Christel Baier, Paola Flocchini, and Stefano Leonardi (eds.),*/ ICALP'19, LIPIcs 132, pages 129:1–129:15. LZI, 2019. * David Baelde, Anthony Lick, and Sylvain Schmitz. [[https://hal.inria.fr/hal-01852475|Decidable XPath fragments in the real world]]. In /* Christoph Koch (ed.),*/ PODS'19, pages 285–302. ACM Press, 2019. * Jérôme Leroux and Sylvain Schmitz. [[https://arxiv.org/abs/1903.08575|Reachability in vector addition systems is primitive-recursive in fixed dimension]]. In LICS'19. IEEE Press, 2019. * Petr Jančar and Sylvain Schmitz. [[https://arxiv.org/abs/1901.07170|Bisimulation equivalence of first-order grammars is ACKERMANN-complete]]. In LICS'19. IEEE Press, 2019. ==== 2018 ==== * Béatrice Bérard, Stefan Haar, Sylvain Schmitz, and Stefan Schwoon. [[https://hal.inria.fr/hal-01852119|The complexity of diagnosability and opacity verification for Petri nets]]. Fundamenta Informaticae 161(4), pages 317–349, 2018. * David Baelde, Anthony Lick, and Sylvain Schmitz. [[https://hal.inria.fr/hal-01852077|A hypersequent calculus with clusters for tense logic over ordinals]]. In /* Sumit Ganguly and Paritosh Pandya (eds.),*/ FSTTCS'18, LIPIcs 122, pages 15:1–15:19. LZI, 2018. * David Baelde, Anthony Lick, and Sylvain Schmitz. [[https://hal.inria.fr/hal-01756126|A hypersequent calculus with clusters for linear frames]]. In /*Guram Bezhanishvili, Giovanna D'Agostino, George Metcalfe and Thomas Studer (eds.),*/ AiML'18, pages 36–55. College Publications, 2018. ==== 2017 ==== * Sylvain Schmitz. [[http://tel.archives-ouvertes.fr/tel-01663266|Algorithmic complexity of well-quasi-orders]]. Mémoire d'habilitation, École Normale Supérieure Paris-Saclay, France, November 2017. * Béatrice Bérard, Stefan Haar, Sylvain Schmitz, and Stefan Schwoon. [[https://hal.inria.fr/hal-01484476|The complexity of diagnosability and opacity verification for Petri nets]]. In /* Wifred van der Aalst and Eike Best (eds.),*/ Petri Nets'17, LNCS 10258, pages 200–220. Springer, 2017. * Thomas Colcombet, Marcin Jurdziński, Ranko Lazić, and Sylvain Schmitz. [[http://arxiv.org/abs/1704.05626|Perfect half space games]]. In /* Joël Ouaknine (ed.),*/ LICS'17, pages 1–11. IEEE Press, 2017. ==== 2016 ==== * David Baelde, Simon Lunel, and Sylvain Schmitz. [[https://hal.inria.fr/hal-01191172|A sequent calculus for a modal logic on finite data trees]]. In /*Laurent Regnier and Jean-Marc Talbot (eds.),*/ CSL'16, LIPIcs 62, pages 32:1–32:16. LZI, 2016. * Pierre Chambart, Alain Finkel, and Sylvain Schmitz. [[http://arxiv.org/abs/1004.2802|Forward analysis and model checking for trace bounded WSTS]]. Theoretical Computer Science 637, pages 1–29, 2016. * Jean Goubault-Larrecq and Sylvain Schmitz. [[https://hal.inria.fr/hal-01276119/|Deciding piecewise testable separability for regular tree languages]]. In /*Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani and Davide Sangiorgi (eds.),*/ ICALP'16, LIPIcs 55, pages 97:1–97:15. LZI, 2016. * Ranko Lazić and Sylvain Schmitz. [[https://hal.inria.fr/hal-01265302|The complexity of coverability in ν-Petri nets]]. In /* Martin Grohe, Eric Koskinen and Natarajan Shankar (eds.),*/ LICS'16, pages 467–476. ACM Press, 2016. * Sylvain Schmitz. [[http://arxiv.org/abs/1402.0705|Implicational relevance logic is 2-EXPTIME-complete]]. Journal of Symbolic Logic 81(2), pages 641–661, 2016. * Piotr Hofman, Sławomir Lasota, Ranko Lazić, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke. [[https://hal.inria.fr/hal-01252674|Coverability trees for Petri nets with unordered data]]. In /*Bart Jacobs and Christof Löding (eds.),*/ FoSSaCS'16, LNCS 9634, pages 445–461. Springer, 2016. * Jérôme Leroux and Sylvain Schmitz. [[http://drops.dagstuhl.de/opus/volltexte/2016/5702|Ideal decompositions for vector addition systems]]. In /*Nicolas Ollinger and Heribert Vollmer (eds.),*/ STACS'16, LIPIcs 47, pages 1:1–1:13. LZI, 2016. * Sylvain Schmitz. [[http://arxiv.org/abs/1312.5686|Complexity hierarchies beyond Elementary]]. ACM Transactions on Computation Theory 8(1:3), 2016. * Sylvain Schmitz. [[https://hal.inria.fr/hal-01275972|Automata column: The complexity of reachability in vector addition systems]]. SIGLOG News 3(1), pages 3–21, 2016. ==== 2015 ==== * Ranko Lazić and Sylvain Schmitz. [[https://hal.inria.fr/hal-01176755|The ideal view on Rackoff's coverability technique]]. In /* Mikołaj Bojańczyk, Sławomir Lasota and Igor Potapov (eds.),*/ RP'15, LNCS 9328, pages 76–88. Springer, 2015. * Marcin Jurdziński, Ranko Lazić, and Sylvain Schmitz. [[http://arxiv.org/abs/1502.06875|Fixed-dimensional energy games are in pseudo polynomial time]]. In /* Magnus M. Halldórsson, Kazuo Iwama, Naoki Kobayashi and Bettina Speckmann (eds.),*/ ICALP'15, LNCS 9135, pages 260–272. Springer, 2015. * Ranko Lazić and Sylvain Schmitz. [[http://arxiv.org/abs/1401.6785|Non-elementary complexities for branching VASS, MELL, and extensions]]. ACM Transactions on Computational Logic 16(3:20), 2015. * Jérôme Leroux and Sylvain Schmitz. [[http://arxiv.org/abs/1503.00745|Demystifying reachability in vector addition systems]]. In LICS'15, pages 56–67. IEEE Press, 2015. ==== 2014 ==== * Christoph Haase, Sylvain Schmitz, and Philippe Schnoebelen. [[http://arxiv.org/abs/1301.5500|The power of priority channel systems]]. Logical Methods in Computer Science 10(4:4), 2014. * Sylvain Schmitz. [[http://arxiv.org/abs/1407.5896|Complexity bounds for ordinal-based termination]]. In /*Joël Ouaknine, Igor Potapov and James Worrell (eds.),*/ RP'14, LNCS 8762, pages 1–19. Springer, 2014. * Jean-Baptiste Courtois and Sylvain Schmitz. [[http://hal.inria.fr/hal-00980878|Alternating vector addition systems with states]]. In /* Zoltán Ésik, Erzsébet Csuhaj-Varjú and Martin Dietzfelbinger (eds.),*/ MFCS'14, LNCS 8634, pages 220–231. Springer, 2014. * Ranko Lazić and Sylvain Schmitz. [[http://arxiv.org/abs/1401.6785|Non-elementary complexities for branching VASS, MELL, and extensions]]. In CSL/LICS'14. ACM Press, 2014. * Sylvain Schmitz. [[http://arxiv.org/abs/1402.0705|Implicational relevance logic is 2-EXPTIME-complete]]. In /*Gilles Dowek (ed.),*/ RTA/TLCA'14, LNCS 8560, pages 395–409. Springer, 2014. ==== 2013 ==== * Christoph Haase, Sylvain Schmitz, and Philippe Schnoebelen. [[http://arxiv.org/abs/1301.5500|The power of priority channel systems]]. In /* Pedro R. D'Argenio and Hernán Melgratti (eds.),*/ CONCUR'13, LNCS 8052, pages 319–333. Springer, 2013. * Sylvain Schmitz and Philippe Schnoebelen. [[http://arxiv.org/abs/1402.2908|The power of well-structured systems]]. In /* Pedro R. D'Argenio and Hernán Melgratti (eds.),*/ CONCUR'13, LNCS 8052, pages 5–24. Springer, 2013. * Anudhyan Boral and Sylvain Schmitz. [[http://arxiv.org/abs/1211.5256|Model checking parse trees]]. In LICS'13, pages 153–162. IEEE Press, 2013. * Eberhard Bertsch, Mark-Jan Nederhof, and Sylvain Schmitz. [[http://hal.archives-ouvertes.fr/hal-00769668|On LR parsing with selective delays]]. In /* Koen De Bosschere and Ranjit Jhala (eds.),*/ CC'13, LNCS 7791, pages 244–263. Springer, 2013. * Prateek Karandikar and Sylvain Schmitz. [[http://arxiv.org/abs/1211.5259|The parametric ordinal-recursive complexity of Post embedding problems]]. In /* Frank Pfenning (ed.),*/ FoSSaCS'13, LNCS 7794, pages 273–288. Springer, 2013. ==== 2012 ==== * Sylvain Schmitz and Philippe Schnoebelen. [[http://cel.archives-ouvertes.fr/cel-00727025|Algorithmic aspects of WQO theory]]. Lecture Notes. 2012. * Serge Haddad, Sylvain Schmitz, and Philippe Schnoebelen. [[http://hal.archives-ouvertes.fr/hal-00793811|The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets]]. In LICS'12, pages 355–364. IEEE Press, 2012. ==== 2011 ==== * Michel Blockelet and Sylvain Schmitz. [[http://hal.archives-ouvertes.fr/hal-00600077/|Model-checking coverability graphs of vector addition systems]]. In /* Filip Murlak and Piotr Sankowski (eds.),*/ MFCS'11, LNCS 6907, pages 108–119. Springer, 2011. * Sylvain Schmitz. [[http://hal.archives-ouvertes.fr/hal-00600260/|A note on sequential rule-based POS tagging]]. In /* Andreas Maletti (ed.),*/ FSMNLP'11, pages 83–87. ACL Press, 2011. * Sylvain Schmitz and Philippe Schnoebelen. [[http://arxiv.org/abs/1103.4399|Multiply-recursive upper bounds with Higman's Lemma]]. In /* Luca Aceto, Monika Henzinger and Jirí Sgall (eds.),*/ ICALP'11, LNCS 6756, pages 441–452. Springer, 2011. * Pierre Chambart, Alain Finkel, and Sylvain Schmitz. [[http://arxiv.org/abs/1004.2802|Forward analysis and model checking for trace bounded WSTS]]. In /* Lars M. Kristensen and Laure Petrucci (eds.),*/ Petri Nets'11, LNCS 6709, pages 49–68. Springer, 2011. * Diego Figueira, Santiago Figueira, Sylvain Schmitz, and Philippe Schnoebelen. [[http://arxiv.org/abs/1007.2989|Ackermannian and primitive-recursive bounds with Dickson's Lemma]]. In LICS'11, pages 269–278. IEEE Press, 2011. ==== 2010 ==== * Pierre-Cyrille Héam, Cyril Nicaud, and Sylvain Schmitz. [[http://hal.inria.fr/inria-00511450|Parametric random generation of deterministic tree automata]]. Theoretical Computer Science 411(38–39), pages 3469–3480, 2010. * Sylvain Schmitz. [[http://hal.archives-ouvertes.fr/hal-00482396|On the computational complexity of dominance links in grammatical formalisms]]. In ACL'10, pages 514–524. ACL Press, 2010. * Sylvain Schmitz. [[http://hal.archives-ouvertes.fr/hal-00436398|An experimental ambiguity detection tool]]. Science of Computer Programming 75(1–2), pages 71–84, 2010. ==== 2009 ==== * Pierre-Cyrille Héam, Cyril Nicaud, and Sylvain Schmitz. [[http://hal.inria.fr/inria-00408316|Random generation of deterministic tree (walking) automata]]. In /* Sebastian Maneth (ed.),*/ CIAA'09, LNCS 5642, pages 115–124. Springer, 2009. ==== 2008 ==== * Sylvain Schmitz and Joseph Le Roux. [[http://arxiv.org/abs/0804.4584|Feature unification in TAG derivation trees]]. In /* Claire Gardent and Anoop Sarkar (eds.),*/ TAG+'08, pages 141–148. 2008. ==== 2007 ==== * Sylvain Schmitz. [[http://tel.archives-ouvertes.fr/tel-00271168|Approximating context-free grammars for parsing and verification]]. Thèse de doctorat, Laboratoire I3S, Université de Nice-Sophia Antipolis, France, September 2007. * Sylvain Schmitz. [[http://hal.archives-ouvertes.fr/hal-00436398|An experimental ambiguity detection tool]]. In /*Anthony Sloane and Adrian Johnstone (eds.),*/ LDTA'07, ENTCS 203(2), pages 69–84. Elsevier Science Publishers, 2008. * Sylvain Schmitz. [[http://hal.archives-ouvertes.fr/hal-00610222|Conservative ambiguity detection in context-free grammars]]. In /* Lars Arge, Christian Cachin, Tomasz Jurdziński and Andrzej Tarlecki (eds.),*/ ICALP'07, LNCS 4596, pages 692–703. Springer, 2007. ==== 2006 ==== * Jacques Farré, Igor Litovsky, and Sylvain Schmitz (eds.). [[http://www.springer.com/978-3-540-31023-5|10th International Conference on Implementation and Application of Automata (CIAA'05), Sophia Antipolis, France, June 2005]], LNCS 3845. Springer, 2006. * Sylvain Schmitz. [[http://www.lsv.fr/Publis/PAPERS/PDF/schmitz-RR0632.pdf|Modular syntax demands verification]]. Technical Report I3S/RR-2006-32-FR, Laboratoire I3S, Université de Nice-Sophia Antipolis, France, 2006. * José Fortes Gálvez, Sylvain Schmitz, and Jacques Farré. [[https://doi.org/10.1007/11812128_24|Shift-resolve parsing: Simple, linear time, unbounded lookahead]]. In /*Oscar H. Ibarra and Hsu-Chun Yen (eds.),*/ CIAA'06, LNCS 4094, pages 253–264. Springer, 2006. * Sylvain Schmitz. [[https://doi.org/10.1007/11779148_10|Noncanonical LALR(1) parsing]]. In /*Zhe Dang and Oscar H. Ibarra (eds.),*/ DLT'06, LNCS 4036, pages 95–107. Springer, 2006.
==== coauthors ==== * [[https://people.mpi-sws.org/~ashwani/|Ashwani Anand]] * [[https://people.irisa.fr/David.Baelde/|David Baelde]] * [[https://www.ruhr-uni-bochum.de/ffm/fakultaet/bertsch.html.de|Eberhard Bertsch]] * Michel Blockelet * Anudhyan Boral * [[https://pages.lip6.fr/Beatrice.Berard/|Béatrice Bérard]] * [[http://www.lsv.fr/~chambart/|Pierre Chambart]] * [[https://www.irif.fr/~colcombe/|Thomas Colcombet]] * Jean-Baptiste Courtois * [[https://logiqueconsult.eu/|Mirna Džamonja]] * Jacques Farré * [[http://www.labri.fr/perso/dfigueir/|Diego Figueira]] * [[http://www.glyc.dc.uba.ar/santiago/|Santiago Figueira]] * [[http://www.lsv.fr/~finkel/|Alain Finkel]] * José Fortes Gálvez * [[http://www.lsv.fr/~goubault/|Jean Goubault-Larrecq]] * [[http://www.lsv.fr/~haar/|Stefan Haar]] * [[http://www.cs.ox.ac.uk/people/christoph.haase/home/|Christoph Haase]] * [[http://www.lsv.fr/~haddad/|Serge Haddad]] * [[http://www.mimuw.edu.pl/~ph209519/|Piotr Hofman]] * [[http://members.femto-st.fr/pierre-cyrille-heam/|Pierre-Cyrille Héam]] * [[http://www.inf.upol.cz/lide/petr-jancar|Petr Jančar]] * [[http://www.dcs.warwick.ac.uk/~mju/|Marcin Jurdziński]] * [[http://www.lsv.fr/~prateek/|Prateek Karandikar]] * [[http://www.mimuw.edu.pl/~sl/|Sławomir Lasota]] * [[http://www.dcs.warwick.ac.uk/~lazic/|Ranko Lazić]] * [[http://www.labri.fr/perso/leroux/|Jérôme Leroux]] * [[http://lipn.univ-paris13.fr/~leroux/|Joseph Le Roux]] * [[http://www.lsv.fr/~lick/|Anthony Lick]] * Igor Litovsky * Simon Lunel * [[https://mjn.host.cs.st-andrews.ac.uk/|Mark-Jan Nederhof]] * [[http://www-igm.univ-mlv.fr/~nicaud/|Cyril Nicaud]] * [[https://www.irif.fr/~nosan/|Klara Nosan]] * [[https://www.pouly.fr|Amaury Pouly]] * [[http://www.lsv.fr/~phs/|Philippe Schnoebelen]] * [[https://people.mpi-sws.org/~lschuetze/|Lia Schütze]] * [[http://www.lsv.fr/~schwoon/|Stefan Schwoon]] * [[https://www.irif.fr/~mahsa/|Mahsa Shirmohammadi]] * [[https://cgi.csc.liv.ac.uk/~patrick/|Patrick Totzke]] * [[https://www.cs.ox.ac.uk/people/james.worrell/home.html|James Worrell]] * [[http://zetzsche.xyz/|Georg Zetzsche]]