Sylvain Schmitz

Assistant professor, ENS Cachan

Research

Keywords
Verification, infinite systems, wqo, formal languages, parsing, computational linguistics

Publications

Most recent work:

The Ordinal-Recursive Complexity of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets
Joint work with S. Haddad and Ph. Schnoebelen. We prove the completeness of the coverability and termination problems for timed-arc Petri nets (and other classes of coloured Petri nets) for F ω ω ω . Will be presented at LICS 2012.
Model-Checking Coverability Graphs of Vector Addition Systems
Joint work with Michel Blockelet, based on his MSc. Thesis at MPRI. We propose a different unifying framework for expressing properties on VAS using their coverability graph. We introduce for this an extension of CTL allowing to express such properties, and show decidability and even ExpSpace-completeness for the VAS model-checking problem of some fragments. Presented at MFCS 2011.
Multiply-Recursive Bounds with Higman's Lemma
Joint work with Philippe Schnoebelen on complexity upper bounds derivable from the use of Higman's Lemma, a new milestone in our work on complexity bounds for wqo-based termination arguments, started with Dickson's Lemma. Presented at ICALP 2011.
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma
Joint work with Diego Figueira, Santiago Figueira, and Philippe Schnoebelen on complexity upper bounds derivable from the use of Dickson's Lemma. Presented at LICS 2011.
Forward Analysis and Model Checking for Bounded WSTS
Joint work with Pierre Chambart and Alain Finkel. We identify a recursive subclass of WSTS, for which action-based LTL properties are decidable. Presented at Petri Nets 2011.
A Note on Sequential Rule-Based POS Tagging
An alternative proof that the contextual rules of the Brill POS tagger can be implemented as a sequential function. I wrote this as part of the lecture notes for the MPRI course 2-27-1 before extracting this short note. Presented at FSMNLP 2011.

Full BibTeX

More publications...

Talks

MFCS 2011, 4pm, August 25th, 2011, University of Warsaw, Warsaw, Poland.
I presented the paper Model-Checking Coverability Graphs of Vector Addition Systems written with M. Blockelet. Here are the slides.
FSMNLP 2011, 9am, July 15th, 2011, campus de la CCI, Université de Tours, Blois, France.
I presented my short paper A Note on Sequential Rule-Based POS Tagging. Here are the slides.
ICALP 2011, 2:30pm, July 8th, 2011, Room CAB G61, ETH Zürich, Zürich, Switzerland.
I presented the paper Multiply-Recursive Upper Bounds with Higman's Lemma written with Ph. Schnoebelen. Here are the slides.
LICS 2011, 2pm, June 23, 2011, Fields Institute, Toronto, Canada.
I presented the paper Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma written with D. Figueira, S. Figueira, and Ph. Schnoebelen. Here are the slides.

More talks...

Other activities

Teaching

ESSLLI 2012
I will teach an advanced course on algorithmic aspects of wqo theory with Ph. Schnoebelen.
MPRI 2011–2012
Second half of the logical and computational structures for linguistic modeling course.
Practical sessions for the initiation to verification course.
Preparation to agregation 2011–2012
Courses in formal languages and automata for the computer science option of the French "agrégation de mathématiques".
Doctoral College of Practical Sciences 2011–2012
Formation on web search and web publication.

Since September 2009, I am responsible for the preparation to the computer science option of the "agrégation de mathématiques" curriculum.

Further documents and course pages related to my older teaching activities can be found in my teaching activities page.

About LSV

Contact

Export in vCard format

Sylvain Schmitz
Address
LSV, CNRS & ENS de Cachan
61, avenue du Président Wilson
94235 CACHAN Cedex, France
Office
RH-B-102
Phone
+33 (0)1 47 40 75 42
Fax
+33 (0)1 47 40 75 21
Secr.
+33 (0)1 47 40 75 20
E-Mail
Sylvain.Schmitz@lsv.ens-cachan.fr

Funding

Conference Deadlines

On ConfSearch... | Export agenda in iCalendar format