Vincent Penelle

Curriculum Vitæ :

Download the Curriculum Vitæ in french, in english.
CV_english

Vincent PENELLE

Adress: 390 rue de Bègles
33800 Bordeaux, France
Phone: 06 31 30 63 80
E-mail: vincent.penelle@u-bordeaux.fr
French citizen
Birthdate: February 24, 1988
webpage: http://www.labri.fr/perso/vpenelle

Current Position


Maître de conférence (associate professor) in LaBRI (University of Bordeaux), Méthodes Formelles team. I am a member of the ANR projects BraVAS and Delta.

I am mainly interested in automata theory, language theory, formal verification and infinite graph theory. Previously, I worked on the origin semantic of streaming transducers the decidability of logics over words (variants of MSO and FO), stack tree rewriting systems and trace languages of vector addition systems, problems on which I am still interested.


Previous positions


2016–2017 : Post-doc in the computer science institute of the University of Warsaw, in the project «A unified theory of finite state recognisability», lead by Mikołaj Bojanczyk.
February–June 2016 : Research visit with Matthew Hague, Royal Holloway, University of London
2015–2016 : demi-ATER in the Algorithmique team. LIGM, UPEM
2012–2015 : Allocataire moniteur in the Algorithmique team. LIGM, UPEM

Education


2012–2015 : PhD supervised by Didier Caucal and Antoine Meyer. LIGM, UPEM
2011–2012 : Research internship supervised by Didier Caucal and Antoine Meyer. LIGM, UPEM.
2010–2011 : 2nd year of Master Parisien de Recherche en Informatique (MPRI) (mention bien). ENS Cachan (normalien).
2009–2010 : 1st year of Master Parisien de Recherche en Informatique (MPRI) (mention très bien). ENS Cachan (normalien).
2008–2009 : Licence of mathematics of ENS Cachan (mention bien) and licence of computer sciences of ENS Cachan (mention très bien). Normalien.
2006–2008 : Classe préparatoires, MPSI - MP* in Lycée Michel Montaigne (Bordeaux). Admitted at the ENS Cachan concourse.
2006 : Baccalauréat scientifique, speciality mathematics (mention très bien) in Lycée de l’Image et du son (Angoulême).

Information about PhD


Title : Rewriting Higher-order Stack Trees and Traces of Counter Systems
Advisors : Didier Caucal and Antoine Meyer
Laboratory : LIGM, Université Paris-Est, Marne-la-vallée
Defence : 20 novembre 2015
Mention : UPEM does not give any mention
Jury :
Marie-Pierre Béal,Didier Caucal,
Thomas Colcombet,Jérôme Leroux,
Christof Loeding (Rewiewer),Antoine Meyer
Géraud Sénizergues (Rewiewer).

Publications


Dans un journal avec comité de relecture

[1]
Vincent Penelle. Rewriting higher-order stack trees. Theory Comput. Syst., 61(2):536–580, 2017.

Dans une conférence internationale avec comité de relecture

[2]
Mikołaj Bojańczyk, Laure Daviaud, Bruno Guillon, and Vincent Penelle. Which classes of origin graphs are generated by transducers. In 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, pages 114:1–114:13, 2017.
[3]
Sougata Bose, Anca Muscholl, Vincent Penelle, and Gabriele Puppis. Origin-equivalence of two-way word transducers is in PSPACE. In 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2018, December 11-13, 2018, Ahmedabad, India, pages 22:1–22:18, 2018.
[4]
Sougata Bose, Krishna Shankara Narayanan, Anca Muscholl, Vincent Penelle, and Gabriele Puppis. On synthesis of resynchronizers for transducers. In 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, AAchen, Germany, page To Appear, 2019.
[5]
Matthew Hague and Vincent Penelle. Constrained dynamic tree networks. In Reachability Problems - 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings, pages 45–58, 2018.
[6]
Jérôme Leroux, Vincent Penelle, and Grégoire Sutre. On the context-freeness problem for vector addition systems. In LICS, pages 43–52. IEEE Computer Society, 2013.
[7]
Jérôme Leroux, Vincent Penelle, and Grégoire Sutre. The context-freeness problem is conp-complete for flat counter systems. In Franck Cassez and Jean-François Raskin, editors, ATVA, volume 8837 of Lecture Notes in Computer Science, pages 248–263. Springer, 2014.
[8]
Vincent Penelle. Rewriting higher-order stack trees. In Lev D. Beklemishev and Daniil V. Musatov, editors, CSR, volume 9139 of Lecture Notes in Computer Science, pages 364–397. Springer, 2015. Best Student Paper Award.
[9]
Vincent Penelle, Sylvain Salvati, and Grégoire Sutre. On the boundedness problem for higher-order pushdown vector addition systems. In 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2018, December 11-13, 2018, Ahmedabad, India, pages 44:1–44:20, 2018.


Presentations



Other research activities



Teaching since 2017 (university of Bordeaux)



Teaching before 2017 (364h)



Ce document a été traduit de LATEX par HEVEA