Keywords

Number of documents

53

Publication list


Preprints, Working Papers, ...1 document

  • David Baelde, Anthony Lick, Sylvain Schmitz. Decidable XPath Fragments in the Real World. 2018. ⟨hal-01852475⟩

Journal articles9 documents

Conference papers36 documents

  • Sylvain Schmitz. The Parametric Complexity of Lossy Counter Machines. ICALP 2019, Jul 2019, Patras, Greece. pp.129:1--129:15, ⟨10.4230/LIPIcs.ICALP.2019.129⟩. ⟨hal-02020728v2⟩
  • Petr Jancar, Sylvain Schmitz. Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete. LICS 2019, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1--12, ⟨10.1109/LICS.2019.8785848⟩. ⟨hal-02267529⟩
  • Jérôme Leroux, Sylvain Schmitz. Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension. LICS 2019, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1--13, ⟨10.1109/LICS.2019.8785796⟩. ⟨hal-02267524⟩
  • David Baelde, Anthony Lick, Sylvain Schmitz. A Hypersequent Calculus with Clusters for Linear Frames. Twefth Conference on Advances in Modal Logic, Jul 2018, Bern, Switzerland. pp.36--55. ⟨hal-01756126v2⟩
  • David Baelde, Anthony Lick, Sylvain Schmitz. A Hypersequent Calculus with Clusters for Tense Logic over Ordinals. 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018, Ahmedabad, India. pp.15:1--15:19, ⟨10.4230/LIPIcs.FSTTCS.2018.15⟩. ⟨hal-01852077v2⟩
  • Béatrice Bérard, Stefan Haar, Sylvain Schmitz, Stefan Schwoon. The Complexity of Diagnosability and Opacity Verification for Petri Nets. Petri nets 2017 - 38th International Conference on Applications and Theory of Petri Nets and Concurrency, Jun 2017, Zaragoza, Spain. pp.200--220, ⟨10.1007/978-3-319-57861-3_13⟩. ⟨hal-01484476v2⟩
  • Thomas Colcombet, Marcin Jurdzinski, Ranko Lazić, Sylvain Schmitz. Perfect Half-Space Games. Logic in Computer Science, 2017, Reykjavik, Iceland. ⟨10.1109/LICS.2017.8005105⟩. ⟨hal-01633355⟩
  • Jérôme Leroux, Sylvain Schmitz. Ideal Decompositions for Vector Addition Systems. STACS 2016 - 33rd Symposium on Theoretical Aspects of Computer Science, 2016, Orléans, France. pp.1--13, ⟨10.4230/LIPIcs.STACS.2016.1⟩. ⟨hal-01275991⟩
  • David Baelde, Simon Lunel, Sylvain Schmitz. A Sequent Calculus for a Modal Logic on Finite Data Trees. CSL 2016, Sep 2016, Marseille, France. pp.1--16, ⟨10.4230/LIPIcs.CSL.2016.32⟩. ⟨hal-01191172v2⟩
  • Ranko Lazić, Sylvain Schmitz. The Complexity of Coverability in ν-Petri Nets. LICS 2016, 2016, New York, United States. pp.467--476, ⟨10.1145/2933575.2933593⟩. ⟨hal-01265302v2⟩
  • Jean Goubault-Larrecq, Sylvain Schmitz. Deciding Piecewise Testable Separability for Regular Tree Languages. ICALP 2016, Jul 2016, Rome, Italy. pp.97:1--97:15, ⟨10.4230/LIPIcs.ICALP.2016.97⟩. ⟨hal-01276119v4⟩
  • Piotr Hofman, Sławomir Lasota, Ranko Lazić, Jérôme Leroux, Sylvain Schmitz, et al.. Coverability Trees for Petri Nets with Unordered Data. FoSSaCS, 2016, Eindhoven, Netherlands. pp.445--461, ⟨10.1007/978-3-662-49630-5_26⟩. ⟨hal-01252674⟩
  • Marcin Jurdzinski, Ranko Lazić, Sylvain Schmitz. Fixed-dimensional energy games are in pseudo-polynomial time. ICALP 2015: Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, Jul 2015, Kyoto, Japan. pp.260--272, ⟨10.1007/978-3-662-47666-6_21⟩. ⟨hal-01168300⟩
  • Ranko Lazić, Sylvain Schmitz. The Ideal View on Rackoff's Coverability Technique. RP 2015 - 9th International Workshop on Reachability Problems, Sep 2015, Warsaw, Poland. pp.1--13, ⟨10.1007/978-3-319-24537-9_8⟩. ⟨hal-01176755v3⟩
  • Jérôme Leroux, Sylvain Schmitz. Demystifying Reachability in Vector Addition Systems. LICS 2015, Jul 2015, Kyoto, Japan. pp.56--67, ⟨10.1109/LICS.2015.16⟩. ⟨hal-01168388⟩
  • Jean-Baptiste Courtois, Sylvain Schmitz. Alternating Vector Addition Systems with States. 39th International Symposium on Mathematical Foundations of Computer Science, Aug 2014, Budapest, Bulgaria. pp.220--231, ⟨10.1007/978-3-662-44522-8_19⟩. ⟨hal-00980878v2⟩
  • Sylvain Schmitz. Implicational Relevance Logic is 2-ExpTime-Complete. Joint 25th International Conference on Rewriting Techniques and Applications and 12th International Conference on Typed Lambda Calculi and Applications, Jul 2014, Vienna, Austria. pp.395--409, ⟨10.1007/978-3-319-08918-8_27⟩. ⟨hal-01076698⟩
  • Sylvain Schmitz. Complexity Bounds for Ordinal-Based Termination. 8th International Workshop on Reachability Problems, Sep 2014, Oxford, United Kingdom. pp.1--19, ⟨10.1007/978-3-319-11439-2_1⟩. ⟨hal-01076701⟩
  • Ranko Lazić, Sylvain Schmitz. Non-Elementary Complexities for Branching VASS, MELL, and Extensions. Joint meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2014, Vienna, Austria. pp.61:1--61:1, ⟨10.1145/2603088.2603129⟩. ⟨hal-01076694⟩
  • Prateek Karandikar, Sylvain Schmitz. The Parametric Ordinal-Recursive Complexity of Post Embedding Problems. 16th International Conference on Foundations of Software Science and Computation Structures, Mar 2013, Rome, Italy. pp.273--288, ⟨10.1007/978-3-642-37075-5_18⟩. ⟨hal-00793808⟩
  • Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen. The Power of Priority Channel Systems. 24th International Conference on Concurrency Theory, Aug 2013, Buenos Aires, Argentina. pp.319--333, ⟨10.1007/978-3-642-40184-8_23⟩. ⟨hal-00793809⟩
  • Sylvain Schmitz, Philippe Schnoebelen. The Power of Well-Structured Systems. 24th International Conference on Concurrency Theory, Aug 2013, Buenos Aires, Argentina. pp.5--24, ⟨10.1007/978-3-642-40184-8_2⟩. ⟨hal-00907964⟩
  • Eberhard Bertsch, Mark-Jan Nederhof, Sylvain Schmitz. On LR Parsing with Selective Delays. Compilers Construction, Mar 2013, Rome, Italy. pp.244--263, ⟨10.1007/978-3-642-37051-9_13⟩. ⟨hal-00769668⟩
  • Anudhyan Boral, Sylvain Schmitz. Model Checking Parse Trees. Twenty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2013, New Orleans, United States. pp.153--162, ⟨10.1109/LICS.2013.21⟩. ⟨hal-00907951⟩
  • Serge Haddad, Sylvain Schmitz, Philippe Schnoebelen. The Ordinal Recursive Complexity of of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets. 27th ACM/IEEE Symposium on Logic in Computer Science, Jun 2012, Dubrovnik, Croatia. pp.355--364, ⟨10.1109/LICS.2012.46⟩. ⟨hal-00793811⟩
  • Michel Blockelet, Sylvain Schmitz. Model Checking Coverability Graphs of Vector Addition Systems. MCFS, 2011, Warsaw, Poland. pp.108--119, ⟨10.1007/978-3-642-22993-0_13⟩. ⟨hal-00600077⟩
  • Sylvain Schmitz, Philippe Schnoebelen. Multiply-Recursive Upper Bounds with Higman's Lemma. 38th International Colloquium on Automata, Languages and Programming, Jul 2011, Zürich, Switzerland. p. 441--452, ⟨10.1007/978-3-642-22012-8_35⟩. ⟨hal-00609865⟩
  • Sylvain Schmitz. A Note on Sequential Rule-Based POS Tagging. FSMNLP, 2011, Blois, France. pp.83--87. ⟨hal-00600260v2⟩
  • Pierre Chambart, Alain Finkel, Sylvain Schmitz. Forward Analysis and Model Checking for Trace Bounded WSTS. 32nd International Conference on Application and Theory of Petri Nets, Jun 2011, Newcastle, United Kingdom. p. 49--68, ⟨10.1007/978-3-642-21834-7_4⟩. ⟨hal-00610011⟩
  • Claire Gardent, Yannick Parmentier, Guy Perrier, Sylvain Schmitz. Lexical Disambiguation in LTAG using Left Context. 5th Language & Technology Conference - LTC'11, Nov 2011, Poznań, Poland. pp.395-399. ⟨hal-00629902⟩
  • Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen. Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. 26th Annual IEEE Symposium on Logic in Computer Science, Jun 2011, Toronto, Canada. p. 269--278, ⟨10.1109/LICS.2011.39⟩. ⟨hal-00609871⟩
  • Sylvain Schmitz. On the Computational Complexity of Dominance Links in Grammatical Formalisms. ACL 2010, 2010, Uppsala, Sweden. pp.514--524. ⟨hal-00482396v6⟩
  • Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz. Random Generation of Deterministic Tree (Walking) Automata. 14th International Conference on Implementation and Application of Automata - CIAA 2009, Jul 2009, Sydney, Australia. pp.115--124, ⟨10.1007/978-3-642-02979-0_15⟩. ⟨inria-00408316⟩
  • Sylvain Schmitz, Joseph Le Roux. Calculs d'unification sur les arbres de dérivation TAG. TALN'08, 15ème Conférence sur le Traitement Automatique des Langues Naturelles, Jun 2008, Avignon, France. p. 320--329. ⟨inria-00270922⟩
  • Sylvain Schmitz, Joseph Le Roux. Feature Unification in TAG Derivation Trees. Ninth International Workshop on Tree Adjoining Grammars and Related Formalisms, Jun 2008, Tübingen, Germany. p. 141-148. ⟨hal-00276326⟩
  • Sylvain Schmitz. Conservative Ambiguity Detection in Context-Free Grammars. 34th International Colloquium on Automata, Languages and Programming, Jul 2007, Wroclaw, Poland. pp.692-703, ⟨10.1007/978-3-540-73420-8_60⟩. ⟨hal-00610222⟩

Habilitation à diriger des recherches1 document

  • Sylvain Schmitz. Algorithmic Complexity of Well-Quasi-Orders. Logic in Computer Science [cs.LO]. École normale supérieure Paris-Saclay, 2017. ⟨tel-01663266⟩

Theses1 document

  • Sylvain Schmitz. Approximating Context-Free Grammars for Parsing and Verification. Software Engineering [cs.SE]. Université Nice Sophia Antipolis, 2007. English. ⟨tel-00271168⟩

Lectures3 documents

  • Sylvain Schmitz. Systèmes de preuve : Notes de révision pour l'agrégation. Master. Préparation à l'agrégation de mathématiques, option informatique, France. 2018. ⟨cel-01903833⟩
  • Sylvain Schmitz. Logique propositionnelle : Notes de révision pour l'agrégation. Master. Préparation à l'agrégation de mathématiques, option informatique, France. 2018. ⟨cel-01903823⟩
  • Sylvain Schmitz, Philippe Schnoebelen. Algorithmic Aspects of WQO Theory. Master. France. 2012. ⟨cel-00727025v2⟩

Software2 documents