Sylvain Schmitz

84 papers A* 15A 1B 14C 4Journal 33Unranked 14
YearRankTypeTitle / Venue / Authors
2025 B ed.
33rd EACSL Annual Conference on Computer Science Logic, CSL 2025, Amsterdam, The Netherlands, February 10-14, 2025
CSL
Jörg Endrullis, Sylvain Schmitz
2025 B conf
A Note on the Parameterised Complexity of Coverability in Vector Addition Systems.
IPEC
Michal Pilipczuk, Sylvain Schmitz, Henry Sinclair-Banks
2025 J jnl
A Note on the Parameterised Complexity of Coverability in Vector Addition Systems.
CoRR
Michal Pilipczuk, Sylvain Schmitz, Henry Sinclair-Banks
2024 A* conf
On the Length of Strongly Monotone Descending Chains over ℕ^d.
ICALP
Sylvain Schmitz, Lia Schütze
2024 A* conf
Verifying Unboundedness via Amalgamation.
LICS
Ashwani Anand, Sylvain Schmitz, Lia Schütze, Georg Zetzsche
2024 J jnl
Verifying Unboundedness via Amalgamation.
CoRR
Ashwani Anand, Sylvain Schmitz, Lia Schütze, Georg Zetzsche
2023 J jnl
Games on Graphs.
CoRR
Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer-Decitre, Romain Brenguier, Arnaud Carayol, John Fearnley, Hugo Gimbert, Florian Horn, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, Mateusz Skomra
2023 J jnl
Measuring well quasi-ordered finitary powersets.
CoRR
Sergio Abriola, Simon Halfon, Aliaume Lopez, Sylvain Schmitz, Philippe Schnoebelen, Isa Vialard
2023 J jnl
On the Length of Strongly Monotone Descending Chains over N
CoRR
Sylvain Schmitz, Lia Schütze
2022 B conf
On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices.
ISSAC
Klara Nosan, Amaury Pouly, Sylvain Schmitz, Mahsa Shirmohammadi, James Worrell
2022 J jnl
Preface.
Fundam. Informaticae
Paul C. Bell, Igor Potapov, Sylvain Schmitz, Patrick Totzke
2021 B conf
Branching in Well-Structured Transition Systems (Invited Talk).
CSL
Sylvain Schmitz
2021 J jnl
The ideal view on Rackoff's coverability technique.
Inf. Comput.
Ranko Lazic, Sylvain Schmitz
2020 — ed.
Reachability Problems - 14th International Conference, RP 2020, Paris, France, October 19-21, 2020, Proceedings
RP
Sylvain Schmitz, Igor Potapov
2019 A* conf
Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete.
LICS
Petr Jancar, Sylvain Schmitz
2019 J jnl
Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete.
CoRR
Petr Jancar, Sylvain Schmitz
2019 — conf
Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets.
RP
Sylvain Schmitz, Georg Zetzsche
2019 J jnl
Coverability is Undecidable in One-dimensional Pushdown Vector Addition Systems with Resets.
CoRR
Sylvain Schmitz, Georg Zetzsche
2019 A* conf
Decidable XPath Fragments in the Real World.
PODS
David Baelde, Anthony Lick, Sylvain Schmitz
2019 A* conf
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension.
LICS
Jérôme Leroux, Sylvain Schmitz
2019 J jnl
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension.
CoRR
Jérôme Leroux, Sylvain Schmitz
2019 A* conf
The Parametric Complexity of Lossy Counter Machines.
ICALP
Sylvain Schmitz
2018 B conf
A Hypersequent Calculus with Clusters for Linear Frames.
Advances in Modal Logic
David Baelde, Anthony Lick, Sylvain Schmitz
2018 — conf
A Hypersequent Calculus with Clusters for Tense Logic over Ordinals.
FSTTCS
David Baelde, Anthony Lick, Sylvain Schmitz
2018 J jnl
The Complexity of Diagnosability and Opacity Verification for Petri Nets.
Fundam. Informaticae
Béatrice Bérard, Stefan Haar, Sylvain Schmitz, Stefan Schwoon
2017 — book
Algorithmic Complexity of Well-Quasi-Orders. (Complexité algorithmique des beaux pré-ordres).
Sylvain Schmitz
2017 J jnl
Perfect Half Space Games.
CoRR
Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz
2017 A* conf
Perfect half space games.
LICS
Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz
2017 B conf
The Complexity of Diagnosability and Opacity Verification for Petri Nets.
Petri Nets
Béatrice Bérard, Stefan Haar, Sylvain Schmitz, Stefan Schwoon
2016 B conf
A Sequent Calculus for a Modal Logic on Finite Data Trees.
CSL
David Baelde, Simon Lunel, Sylvain Schmitz
2016 J jnl
Complexity Hierarchies beyond Elementary.
ACM Trans. Comput. Theory
Sylvain Schmitz
2016 B conf
Coverability Trees for Petri Nets with Unordered Data.
FoSSaCS
Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke
2016 A* conf
Deciding Piecewise Testable Separability for Regular Tree Languages.
ICALP
Jean Goubault-Larrecq, Sylvain Schmitz
2016 J jnl
Forward analysis and model checking for trace bounded WSTS.
Theor. Comput. Sci.
Pierre Chambart, Alain Finkel, Sylvain Schmitz
2016 A conf
Ideal Decompositions for Vector Addition Systems (Invited Talk).
STACS
Jérôme Leroux, Sylvain Schmitz
2016 J jnl
Implicational Relevance Logic is 2-EXPTIME-Complete.
J. Symb. Log.
Sylvain Schmitz
2016 A* conf
The Complexity of Coverability in ν-Petri Nets.
LICS
Ranko Lazic, Sylvain Schmitz
2016 J jnl
The complexity of reachability in vector addition systems.
ACM SIGLOG News
Sylvain Schmitz
2015 A* conf
Demystifying Reachability in Vector Addition Systems.
LICS
Jérôme Leroux, Sylvain Schmitz
2015 — conf
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time.
ICALP (2)
Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz
2015 J jnl
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time.
CoRR
Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz
2015 J jnl
Nonelementary Complexities for Branching VASS, MELL, and Extensions.
ACM Trans. Comput. Log.
Ranko Lazic, Sylvain Schmitz
2015 J jnl
Reachability in Vector Addition Systems Demystified.
CoRR
Jérôme Leroux, Sylvain Schmitz
2015 — conf
The Ideal View on Rackoff's Coverability Technique.
RP
Ranko Lazic, Sylvain Schmitz
2014 — conf
Alternating Vector Addition Systems with States.
MFCS (1)
Jean-Baptiste Courtois, Sylvain Schmitz
2014 — conf
Complexity Bounds for Ordinal-Based Termination - (Invited Talk).
RP
Sylvain Schmitz
2014 J jnl
Complexity Bounds for Ordinal-Based Termination.
CoRR
Sylvain Schmitz
2014 J jnl
Implicational Relevance Logic is 2-EXPTIME-Complete.
CoRR
Sylvain Schmitz
2014 — conf
Implicational Relevance Logic is 2-ExpTime-Complete.
RTA-TLCA
Sylvain Schmitz
2014 J jnl
Non-Elementary Complexities for Branching VASS, MELL, and Extensions.
CoRR
Ranko Lazic, Sylvain Schmitz
2014 — conf
Non-elementary complexities for branching VASS, MELL, and extensions.
CSL-LICS
Ranko Lazic, Sylvain Schmitz
2014 J jnl
The Power of Priority Channel Systems
Log. Methods Comput. Sci.
Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen
2014 J jnl
The Power of Well-Structured Systems.
CoRR
Sylvain Schmitz, Philippe Schnoebelen
2013 J jnl
Complexity Hierarchies Beyond Elementary.
CoRR
Sylvain Schmitz
2013 A* conf
Model-Checking Parse Trees.
LICS
Anudhyan Boral, Sylvain Schmitz
2013 B conf
On LR Parsing with Selective Delays.
CC
Eberhard Bertsch, Mark-Jan Nederhof, Sylvain Schmitz
2013 B conf
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems.
FoSSaCS
Prateek Karandikar, Sylvain Schmitz
2013 B conf
The Power of Priority Channel Systems.
CONCUR
Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen
2013 B conf
The Power of Well-Structured Systems.
CONCUR
Sylvain Schmitz, Philippe Schnoebelen
2012 J jnl
PDL Model Checking of Parse Forests
CoRR
Anudhyan Boral, Sylvain Schmitz
2012 A* conf
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets.
LICS
Serge Haddad, Sylvain Schmitz, Philippe Schnoebelen
2012 J jnl
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems
CoRR
Prateek Karandikar, Sylvain Schmitz
2011 — conf
A Note on Sequential Rule-Based POS Tagging.
FSMNLP
Sylvain Schmitz
2011 A* conf
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma.
LICS
Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen
2011 B conf
Forward Analysis and Model Checking for Trace Bounded WSTS.
Petri Nets
Pierre Chambart, Alain Finkel, Sylvain Schmitz
2011 — conf
Lexical Disambiguation in LTAG Using Left Context.
LTC
Claire Gardent, Yannick Parmentier, Guy Perrier, Sylvain Schmitz
2011 B conf
Model Checking Coverability Graphs of Vector Addition Systems.
MFCS
Michel Blockelet, Sylvain Schmitz
2011 J jnl
Multiply-Recursive Upper Bounds with Higman's Lemma
CoRR
Sylvain Schmitz, Philippe Schnoebelen
2011 — conf
Multiply-Recursive Upper Bounds with Higman's Lemma.
ICALP (2)
Sylvain Schmitz, Philippe Schnoebelen
2010 J jnl
Ackermann and Primitive-Recursive Bounds with Dickson's Lemma
CoRR
Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen
2010 J jnl
An experimental ambiguity detection tool.
Sci. Comput. Program.
Sylvain Schmitz
2010 J jnl
Forward Analysis and Model Checking for Bounded WSTS
CoRR
Pierre Chambart, Alain Finkel, Sylvain Schmitz
2010 A* conf
On the Computational Complexity of Dominance Links in Grammatical Formalisms.
ACL
Sylvain Schmitz
2010 J jnl
Parametric random generation of deterministic tree automata.
Theor. Comput. Sci.
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz
2009 C conf
Random Generation of Deterministic Tree (Walking) Automata.
CIAA
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz
2008 — conf
Calculs d'unification sur les arbres de dérivation TAG.
TALN (Articles courts)
Sylvain Schmitz, Joseph Le Roux
2008 J jnl
Feature Unification in TAG Derivation Trees
CoRR
Sylvain Schmitz, Joseph Le Roux
2008 — conf
Feature Unification in TAG Derivation Trees.
TAG
Sylvain Schmitz, Joseph Le Roux
2007 — conf
An Experimental Ambiguity Detection Tool.
LDTA@ETAPS
Sylvain Schmitz
2007 — —
Approximating Context-Free Grammars for Parsing and Verification. (Approximation de grammaires algébriques pour l'analyse syntaxique et la vérification).
Sylvain Schmitz
2007 A* conf
Conservative Ambiguity Detection in Context-Free Grammars.
ICALP
Sylvain Schmitz
2006 C ed.
Implementation and Application of Automata, 10th International Conference, CIAA 2005, Sophia Antipolis, France, June 27-29, 2005, Revised Selected Papers
CIAA
Jacques Farré, Igor Litovsky, Sylvain Schmitz
2006 C conf
Noncanonical LALR(1) Parsing.
Developments in Language Theory
Sylvain Schmitz
2006 C conf
Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time.
CIAA
José Fortes Gálvez, Sylvain Schmitz, Jacques Farré