Sylvain Schmitz

Most recent work:

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...

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.

Séminaire 68NQRT, 2:30pm, June 9, 2011, IRISA/INRIA, Rennes, France.

Upper bounds with Higman's Lemma, following the ICALP 2011 paper. Here are the slides.

More talks...

• PC member for RP'12, CSLP'12, LDTA'12, LDTA'11, TAG+10, TAG+9;
• reviewer for LATA'12, MFCS'11, DLT'11, Petri nets '11, LATA'11, STACS'11, ICTAC'10, DLT'10, JFPC'10, CAV'10, FoSSaCS'10, TACAS'10, SOFSEM'10, IWPT'09, MFCS'09, ICTAC'09, CIAA'07, CIAA'06, CIAA'05, ICALP'05;
• organizing committee of CIAA'05, and also co-editor of the LNCS 3845 proceedings with Jacques Farré and Igor Litovsky, and webmaster.