Mots-clés

Nombre de documents

41

Liste de publications


Article dans une revue8 documents

Communication dans un congrès31 documents

  • Béatrice Bérard, Stefan Haar, Sylvain Schmitz, Stefan Schwoon. The Complexity of Diagnosability and Opacity Verification for Petri Nets. Wil van der Aalst; Eike Best. Petri nets 2017, 2017, Zaragoza, Spain. Springer, Lecture Notes in Computer Science. 〈hal-01484476〉
  • Thomas Colcombet, Marcin Jurdzinski, Ranko Lazić, Sylvain Schmitz. Perfect Half-Space Games. Logic in Computer Science, 2017, Reykjavik, Iceland. IEEE Press, 2017, LICS. 〈10.1109/LICS.2017.8005105〉. 〈hal-01633355〉
  • David Baelde, Simon Lunel, Sylvain Schmitz. A Sequent Calculus for a Modal Logic on Finite Data Trees. Jean-Marc Talbot; Laurent Regnier. CSL 2016, Sep 2016, Marseille, France. LZI, 62 (32), pp.1--16, Leibniz International Proceedings in Informatics. 〈10.4230/LIPIcs.CSL.2016.32〉. 〈hal-01191172v2〉
  • Jean Goubault-Larrecq, Sylvain Schmitz. Deciding Piecewise Testable Separability for Regular Tree Languages. Ioannis Chatzigiannakis; Michael Mitzenmacher; Yuval Rabani; Davide Sangiorgi. ICALP 2016, Jul 2016, Rome, Italy. 55, pp.97:1--97:15, 2016, Leibniz International Proceedings in Informatics. 〈10.4230/LIPIcs.ICALP.2016.97〉. 〈hal-01276119v4〉
  • Ranko Lazić, Sylvain Schmitz. The Complexity of Coverability in ν-Petri Nets. LICS 2016, 2016, New York, United States. ACM Press, pp.467--476, 〈10.1145/2933575.2933593〉. 〈hal-01265302v2〉
  • Piotr Hofman, Sławomir Lasota, Ranko Lazić, Jérôme Leroux, Sylvain Schmitz, et al.. Coverability Trees for Petri Nets with Unordered Data. FoSSaCS, 2016, Eindhoven, Netherlands. Springer, 9634, pp.445--461, Lecture Notes in Computer Science. 〈10.1007/978-3-662-49630-5_26〉. 〈hal-01252674〉
  • Jérôme Leroux, Sylvain Schmitz. Ideal Decompositions for Vector Addition Systems. Nicolas Ollinger and Heribert Vollmer. STACS 2016 - 33rd Symposium on Theoretical Aspects of Computer Science, 2016, Orléans, France. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 47, pp.1--13, 2016, Leibniz International Proceedings in Informatics (LIPIcs). 〈http://drops.dagstuhl.de/opus/volltexte/2016/5702〉. 〈10.4230/LIPIcs.STACS.2016.1〉. 〈hal-01275991〉
  • Ranko Lazić, Sylvain Schmitz. The Ideal View on Rackoff's Coverability Technique. Mikołaj Bojańczyk; Sławomir Lasota; Igor Potapov. RP 2015 - 9th International Workshop on Reachability Problems, Sep 2015, Warsaw, Poland. Springer, 9328, pp.1--13, Lecture Notes in Computer Science. 〈10.1007/978-3-319-24537-9_8〉. 〈hal-01176755v3〉
  • Jérôme Leroux, Sylvain Schmitz. Demystifying Reachability in Vector Addition Systems. LICS 2015, Jul 2015, Kyoto, Japan. IEEE, pp.56--67, 〈10.1109/LICS.2015.16〉. 〈hal-01168388〉
  • Marcin Jurdzinski, Ranko Lazić, Sylvain Schmitz. Fixed-dimensional energy games are in pseudo-polynomial time. Magnús M. Halldórsson and Kazuo Iwama and Naoki Kobayashi and Bettina Speckmann. ICALP 2015: Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, Jul 2015, Kyoto, Japan. Springer, 9135, pp.260--272, Lecture Notes in Computer Science. 〈10.1007/978-3-662-47666-6_21〉. 〈hal-01168300〉
  • Sylvain Schmitz. Implicational Relevance Logic is 2-ExpTime-Complete. Gilles Dowek. Joint 25th International Conference on Rewriting Techniques and Applications and 12th International Conference on Typed Lambda Calculi and Applications, Jul 2014, Vienna, Austria. Springer, 8560, pp.395--409, Lecture Notes in Comptuer Science. 〈10.1007/978-3-319-08918-8_27〉. 〈hal-01076698〉
  • Sylvain Schmitz. Complexity Bounds for Ordinal-Based Termination. Joël Ouaknine; Igor Potapov; James Worrell. 8th International Workshop on Reachability Problems, Sep 2014, Oxford, United Kingdom. Springer, 8762, pp.1--19, Lecture Notes in Computer Science. 〈10.1007/978-3-319-11439-2_1〉. 〈hal-01076701〉
  • Ranko Lazić, Sylvain Schmitz. Non-Elementary Complexities for Branching VASS, MELL, and Extensions. 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. ACM, pp.61:1--61:1, 2014, 〈10.1145/2603088.2603129〉. 〈hal-01076694〉
  • Jean-Baptiste Courtois, Sylvain Schmitz. Alternating Vector Addition Systems with States. Csuhaj-Varjú, Erzsébet; Dietzfelbinger, Martin; Ésik, Zoltán. 39th International Symposium on Mathematical Foundations of Computer Science, Aug 2014, Budapest, Bulgaria. Springer, 8634, pp.220--231, 2014, Lecture Notes in Computer Science. 〈10.1007/978-3-662-44522-8_19〉. 〈hal-00980878v2〉
  • Eberhard Bertsch, Mark-Jan Nederhof, Sylvain Schmitz. On LR Parsing with Selective Delays. Koen De Bosschere and Ranjit Jhala. Compilers Construction, Mar 2013, Rome, Italy. Springer, 7791, pp.244--263, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-37051-9_13〉. 〈hal-00769668〉
  • Sylvain Schmitz, Philippe Schnoebelen. The Power of Well-Structured Systems. Pedro R. D'Argenio and Hernán Melgratti. 24th International Conference on Concurrency Theory, Aug 2013, Buenos Aires, Argentina. Springer, Lecture Notes in Computer Science, 8052, pp.5--24, 2013, Concur 2013. 〈10.1007/978-3-642-40184-8_2〉. 〈hal-00907964〉
  • Anudhyan Boral, Sylvain Schmitz. Model Checking Parse Trees. Twenty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2013, New Orleans, United States. IEEE Press, pp.153--162, 2013, 〈10.1109/LICS.2013.21〉. 〈hal-00907951〉
  • Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen. The Power of Priority Channel Systems. Pedro R. D'Argenio and Hernán Melgratti. 24th International Conference on Concurrency Theory, Aug 2013, Buenos Aires, Argentina. Springer, 8052, pp.319--333, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-40184-8_23〉. 〈hal-00793809〉
  • Prateek Karandikar, Sylvain Schmitz. The Parametric Ordinal-Recursive Complexity of Post Embedding Problems. Frank Pfenning. 16th International Conference on Foundations of Software Science and Computation Structures, Mar 2013, Rome, Italy. Springer, 7794, pp.273--288, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-37075-5_18〉. 〈hal-00793808〉
  • Serge Haddad, Sylvain Schmitz, Philippe Schnoebelen. The Ordinal Recursive Complexity of of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets. 27th ACM/IEEE Symposium on Logic in Computer Science, Jun 2012, Dubrovnik, Croatia. IEEE Press, pp.355--364, 2012, 〈10.1109/LICS.2012.46〉. 〈hal-00793811〉
  • Claire Gardent, Yannick Parmentier, Guy Perrier, Sylvain Schmitz. Lexical Disambiguation in LTAG using Left Context. 5th Language & Technology Conference - LTC'11, Nov 2011, Poznań, Poland. pp.395-399, 2011. 〈hal-00629902〉
  • Michel Blockelet, Sylvain Schmitz. Model Checking Coverability Graphs of Vector Addition Systems. Filip Murlak and Piotr Sankowski. MCFS, 2011, Warsaw, Poland. Springer, 6907, pp.108--119, 2011, Lecture Notes in Computer Science. 〈10.1007/978-3-642-22993-0_13〉. 〈hal-00600077〉
  • Sylvain Schmitz, Philippe Schnoebelen. Multiply-Recursive Upper Bounds with Higman's Lemma. Aceto, L., Henzinger, M., and Sgall, J. 38th International Colloquium on Automata, Languages and Programming, Jul 2011, Zürich, Switzerland. Springer, 6756, p. 441--452, 2011, Lecture Notes in Computer Science. 〈10.1007/978-3-642-22012-8_35〉. 〈hal-00609865〉
  • Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen. Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. 26th Annual IEEE Symposium on Logic in Computer Science, Jun 2011, Toronto, Canada. IEEE Press, p. 269--278, 2011, 〈10.1109/LICS.2011.39〉. 〈hal-00609871〉
  • Pierre Chambart, Alain Finkel, Sylvain Schmitz. Forward Analysis and Model Checking for Trace Bounded WSTS. Kristensen, L.M. and Petrucci, L. 32nd International Conference on Application and Theory of Petri Nets, Jun 2011, Newcastle, United Kingdom. Springer, 6709, p. 49--68, 2011, Lecture Notes in Computer Science. 〈10.1007/978-3-642-21834-7_4〉. 〈hal-00610011〉
  • Sylvain Schmitz. A Note on Sequential Rule-Based POS Tagging. Andreas Maletti. FSMNLP, 2011, Blois, France. Association for Computational Linguistics, pp.83--87, 2011. 〈hal-00600260v2〉
  • Sylvain Schmitz. On the Computational Complexity of Dominance Links in Grammatical Formalisms. ACL 2010, 2010, Uppsala, Sweden. pp.514--524, 2010. 〈hal-00482396v6〉
  • Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz. Random Generation of Deterministic Tree (Walking) Automata. Sebastian Maneth. 14th International Conference on Implementation and Application of Automata - CIAA 2009, Jul 2009, Sydney, Australia. Springer-Verlag, 5642, pp.115--124, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-02979-0_15〉. 〈inria-00408316〉
  • Sylvain Schmitz, Joseph Le Roux. Feature Unification in TAG Derivation Trees. Claire Gardent and Anoop Sarkar. Ninth International Workshop on Tree Adjoining Grammars and Related Formalisms, Jun 2008, Tübingen, Germany. p. 141-148, 2008. 〈hal-00276326〉
  • Sylvain Schmitz, Joseph Le Roux. Calculs d'unification sur les arbres de dérivation TAG. TALN'08, 15ème Conférence sur le Traitement Automatique des Langues Naturelles, Jun 2008, Avignon, France. p. 320--329, 2008. 〈inria-00270922〉
  • Sylvain Schmitz. Conservative Ambiguity Detection in Context-Free Grammars. Arge L., Cachin C., Jurdziński T., and Tarlecki, A. 34th International Colloquium on Automata, Languages and Programming, Jul 2007, Wroclaw, Poland. Springer, 4596, pp.692-703, 2007, Lecture Notes in Computer Science. 〈10.1007/978-3-540-73420-8_60〉. 〈hal-00610222〉

Thèse1 document

  • Sylvain Schmitz. Approximating Context-Free Grammars for Parsing and Verification. Software Engineering [cs.SE]. Université Nice Sophia Antipolis, 2007. English. 〈tel-00271168〉

Cours1 document

  • Sylvain Schmitz, Philippe Schnoebelen. Algorithmic Aspects of WQO Theory. Master. France. 2012. 〈cel-00727025v2〉