Publications : Sylvain SCHMITZ

[BLS19]
D. Baelde, A. Lick, and S. Schmitz. Decidable XPath Fragments in the Real World. In Proceedings of the 38th Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'19), Amsterdam, Netherlands, June-July 2019. ACM Press. To appear.
BibTex | Web page ]
[DSS19]
M. Džamonja, S. Schmitz, and Ph. Schnoebelen. On ordinal invariants in well quasi orders and finite antichain orders. In Well-quasi orders in computation, logic, language and reasoning, Trends in Logic. Springer, 2019. To appear.
BibTex | Web page | PDF ]
[LS19]
R. Lazić and S. Schmitz. The Ideal View on Rackoff's Coverability Technique. Information and Computation, 2019. To appear.
BibTex | Web page ]
[Sch19]
S. Schmitz. The Parametric Complexity of Lossy Counter Machines. Preprint, 2019.
BibTex | Web page ]
[JS19]
P. Jančar and S. Schmitz. Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete. Preprint, 2019.
BibTex | Web page ]
[BLS18b]
D. Baelde, A. Lick, and S. Schmitz. A Hypersequent Calculus with Clusters for Tense Logic over Ordinals. In Proceedings of the 38th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'18), Leibniz International Proceedings in Informatics, pages 15:1--15:19, Ahmedabad, India, December 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2018.15.
BibTex | DOI | Web page | PDF ]
[BLS18a]
D. Baelde, A. Lick, and S. Schmitz. A Hypersequent Calculus with Clusters for Linear Frames. In Proceedings of the 10th Conference on Advances in Modal Logics (AiML'18), pages 36--55, Bern, Switzerland, August 2018. College Publications.
BibTex | Web page ]
[BHSS18]
B. Bérard, S. Haar, S. Schmitz, and S. Schwoon. The Complexity of Diagnosability and Opacity Verification for Petri Nets. Fundamenta Informaticae, 161(4):317--349, 2018.
doi: 10.3233/FI-2018-1706.
BibTex | DOI | Web page ]
[Sch17]
S. Schmitz. Algorithmic Complexity of Well-Quasi-Orders. Mémoire d'habilitation, École Normale Supérieure Paris-Saclay, France, November 2017.
BibTex | Web page ]
[CJLS17]
Th. Colcombet, M. Jurdziński, R. Lazić, and S. Schmitz. Perfect Half Space Games. In Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'17), pages 1--11, Reykjavik, Iceland, June 2017. ACM Press.
doi: 10.1109/LICS.2017.8005105.
BibTex | DOI | Web page ]
[BHSS17]
B. Bérard, S. Haar, S. Schmitz, and S. Schwoon. The Complexity of Diagnosability and Opacity Verification for Petri Nets. In Proceedings of the 38th International Conference on Applications and Theory of Petri Nets (PETRI NETS'17), volume 10258 of Lecture Notes in Computer Science, pages 200--220, Zaragoza, Spain, June 2017. Springer.
doi: 10.1007/978-3-319-57861-3_13.
BibTex | DOI | Web page ]
[BLS16]
D. Baelde, S. Lunel, and S. Schmitz. A Sequent Calculus for a Modal Logic on Finite Data Trees. In Proceedings of the 25th Annual EACSL Conference on Computer Science Logic (CSL'16), volume 62 of Leibniz International Proceedings in Informatics, pages 32:1--32:16, Marseille, France, September 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2016.32.
BibTex | DOI | Web page ]
[GS16]
J. Goubault-Larrecq and S. Schmitz. Deciding Piecewise Testable Separability for Regular Tree Languages. In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP'16), volume 55 of Leibniz International Proceedings in Informatics, pages 97:1--97:15, Rome, Italy, July 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICALP.2016.97.
BibTex | DOI | Web page ]
[LS16a]
R. Lazić and S. Schmitz. The Complexity of Coverability in ν-Petri Nets. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'16), pages 467--476, New York City, USA, July 2016. ACM Press.
doi: 10.1145/2933575.2933593.
BibTex | DOI | Web page ]
[CFS16]
P. Chambart, A. Finkel, and S. Schmitz. Forward Analysis and Model Checking for Trace Bounded WSTS. Theoretical Computer Science, 637:1--29, July 2016.
doi: 10.1016/j.tcs.2016.04.020.
BibTex | DOI | Web page ]
[Sch16c]
S. Schmitz. Implicational Relevance Logic is 2-ExpTime-Complete. Journal of Symbolic Logic, 81(2):641--661, June 2016.
doi: 10.1017/jsl.2015.7.
BibTex | DOI | Web page | PDF ]
[HLL+16]
P. Hofman, S. Lasota, R. Lazić, J. Leroux, S. Schmitz, and P. Totzke. Coverability Trees for Petri Nets with Unordered Data. In Proceedings of the 19th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'16), volume 9634 of Lecture Notes in Computer Science, pages 445--461, Eindhoven, The Netherlands, April 2016. Springer.
doi: 10.1007/978-3-662-49630-5_26.
BibTex | DOI | Web page ]
[LS16b]
J. Leroux and S. Schmitz. Ideal Decompositions for Vector Addition Systems. In Proceedings of the 33rd Annual Symposium on Theoretical Aspects of Computer Science (STACS'16), volume 47 of Leibniz International Proceedings in Informatics, pages 1:1--1:13, Orléans, France, February 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2016.1.
BibTex | DOI | Web page ]
[Sch16b]
S. Schmitz. Complexity Hierarchies Beyond Elementary. ACM Transactions on Computation Theory, 8(1:3), February 2016.
doi: 10.1145/2858784.
BibTex | DOI | Web page ]
[Sch16a]
S. Schmitz. Automata column: The complexity of reachability in vector addition systems. SIGLOG News, 3(1):3--21, January 2016.
doi: 10.1145/2893582.2893585.
BibTex | DOI | Web page ]
[LS15a]
R. Lazić and S. Schmitz. The Ideal View on Rackoff's Coverability Technique. In Proceedings of the 9th Workshop on Reachability Problems in Computational Models (RP'15), volume 9328 of Lecture Notes in Computer Science, pages 76--88, Warsaw, Poland, September 2015. Springer.
doi: 10.1007/978-3-319-24537-9_8.
BibTex | DOI | Web page | PDF ]
[JLS15]
M. Jurdziński, R. Lazić, and S. Schmitz. Fixed-Dimensional Energy Games are in Pseudo Polynomial Time. In Proceedings of the 42nd International Colloquium on Automata, Languages and Programming (ICALP'15) -- Part II, volume 9135 of Lecture Notes in Computer Science, pages 260--272, Kyoto, Japan, July 2015. Springer.
doi: 10.1007/978-3-662-47666-6_21.
BibTex | DOI | Web page | PDF ]
[LS15c]
J. Leroux and S. Schmitz. Demystifying Reachability in Vector Addition Systems. In Proceedings of the 30th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'15), pages 56--67, Kyoto, Japan, July 2015. IEEE Press.
doi: 10.1109/LICS.2015.1.
BibTex | DOI | Web page | PDF ]
[LS15b]
R. Lazić and S. Schmitz. Non-Elementary Complexities for Branching VASS, MELL, and Extensions. ACM Transactions on Computational Logic, 16(3:20), July 2015.
doi: 10.1145/2733375.
BibTex | DOI | Web page | PDF ]
[HSS14]
C. Haase, S. Schmitz, and Ph. Schnoebelen. The Power of Priority Channel Systems. Logical Methods in Computer Science, 10(4:4), December 2014.
doi: 10.2168/LMCS-10(4:4)2014.
BibTex | DOI | Web page | PDF ]
[GPPS14]
C. Gardent, G. Perrier, Y. Parmentier, and S. Schmitz. Lexical Disambiguation in LTAG using Left Context. In Proceedings of the 5th Language & Technology Conference (LTC'11), volume 8387 of Lecture Notes in Artificial Intelligence, Poznań, Poland, November 2014. Springer.
BibTex | Web page ]
[Sch14a]
S. Schmitz. Complexity Bounds for Ordinal-Based Termination. In Proceedings of the 8th Workshop on Reachability Problems in Computational Models (RP'14), volume 8762 of Lecture Notes in Computer Science, pages 1--19, Oxford, UK, September 2014. Springer.
doi: 10.1007/978-3-319-11439-2_1.
BibTex | DOI | Web page | PDF ]
[CS14]
J.-B. Courtois and S. Schmitz. Alternating Vector Addition Systems with States. In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS'14) -- Part I, volume 8634 of Lecture Notes in Computer Science, pages 220--231, Budapest, Hungary, August 2014. Springer.
doi: 10.1007/978-3-662-44522-8_19.
BibTex | DOI | Web page | PDF ]
[Sch14b]
S. Schmitz. Implicational Relevance Logic is 2-ExpTime-Complete. In Proceedings of the Joint 25th International Conference on Rewriting Techniques and Applications and 12th International Conference on Typed Lambda-Calculi and Applications (RTA/ TLCA'14), volume 8560 of Lecture Notes in Computer Science, pages 395--409, Vienna, Austria, July 2014. Springer.
doi: 10.1007/978-3-319-08918-8_27.
BibTex | DOI | Web page | PDF ]
[LS14]
R. Lazić and S. Schmitz. Non-Elementary Complexities for Branching VASS, MELL, and Extensions. In Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic and the 29th Annual ACM/ IEEE Symposium on Logic In Computer Science (CSL/LICS'14), Vienna, Austria, July 2014. ACM Press.
doi: 10.1145/2603088.2603129.
BibTex | DOI | Web page | PDF ]
[SS13]
S. Schmitz and Ph. Schnoebelen. The Power of Well-Structured Systems. In Proceedings of the 24th International Conference on Concurrency Theory (CONCUR'13), volume 8052 of Lecture Notes in Computer Science, pages 5--24, Buenos Aires, Argentina, August 2013. Springer.
doi: 10.1007/978-3-642-40184-8_2.
BibTex | DOI | Web page | PDF ]
[HSS13]
C. Haase, S. Schmitz, and Ph. Schnoebelen. The Power of Priority Channel Systems. In Proceedings of the 24th International Conference on Concurrency Theory (CONCUR'13), volume 8052 of Lecture Notes in Computer Science, pages 319--333, Buenos Aires, Argentina, August 2013. Springer.
doi: 10.1007/978-3-642-40184-8_23.
BibTex | DOI | Web page | PDF ]
[BS13]
A. Boral and S. Schmitz. Model Checking Parse Trees. In Proceedings of the 28th Annual IEEE Symposium on Logic in Computer Science (LICS'13), pages 153--162, New-Orleans, Louisiana, USA, June 2013. IEEE Computer Society Press.
doi: 10.1109/LICS.2013.21.
BibTex | DOI | Web page | PDF ]
[BNS13]
E. Bertsch, M.-J. Nederhof, and S. Schmitz. On LR Parsing with Selective Delays. In Proceedings of the 22nd International Conference on Compiler Construction (CC'13), volume 7791 of Lecture Notes in Computer Science, pages 244--263, Rome, Italy, March 2013. Springer.
doi: 10.1007/978-3-642-37051-9_13.
BibTex | DOI | Web page | PDF ]
[KS13]
P. Karandikar and S. Schmitz. The Parametric Ordinal-Recursive Complexity of Post Embedding Problems. In Proceedings of the 16th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'13), volume 7794 of Lecture Notes in Computer Science, pages 273--288, Rome, Italy, March 2013. Springer.
doi: 10.1007/978-3-642-37075-5_18.
BibTex | DOI | Web page | PDF ]
[SS12]
S. Schmitz and Ph. Schnoebelen. Algorithmic Aspects of WQO Theory. Lecture Notes, August 2012.
BibTex | Web page | PDF ]
[HSS12]
S. Haddad, S. Schmitz, and Ph. Schnoebelen. The Ordinal-Recursive Complexity of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets. In Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science (LICS'12), pages 355--364, Dubrovnik, Croatia, June 2012. IEEE Computer Society Press.
doi: 10.1109/LICS.2012.46.
BibTex | DOI | Web page | PDF ]
[BS11]
M. Blockelet and S. Schmitz. Model-Checking Coverability Graphs of Vector Addition Systems. In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11), volume 6907 of Lecture Notes in Computer Science, pages 108--119, Warsaw, Poland, August 2011. Springer.
doi: 10.1007/978-3-642-22993-0_13.
BibTex | DOI | Web page | PDF ]
[Sch11]
S. Schmitz. A Note on Sequential Rule-Based POS Tagging. In Proceedings of the 9th International Workshop on Finite-State Methods and Natural Language Processing (FSMNLP'11), pages 83--87, Blois, France, July 2011. ACL Press.
BibTex | Web page | PDF ]
[SS11]
S. Schmitz and Ph. Schnoebelen. Multiply-Recursive Upper Bounds with Higman's Lemma. In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP'11) -- Part II, volume 6756 of Lecture Notes in Computer Science, pages 441--452, Zürich, Switzerland, July 2011. Springer.
doi: 10.1007/978-3-642-22012-8_35.
BibTex | DOI | Web page | PDF ]
[CFS11]
P. Chambart, A. Finkel, and S. Schmitz. Forward Analysis and Model Checking for Trace Bounded WSTS. In Proceedings of the 32nd International Conference on Applications and Theory of Petri Nets (PETRI NETS'11), volume 6709 of Lecture Notes in Computer Science, Newcastle upon Tyne, UK, June 2011. Springer.
doi: 10.1007/978-3-642-21834-7_4.
BibTex | DOI | Web page ]
[FFSS11]
D. Figueira, S. Figueira, S. Schmitz, and Ph. Schnoebelen. Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. In Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS'11), pages 269--278, Toronto, Canada, June 2011. IEEE Computer Society Press.
doi: 10.1109/LICS.2011.39.
BibTex | DOI | Web page | PDF ]
[HNS10]
P.-C. Héam, C. Nicaud, and S. Schmitz. Parametric Random Generation of Deterministic Tree Automata. Theoretical Computer Science, 411(38-39):3469--3480, August 2010.
doi: 10.1016/j.tcs.2010.05.036.
BibTex | DOI | Web page | PDF ]
[Sch10b]
S. Schmitz. On the Computational Complexity of Dominance Links in Grammatical Formalisms. In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics (ACL'10), pages 514--524, Uppsala, Sweden, July 2010. Association for Computational Linguistics.
BibTex | Web page | PDF ]
[Sch10a]
S. Schmitz. An Experimental Ambiguity Detection Tool. Science of Computer Programming, 75(1-2):71--84, January 2010.
doi: 10.1016/j.scico.2009.07.002.
BibTex | DOI | Web page | PDF ]
[HNS09]
P.-C. Héam, C. Nicaud, and S. Schmitz. Random Generation of Deterministic Tree (Walking) Automata. In Proceedings of the 14th International Conference on Implementation and Application of Automata (CIAA'09), volume 5642 of Lecture Notes in Computer Science, pages 115--124, Sydney, Australia, July 2009. Springer-Verlag.
doi: 10.1007/978-3-642-02979-0_15.
BibTex | DOI | Web page | PDF ]
[SL08]
S. Schmitz and J. Le Roux. Feature Unification in TAG Derivation Trees. In Proceedings of the 9th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+'08), pages 141--148, Tübingen, Germany, June 2008.
BibTex | Web page | PDF ]
[Sch08]
S. Schmitz. An Experimental Ambiguity Detection Tool. In Proceedings of the 7th Workshop on Language Descriptions, Tools, and Applications (LDTA'07), volume 203 of Electronic Notes in Theoretical Computer Science, pages 69--84, Braga, Portugal, April 2008. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2008.03.045.
BibTex | DOI | Web page | PDF ]
[Sch07a]
S. Schmitz. Approximating Context-Free Grammars for Parsing and Verification. Thèse de doctorat, Laboratoire I3S, Université de Nice-Sophia Antipolis, France, September 2007.
BibTex | Web page | PDF ]
[Sch07b]
S. Schmitz. Conservative Ambiguity Detection in Context-Free Grammars. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP'07), volume 4596 of Lecture Notes in Computer Science, pages 692--703, Wroclaw, Poland, July 2007. Springer.
doi: 10.1007/978-3-540-73420-8_60.
BibTex | DOI | Web page | PDF ]
[Sch06a]
S. Schmitz. Modular Syntax Demands Verification. Technical Report I3S/RR-2006-32-FR, Laboratoire I3S, Université de Nice-Sophia Antipolis, France, October 2006.
BibTex | Web page | PDF ]
[FGSF06]
J. Fortes Gálvez, S. Schmitz, and J. Farré. Shift-Resolve Parsing: Simple, Linear Time, Unbounded Lookahead. In Proceedings of the 11th International Conference on Implementation and Application of Automata (CIAA'06), volume 4094 of Lecture Notes in Computer Science, pages 253--264, Taipei, Taiwan, August 2006. Springer-Verlag.
doi: 10.1007/11812128_24.
BibTex | DOI | Web page | PDF ]
[Sch06b]
S. Schmitz. Noncanonical LALR(1) Parsing. In Proceedings of the 10th International Conference on Developments in Language Theory (DLT'06), volume 4036 of Lecture Notes in Computer Science, pages 95--107, Santa Barbara, California, USA, June 2006. Springer.
doi: 10.1007/11779148_10.
BibTex | DOI | Web page | PDF ]

This file was generated by bibtex2html 1.98.

About LSV