- 11
- 1
Sylvain Schmitz
12
Documents
Présentation
Publications
- 5
- 3
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 5
- 5
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 5
- 2
- 1
- 3
- 1
- 12
- 2
- 2
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed DimensionLICS 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
|
|
|
Decidable XPath Fragments in the Real World38th ACM Symposium on Principles of Database Systems (PODS'19), Jun 2019, Amsterdam, Netherlands. ⟨10.1145/3294052.3319685⟩
Communication dans un congrès
hal-01852475v1
|
|
The Parametric Complexity of Lossy Counter MachinesICALP 2019, Jul 2019, Patras, Greece. pp.129:1--129:15, ⟨10.4230/LIPIcs.ICALP.2019.129⟩
Communication dans un congrès
hal-02020728v2
|
|
A Hypersequent Calculus with Clusters for Tense Logic over OrdinalsFSTTCS 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 FramesTwefth Conference on Advances in Modal Logic, Jul 2018, Bern, Switzerland. pp.36--55
Communication dans un congrès
hal-01756126v2
|
|
The Complexity of Coverability in ν-Petri NetsLICS 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 DataFoSSaCS, 2016, Eindhoven, Netherlands. pp.445--461, ⟨10.1007/978-3-662-49630-5_26⟩
Communication dans un congrès
hal-01252674v1
|
|
A Sequent Calculus for a Modal Logic on Finite Data TreesCSL 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 SystemsLICS 2015, Jul 2015, Kyoto, Japan. pp.56--67, ⟨10.1109/LICS.2015.16⟩
Communication dans un congrès
hal-01168388v1
|
|
Algorithmic Complexity of Well-Quasi-OrdersLogic in Computer Science [cs.LO]. École normale supérieure Paris-Saclay, 2017
HDR
tel-01663266v1
|
|
XPath BenchmarkLogiciel hal-02079114v1 |
|
XPath ParserLogiciel hal-02079276v1 |