Sylvain Schmitz

Centre National de la Recherche Scientifique — France

Computer Science · Physical Sciences

17h-index936citations79works0.32yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Logic, programming, and type systems(37), Formal Methods in Verification(37), semigroups and automata theory(30), Natural Language Processing Techniques(13), Logic, Reasoning, and Knowledge(8)

Publications79 total

A Note on the Parameterised Complexity of Coverability in Vector Addition Systems
arXiv (Cornell University)·2025Open Access
Verifying Unboundedness via Amalgamation
2024· 1 citedOpen Access
Verifying Unboundedness via Amalgamation
arXiv (Cornell University)·2024Open Access
Measuring well quasi-ordered finitary powersets
arXiv (Cornell University)·2023Open Access
Preface
Fundamenta Informaticae·2023Open Access
On the Length of Strongly Monotone Descending Chains over $\mathbb{N}^d$
arXiv (Cornell University)·2023· 1 citedOpen Access
Games on Graphs: From Logic and Automata to Algorithms
arXiv (Cornell University)·2023· 8 citedOpen Access
On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices
2022· 3 cited
On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices
arXiv (Cornell University)·2021· 1 citedOpen Access
Branching in Well-Structured Transition Systems (Invited Talk)
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 2 citedOpen Access
The ideal view on Rackoff's coverability technique
Information and Computation·2020· 7 cited
Informatique Mathématique Une photographie en 2020
HAL (Le Centre pour la Communication Scientifique Directe)·2020
Reachability Problems
Lecture notes in computer science·2020· 1 cited
On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
Trends in logic·2020· 3 citedOpen Access
Decidable XPath Fragments in the Real World
2019· 1 citedOpen Access
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension
2019· 58 citedOpen Access
Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete
2019· 4 citedOpen Access
Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets
Lecture notes in computer science·2019· 2 citedOpen Access
The Parametric Complexity of Lossy Counter Machines
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2019· 3 citedOpen Access
Systèmes de preuve
2018
page 1 of 4Next →

Frequent Co-authors

Philippe Schnoebelen(7), Ranko Lazić(7), Jérôme Leroux(4), Marcin Jurdziński(2), Christoph Haase(2), Béatrice Bérard(2), Stefan Haar(2), Stefan Schwoon(2), David Baelde(2), Pierre‐Cyrille Héam(2), Cyril Nicaud(2), Jacques Farré(2), Diego Figueira(1), Santiago Figueira(1), Ph. Schnoebelen(1), Serge Haddad(1), Michel Blockelet(1), Jean-Baptiste Courtois(1), Jean Goubault-Larrecq(1), Piotr Hofman(1)