Sylvain Schmitz

Identifiants chercheurs

IdHAL :

sylvain-schmitz

ORCID :

0000-0002-4101-4308

IdRef :

122252020

arXiv :

schmitz_s_1

Présentation

Publications

Ouvrages (2)

Games on Graphs Nathanaël Fijalkow,Nathalie Bertrand,Patricia Bouyer,Romain Brenguier,Arnaud Carayolet al. pp.1-491, In press, ⟨10.48550/arXiv.2305.10546⟩ Ouvrages hal-04273394v1
Informatique Mathématique Une photographie en 2020 Sébastien Labbé,Vincent Penelle,Marni Mishna,Fredrik Johansson,Marthe Bonamyet al. 2020 Ouvrages hal-03431823v1

Article dans une revue (10)

The ideal view on Rackoff's coverability technique Ranko Lazić,Sylvain Schmitz Information and Computation, 2021, 277, pp.104582. ⟨10.1016/j.ic.2020.104582⟩ Article dans une revue hal-03440102v1
The Complexity of Diagnosability and Opacity Verification for Petri Nets Béatrice Bérard,Stefan Haar,Sylvain Schmitz,Stefan Schwoon Fundamenta Informaticae, 2018, 161 (4), pp.317--349. ⟨10.3233/FI-2018-1706⟩ Article dans une revue hal-01852119v1
Automata Column: The Complexity of Reachability in Vector Addition Systems Sylvain Schmitz ACM SIGLOG News, 2016, 3 (1), pp.3--21. ⟨10.1145/2893582.2893585⟩ Article dans une revue hal-01275972v1
Forward Analysis and Model Checking for Trace Bounded WSTS Pierre Chambart,Alain Finkel,Sylvain Schmitz Theoretical Computer Science, 2016, 637, pp.1--29. ⟨10.1016/j.tcs.2016.04.020⟩ Article dans une revue hal-01329871v1
Implicational Relevance Logic is 2-ExpTime-Complete Sylvain Schmitz The Journal of Symbolic Logic, 2016, 81 (2), pp.641--661. ⟨10.1017/jsl.2015.7⟩ Article dans une revue hal-01340113v1
Complexity Hierarchies Beyond Elementary Sylvain Schmitz ACM Transactions on Computation Theory, 2016, 8 (1), ⟨10.1145/2858784⟩ Article dans une revue hal-01267354v1
Non-Elementary Complexities for Branching VASS, MELL, and Extensions Ranko Lazić,Sylvain Schmitz ACM Transactions on Computational Logic, 2015, 16 (3:20), pp.1--30. ⟨10.1145/2733375⟩ Article dans une revue hal-01168290v1
The Power of Priority Channel Systems Christoph Haase,Sylvain Schmitz,Philippe Schnoebelen Logical Methods in Computer Science, 2014, 10 (4:4), pp.1--39. ⟨10.2168/LMCS-10(4:4)2014⟩ Article dans une revue hal-01091086v1
Parametric Random Generation of Deterministic Tree Automata Pierre-Cyrille Heam,Cyril Nicaud,Sylvain Schmitz Theoretical Computer Science, 2010, 411 (1), pp.3469--3480. ⟨10.1016/j.tcs.2010.05.036⟩ Article dans une revue hal-00561274v1
An Experimental Ambiguity Detection Tool Sylvain Schmitz Science of Computer Programming, 2010, 75 (1--2), pp.71--84. ⟨10.1016/j.scico.2009.07.002⟩ Article dans une revue hal-00436398v1

Communication dans un congrès (43)

A Note on the Parameterised Complexity of Coverability in Vector Addition Systems Michał Pilipczuk,Sylvain Schmitz,Henry Sinclair-Banks Proceedings of the 20th International Symposium on Parameterized and Exact Computation (IPEC 2025), 2025, Warsaw, Poland. pp.24:1--24:19, ⟨10.4230/LIPIcs.IPEC.2025.24⟩ Communication dans un congrès hal-05417024v1
On the Length of Strongly Monotone Descending Chains over ℕᵈ Sylvain Schmitz,Lia Schütze ICALP 2024, 51st International Colloquium on Automata, Languages and Programming, Jul 2024, Tallinn, Estonia. ⟨10.4230/LIPIcs.ICALP.2024.153⟩ Communication dans un congrès hal-04698650v1
Verifying Unboundedness via Amalgamation Ashwani Anand,Sylvain Schmitz,Lia Schütze,Georg Zetzsche LICS 2024, 39th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2024, Tallinn, Estonia. pp.1-15, ⟨10.1145/3661814.3662133⟩ Communication dans un congrès hal-04698657v1
On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices Klara Nosan,Amaury Pouly,Sylvain Schmitz,Mahsa Shirmohammadi,James Worrell Proceedings of ISSAC 2022, 2022, Villeneuve-d’Ascq, France. ⟨10.1145/3476446.3536172⟩ Communication dans un congrès hal-03450297v1
Branching in Well-Structured Transition Systems (Invited Talk) Sylvain Schmitz 29th EACSL Annual Conference on Computer Science Logic (CSL 2021), 2021, Ljubljana, Slovenia. pp.3:1--3:3, ⟨10.4230/LIPIcs.CSL.2021.3⟩ Communication dans un congrès hal-03439623v1
The Parametric Complexity of Lossy Counter Machines Sylvain Schmitz ICALP 2019, Jul 2019, Patras, Greece. pp.129:1--129:15, ⟨10.4230/LIPIcs.ICALP.2019.129⟩ Communication dans un congrès hal-02020728v2
Decidable XPath Fragments in the Real World David Baelde,Anthony Lick,Sylvain Schmitz 38th ACM Symposium on Principles of Database Systems (PODS'19), Jun 2019, Amsterdam, Netherlands. ⟨10.1145/3294052.3319685⟩ Communication dans un congrès hal-01852475v1
Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete Petr Jancar,Sylvain Schmitz LICS 2019, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1--12, ⟨10.1109/LICS.2019.8785848⟩ Communication dans un congrès hal-02267529v1
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension Jérôme Leroux,Sylvain Schmitz LICS 2019, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1--13, ⟨10.1109/LICS.2019.8785796⟩ Communication dans un congrès hal-02267524v1
Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets Sylvain Schmitz,Georg Zetzsche 13th International Conference on Reachability Problems (RP 2019), 2019, Brussels, Belgium. pp.193--201, ⟨10.1007/978-3-030-30806-3_15⟩ Communication dans un congrès hal-03440052v1
A Hypersequent Calculus with Clusters for Tense Logic over Ordinals David Baelde,Anthony Lick,Sylvain Schmitz FSTTCS 2018 - 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2018, Ahmedabad, India. pp.15:1--15:19, ⟨10.4230/LIPIcs.FSTTCS.2018.15⟩ Communication dans un congrès hal-01852077v2
A Hypersequent Calculus with Clusters for Linear Frames David Baelde,Anthony Lick,Sylvain Schmitz Twefth Conference on Advances in Modal Logic, Jul 2018, Bern, Switzerland. pp.36--55 Communication dans un congrès hal-01756126v2
Perfect Half-Space Games Thomas Colcombet,Marcin Jurdzinski,Ranko Lazić,Sylvain Schmitz Logic in Computer Science, 2017, Reykjavik, Iceland. ⟨10.1109/LICS.2017.8005105⟩ Communication dans un congrès hal-01633355v1
The Complexity of Diagnosability and Opacity Verification for Petri Nets Béatrice Bérard,Stefan Haar,Sylvain Schmitz,Stefan Schwoon 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⟩ Communication dans un congrès hal-01484476v2
The Complexity of Coverability in ν-Petri Nets Ranko Lazić,Sylvain Schmitz LICS 2016 - 31th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2016, New York, United States. pp.467--476, ⟨10.1145/2933575.2933593⟩ Communication dans un congrès hal-01265302v2
Coverability Trees for Petri Nets with Unordered Data Piotr Hofman,Sławomir Lasota,Ranko Lazić,Jérôme Leroux,Sylvain Schmitzet al. FoSSaCS, 2016, Eindhoven, Netherlands. pp.445--461, ⟨10.1007/978-3-662-49630-5_26⟩ Communication dans un congrès hal-01252674v1
Deciding Piecewise Testable Separability for Regular Tree Languages Jean Goubault-Larrecq,Sylvain Schmitz ICALP 2016, Jul 2016, Rome, Italy. pp.97:1--97:15, ⟨10.4230/LIPIcs.ICALP.2016.97⟩ Communication dans un congrès hal-01276119v4
Ideal Decompositions for Vector Addition Systems Jérôme Leroux,Sylvain Schmitz STACS 2016 - 33rd Symposium on Theoretical Aspects of Computer Science, 2016, Orléans, France. pp.1--13, ⟨10.4230/LIPIcs.STACS.2016.1⟩ Communication dans un congrès hal-01275991v1
A Sequent Calculus for a Modal Logic on Finite Data Trees David Baelde,Simon Lunel,Sylvain Schmitz CSL 2016, Sep 2016, Marseille, France. pp.1--16, ⟨10.4230/LIPIcs.CSL.2016.32⟩ Communication dans un congrès hal-01191172v2
Demystifying Reachability in Vector Addition Systems Jérôme Leroux,Sylvain Schmitz LICS 2015, Jul 2015, Kyoto, Japan. pp.56--67, ⟨10.1109/LICS.2015.16⟩ Communication dans un congrès hal-01168388v1
Fixed-dimensional energy games are in pseudo-polynomial time Marcin Jurdzinski,Ranko Lazić,Sylvain Schmitz 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⟩ Communication dans un congrès hal-01168300v1
The Ideal View on Rackoff's Coverability Technique Ranko Lazić,Sylvain Schmitz RP 2015 - 9th International Workshop on Reachability Problems, Sep 2015, Warsaw, Poland. pp.1--13, ⟨10.1007/978-3-319-24537-9_8⟩ Communication dans un congrès hal-01176755v3
The Power of Priority Channel Systems Christoph Haase,Sylvain Schmitz,Philippe Schnoebelen 24th International Conference on Concurrency Theory, Aug 2013, Buenos Aires, Argentina. pp.1--39, ⟨10.2168/LMCS-10(4:4)2014⟩ Communication dans un congrès hal-00793809v1
Non-Elementary Complexities for Branching VASS, MELL, and Extensions Ranko Lazić,Sylvain Schmitz 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⟩ Communication dans un congrès hal-01076694v1
Complexity Bounds for Ordinal-Based Termination Sylvain Schmitz 8th International Workshop on Reachability Problems, Sep 2014, Oxford, United Kingdom. pp.1--19, ⟨10.1007/978-3-319-11439-2_1⟩ Communication dans un congrès hal-01076701v1
Implicational Relevance Logic is 2-ExpTime-Complete Sylvain Schmitz 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⟩ Communication dans un congrès hal-01076698v1
Alternating Vector Addition Systems with States Jean-Baptiste Courtois,Sylvain Schmitz 39th International Symposium on Mathematical Foundations of Computer Science, Aug 2014, Budapest, Bulgaria. pp.220--231, ⟨10.1007/978-3-662-44522-8_19⟩ Communication dans un congrès hal-00980878v2
Model Checking Parse Trees Anudhyan Boral,Sylvain Schmitz 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⟩ Communication dans un congrès hal-00907951v1
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems Prateek Karandikar,Sylvain Schmitz 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⟩ Communication dans un congrès hal-00793808v1
On LR Parsing with Selective Delays Eberhard Bertsch,Mark-Jan Nederhof,Sylvain Schmitz Compilers Construction, Mar 2013, Rome, Italy. pp.244--263, ⟨10.1007/978-3-642-37051-9_13⟩ Communication dans un congrès hal-00769668v1
The Power of Well-Structured Systems Sylvain Schmitz,Philippe Schnoebelen 24th International Conference on Concurrency Theory, Aug 2013, Buenos Aires, Argentina. pp.5--24, ⟨10.1007/978-3-642-40184-8_2⟩ Communication dans un congrès hal-00907964v1
The Ordinal Recursive Complexity of of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets Serge Haddad,Sylvain Schmitz,Philippe Schnoebelen 27th ACM/IEEE Symposium on Logic in Computer Science, Jun 2012, Dubrovnik, Croatia. pp.355--364, ⟨10.1109/LICS.2012.46⟩ Communication dans un congrès hal-00793811v1
Multiply-Recursive Upper Bounds with Higman's Lemma Sylvain Schmitz,Philippe Schnoebelen 38th International Colloquium on Automata, Languages and Programming, Jul 2011, Zürich, Switzerland. p. 441--452, ⟨10.1007/978-3-642-22012-8_35⟩ Communication dans un congrès hal-00609865v1
Lexical Disambiguation in LTAG using Left Context Claire Gardent,Yannick Parmentier,Guy Perrier,Sylvain Schmitz 5th Language & Technology Conference - LTC'11, Nov 2011, Poznań, Poland. pp.395-399 Communication dans un congrès hal-00629902v1
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma Diego Figueira,Santiago Figueira,Sylvain Schmitz,Philippe Schnoebelen 26th Annual IEEE Symposium on Logic in Computer Science, Jun 2011, Toronto, Canada. p. 269--278, ⟨10.1109/LICS.2011.39⟩ Communication dans un congrès hal-00609871v1
Model Checking Coverability Graphs of Vector Addition Systems Michel Blockelet,Sylvain Schmitz MCFS, 2011, Warsaw, Poland. pp.108--119, ⟨10.1007/978-3-642-22993-0_13⟩ Communication dans un congrès hal-00600077v1
Forward Analysis and Model Checking for Trace Bounded WSTS Pierre Chambart,Alain Finkel,Sylvain Schmitz 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⟩ Communication dans un congrès hal-00610011v1
A Note on Sequential Rule-Based POS Tagging Sylvain Schmitz FSMNLP, 2011, Blois, France. pp.83--87 Communication dans un congrès hal-00600260v2
On the Computational Complexity of Dominance Links in Grammatical Formalisms Sylvain Schmitz ACL 2010, 2010, Uppsala, Sweden. pp.514--524 Communication dans un congrès hal-00482396v6
Random Generation of Deterministic Tree (Walking) Automata Pierre-Cyrille Héam,Cyril Nicaud,Sylvain Schmitz 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⟩ Communication dans un congrès inria-00408316v1
Feature Unification in TAG Derivation Trees Sylvain Schmitz,Joseph Le Roux Ninth International Workshop on Tree Adjoining Grammars and Related Formalisms, Jun 2008, Tübingen, Germany. p. 141-148 Communication dans un congrès hal-00276326v1
Calculs d'unification sur les arbres de dérivation TAG Sylvain Schmitz,Joseph Le Roux TALN'08, 15ème Conférence sur le Traitement Automatique des Langues Naturelles, Jun 2008, Avignon, France. p. 320--329 Communication dans un congrès inria-00270922v1
Conservative Ambiguity Detection in Context-Free Grammars Sylvain Schmitz 34th International Colloquium on Automata, Languages and Programming, Jul 2007, Wroclaw, Poland. pp.692-703, ⟨10.1007/978-3-540-73420-8_60⟩ Communication dans un congrès hal-00610222v1

Chapitre d'ouvrage (2)

On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders Mirna Džamonja,Sylvain Schmitz,Philippe Schnoebelen Peter M. Schuster; Monika Seisenberger; Andreas Weiermann. Well-Quasi Orders in Computation, Logic, Language and Reasoning, 53, Springer, 2020, Trends in Logic, ⟨10.1007/978-3-030-30229-0_2⟩ Chapitre d'ouvrage halshs-01625981v1
Lexical Disambiguation in LTAG using Left Context Claire Gardent,Yannick Parmentier,Guy Perrier,Sylvain Schmitz Zygmunt Vetulani; Joseph Mariani. Human Language Technology. Challenges for Computer Science and Linguistics. 5th Language and Technology Conference, LTC 2011, Poznan, Poland, November 25-27, 2011, Revised Selected Papers, 8387, Springer, pp.67-79, 2014, Lecture Notes in Computer Science (LNCS) series / Lecture Notes in Artificial Intelligence (LNAI) subseries, ISBN 978-3-319-08957-7. ⟨10.1007/978-3-319-08958-4_6⟩ Chapitre d'ouvrage hal-00921246v1

HDR (1)

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

Thèse (1)

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

Cours (3)

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

Logiciel (2)

XPath Parser David Baelde,Anthony Lick,Sylvain Schmitz 2019, ⟨swh:1:dir:081194c82832b17c4d1229313e85753dfb3ec4cd;origin=https://hal.archives-ouvertes.fr/hal-02079276;visit=swh:1:snp:c65e2c93c0e93ba5789ad3560b50492c942776ff;anchor=swh:1:rev:bac735336055e1e5fe24e87d33b42a802112e7df;path=/⟩ Logiciel hal-02079276v1
XPath Benchmark Anthony Lick,David Baelde,Sylvain Schmitz 2019, ⟨swh:1:dir:1ea68cf5bb3f9f3f2fe8c7995f1802ebadf17fb5;origin=https://hal.archives-ouvertes.fr/hal-02079114;visit=swh:1:snp:7c7faf214f78660c34ea8392a4748f22faf7b432;anchor=swh:1:rev:39b305d6b703c1d2c2557d8c7aa1ae27a5d9e6a6;path=/⟩ Logiciel hal-02079114v1