|
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-04698657
v1
|
|
On the Length of Strongly Monotone Descending Chains over ℕᵈ
Sylvain Schmitz
,
Lia Schütze
Communication dans un congrès
hal-04698650
v1
|
|
On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices
Klara Nosan
,
Amaury Pouly
,
Sylvain Schmitz
,
Mahsa Shirmohammadi
,
James Worrell
Communication dans un congrès
hal-03450297
v1
|
|
Branching in Well-Structured Transition Systems (Invited Talk)
Sylvain Schmitz
Communication dans un congrès
hal-03439623
v1
|
|
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-02267529
v1
|
|
Decidable XPath Fragments in the Real World
David Baelde
,
Anthony Lick
,
Sylvain Schmitz
Communication dans un congrès
hal-01852475
v1
|
|
The Parametric Complexity of Lossy Counter Machines
Sylvain Schmitz
Communication dans un congrès
hal-02020728
v2
|
|
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-02267524
v1
|
|
Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets
Sylvain Schmitz
,
Georg Zetzsche
Communication dans un congrès
hal-03440052
v1
|
|
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-01756126
v2
|
|
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-01852077
v2
|
|
Perfect Half-Space Games
Thomas Colcombet
,
Marcin Jurdzinski
,
Ranko Lazić
,
Sylvain Schmitz
Communication dans un congrès
hal-01633355
v1
|
|
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-01484476
v2
|
|
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-01265302
v2
|
|
Coverability Trees for Petri Nets with Unordered Data
Piotr Hofman
,
Sławomir Lasota
,
Ranko Lazić
,
Jérôme Leroux
,
Sylvain Schmitz
et al.
Communication dans un congrès
hal-01252674
v1
|
|
Deciding Piecewise Testable Separability for Regular Tree Languages
Jean Goubault-Larrecq
,
Sylvain Schmitz
Communication dans un congrès
hal-01276119
v4
|
|
Ideal Decompositions for Vector Addition Systems
Jérôme Leroux
,
Sylvain Schmitz
Communication dans un congrès
hal-01275991
v1
|
|
A Sequent Calculus for a Modal Logic on Finite Data Trees
David Baelde
,
Simon Lunel
,
Sylvain Schmitz
Communication dans un congrès
hal-01191172
v2
|
|
The Ideal View on Rackoff's Coverability Technique
Ranko Lazić
,
Sylvain Schmitz
Communication dans un congrès
hal-01176755
v3
|
|
Demystifying Reachability in Vector Addition Systems
Jérôme Leroux
,
Sylvain Schmitz
Communication dans un congrès
hal-01168388
v1
|
|
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-01168300
v1
|
|
The Power of Priority Channel Systems
Christoph Haase
,
Sylvain Schmitz
,
Philippe Schnoebelen
Communication dans un congrès
hal-00793809
v1
|
|
Complexity Bounds for Ordinal-Based Termination
Sylvain Schmitz
Communication dans un congrès
hal-01076701
v1
|
|
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-01076694
v1
|
|
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-00980878
v2
|
|
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-01076698
v1
|
|
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-00907951
v1
|
|
On LR Parsing with Selective Delays
Eberhard Bertsch
,
Mark-Jan Nederhof
,
Sylvain Schmitz
Communication dans un congrès
hal-00769668
v1
|
|
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-00793808
v1
|
|
The Power of Well-Structured Systems
Sylvain Schmitz
,
Philippe Schnoebelen
Communication dans un congrès
hal-00907964
v1
|
|
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-00793811
v1
|
|
Multiply-Recursive Upper Bounds with Higman's Lemma
Sylvain Schmitz
,
Philippe Schnoebelen
Communication dans un congrès
hal-00609865
v1
|
|
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-00629902
v1
|
|
Model Checking Coverability Graphs of Vector Addition Systems
Michel Blockelet
,
Sylvain Schmitz
Communication dans un congrès
hal-00600077
v1
|
|
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-00609871
v1
|
|
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-00610011
v1
|
|
A Note on Sequential Rule-Based POS Tagging
Sylvain Schmitz
FSMNLP, 2011, Blois, France. pp.83--87
Communication dans un congrès
hal-00600260
v2
|
|
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-00482396
v6
|
|
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-00408316
v1
|
|
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-00276326
v1
|
|
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-00270922
v1
|
|
Conservative Ambiguity Detection in Context-Free Grammars
Sylvain Schmitz
Communication dans un congrès
hal-00610222
v1
|