Talks

LEA Struco Kick-off Meeting, 2:10pm, December 8th, 2011, LIAFA, Paris, France.
I presented an overview of the current work on Algorithmic Theory of WQOs.
ReacHard Kick-off Meeting, 5pm, December 6th, 2011, LSV, Cachan, France.
I presented an overview of the current work on Algorithmic Theory of WQOs.
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.
Séminaire Algo, 2:30pm, March 8, 2011, LIGM, Marne-la-Vallée, France.
Upper bounds on Dickson's Lemma, again! OK, I slightly changed the presentation to better match the work on Higman's Lemma with Ph. Schnoebelen.
Séminaire "Automates", 2:30pm, March 4, 2011, room 1C12, LIAFA, Paris, France.
A new presentation of the work on complexity upper bounds for controlled versions of Dickson's Lemma with D. Figueira, S. Figueira, and Ph. Schnoebelen. Here are the slides.
INFINI working group, 2pm, February 22, 2011, Library, ENS Cachan, France.
A presentation of the new results on complexity upper bounds on Higman's Lemma obtained with Ph. Schnoebelen.
Séminaire du groupe Graphes et Logique, 11am, November 23, 2010, room 76, LaBRI, Bordeaux, France.
A presentation of the work on complexity upper bounds for controlled versions of Dickson's Lemma with D. Figueira, S. Figueira, and Ph. Schnoebelen. Here are the slides.
ACL 2010, 4:45pm, July 12, 2010, Venue A, Hall IX, Uppsala University, Uppsala, Sweden.
A survey of complexity problems for BVAS.
Séminaire LIFO, 2pm, June 28, 2010, Salle de cours E15, Université d'Orléans, France.
A survey of complexity problems for BVAS. Here are the slides.
INFINI working group, 2pm, February 2, 2010, Library, ENS Cachan, France.
A survey of complexity and decidability problems for BVAS and related formalisms, with an introduction to their use in computational linguistics.
INFINI working group, 4pm, November 10, 2009, Library, ENS Cachan, France.
A presentation of a proof of decidability of language boundedness for WSTS.
CIAA'09, 2pm, July 15, 2009, NICTA's Neville Roach Laboratory, Sydney, Australia.
I presented the paper written with Pierre-Cyrille Héam and Cyril Nicaud on the Random Generation of Deterministic Tree (Walking) Automata. Here are the slides.
INFINI working group, 2pm, June 2, 2009, Library, ENS Cachan, France.
A presentation of a proof of decidability of language boundedness for Petri nets.
INFINI working group, 2pm, February 3, 2009, Library, ENS Cachan, France.
A presentation of the proof of decidability of CFL inclusion when one of the grammars has a bounded language, a result due to Ginsburg and Spanier, 1964.
INFINI working group, 2pm, October 7, 2008, Library, ENS Cachan, France.
A talk on grammar verification.
LSV Seminars, 11am, September 23, 2008, Pavillon des jardins, ENS Cachan, France.
An updated presentation on the test suite generation project.
NaTAL Workshop, 12am, June 25, 2008, LORIA, room B011, Nancy, France.
Just like other error mining techniques, mining for over-generation issues in a grammar requires a test suite in order to detect failures. I presented the current state of my work (in progress) that aims to generate such a test suite directly from the grammar, in order to explore its quirks and corner cases in an orderly manner.
Séminaires de Linguistique Informatique à Bordeaux, 5pm, May 19, 2008, LaBRI, room 076, Bordeaux, France.
A revamped presentation on two-level syntax for TAGs, with the usual emphasis on surface realization and over-generation.
Systèmes à événements discrets, 2:30pm, April 28, 2008, LIAFA, sous-marin, Paris, France.
A presentation of modular syntax formalisms used for programming languages, and of their verification problems. Parts of the talk is based on the Modular Syntax Demands Verification paper. (slides)
MOSTRARE Seminars, 10:30am, April 18, 2008, INRIA building, room W11, Lille, France.
A seminar on computations using the derivation tree language of a tree adjoining grammar. Half survey of surface realization techniques from tree adjoining grammars, half presentation of the results obtained with Joseph Le Roux.
TAL Seminars, 2pm, October 18, 2007, room A006, LORIA, Nancy, France.
Same Ph.D. talk for the NLP crowd here and the students of Nancy's Computational Linguistics Masters.
Ph.D. defense, 1:30pm, September 24, 2007, conference room, I3S Laboratory, Sophia Antipolis, France.
My Ph.D. presentation; thanks to all attendees!
RECIF/MC3 seminars, 1:45pm, September 20, 2007, meeting room, I3S Laboratory, Sophia Antipolis, France.
Ph.D. rehearsal on Approximating Context-Free Grammars for Parsing and Verification in presence of the available language theory-savvy fews, teammates, and three students from ENS. Here are the slides.
ICALP'07, 12:30am, July 12, 2007, small western lecture hall (SW), Uniwersytet Wrocławski, Wrocław, Poland
I presented my paper Conservative Ambiguity Detection in Context-Free Grammars. Here are the slides.
LDTA'07, 2:30pm, March 25, 2007, room CP2-111, Universidade do Minho, Braga, Portugal.
I presented my paper An Experimental Ambiguity Detection Tool. Here are the slides.
CIAA'06, 4:00pm, August 23, 2006, Barry Lam Hall, NTU, Taipei, Taiwan.
I presented our paper Shift-Resolve Parsing: Simple, Linear Time, Unbounded Lookahead. Here are the slides.
DLT'06, 2:30pm, June 26, 2006, UCSB, Santa Barbara, California.
I presented my paper Noncanonical LALR(1) Parsing. Here are the slides.
EJC06, 5pm, May 16, 2006, amphitheater 050, LaBRI, Bordeaux, France.
I presented an introduction to noncanonical parsing and to the construction of noncanonical parsers from canonical bottom-up parsers at this theoretical computer science summer school. Here are the slides.
3rd PhD seminars, 4:30pm, May 10, 2006, room EN 05, Eurecom Institute, Sophia Antipolis, France
I presented a short tutorial on noncanonical parsing for the third edition of this monthly event I help organize in Sophia Antipolis. Here are a (slightly technical) short abstract and the slides of the talk.

About LSV

Navigation