Paul Brunet

Date of Birth May 28th, 1988
Nationality French
Email
Homepage paul.brunet-zamansky.fr

Employment

Since Jan. 2017 Research Associate in University College London
Alexandra Silva – PPLV group
Oct. - Dec. 2016 Reseach Assistant in CNRS - ÉNS de Lyon
Damien Pous – Plume team
Sept. 2013 - Sept. 2016 PhD Student with Teaching duties in Université Lyon 1
Damien Pous – Plume team

PhD

“Relation Algebras : from algorithms to formal proofs.”

PhD Thesis with Damien Pous in UCB Lyon 1 and the LIP in the ÉNS de Lyon.

Defended on October 4th, 2016.

Publications

  • Journal papers
    1. P. Brunet and D. Pous, “Petri Automata”, Logical Methods in Computer Science, to appear, 2017.
    2. P. Brunet and D. Pous, “Algorithms for Kleene algebra with converse”, Journal of Logical and Algebraic Methods in Programming, vol. 85, no. 4, pp. 574–594, 2016.
  • Conference Papers
    1. P. Brunet, T. Kappe, B. Luttik, A. Silva, and F. Zanasi, “Brzozowski goes concurrent - a Kleene theorem for pomset languages,” in CONCUR, LIPIcs, 2017.
    2. P. Brunet, D. Pous, and G. Struth, “On decidability of concurrent Kleene algebra,” in CONCUR, LIPIcs, 2017.
    3. P. Brunet, “Reversible Kleene lattices,” in MFCS, LIPIcs, 2017.
    4. P. Brunet, D. Pous, and I. Stucke, “Cardinalities of Finite Relations in Coq,” in ITP, Springer, 2016.
    5. P. Brunet and D. Pous, “A Formal Exploration of Nominal Kleene Algebra,” in MFCS, LIPIcs, 2016.
    6. P. Brunet and D. Pous, “Decidability of Identity-free Relational Kleene Lattices,” in JFLA, 2015.
    7. P. Brunet and D. Pous, “Petri Automata for Kleene Allegories,” in LICS, IEEE, 2015.
    8. P. Brunet and D. Pous, “Kleene Algebra with Converse,” in RAMICS, Springer, 2014.

Peer-review activities

Workshops:
EXPRESS/SOS 2015, JFLA 2015
Conferences:

FSTTCS 2014, MFCS 2014, FoSSaCS 2016, ICALP 2016, ICALP 2017, ICFP 2017, Petri Nets 2017, MFCS 2017

Journal:

Journal of Logical and Algebraic Methods in Programming

Selected talks

  • Decidability of Concurrent Kleene Algebra
    • September 2017, CONCUR – Berlin
  • Reversible Kleene Algebras
    • August 2017, MFCS – Aalborg
  • The equational theory of algebras of languages
    • September 2017, Highlights – London
    • August 2017, BLAST – Nashville
    • May 2017, RAMiCS – Lyon
  • The equational theory of positive relation algebra
    • March 2017, Move seminar – Marseille
    • November 2016, PACE meeting – Shanghai
  • A Kleene theorem for Petri automata
    • September 2016, Highlights – Brussels
  • Algèbres de Kleene : entre sémantique des programmes et automatisation des mathématiques
    • May 2016, Inter’Actions en Mathématiques – Lyon
  • Petri automata for Kleene allegories
    • June 2015, Rapido meeting – Paris
    • April 2015, Midlands Graduate School – Sheffield
  • Decidability of identity-free Kleene lattices
    • November 2014, LAC meeting – Chambéry
  • Deciding Kleene algebra with converse is PSpace-complete
    • March 2014, GeoCal meeting – Bordeaux
    • February 2014, Pace meeting – Lyon

Teaching

  • Master program in ÉNS de Lyon
    • Semantics and Verification – exercises (2016)
  • Master program in UCB Lyon 1
    • Calculability and complexity – exercises (2014-2015)
  • Bachelor degree in UCB Lyon 1
    • Industrial Internship – reports (2014-2016)
    • Theory of formal languages – exercises & project (2013-2015)
    • Classical logic – exercises & project (2014-2015)
    • Numeric Algorithms – exercises (2013)
    • Algorithmics and Imperative programming – exercises & programming (2013-2014)

Education

2011-2013 Université Paris VII Diderot
Paris Master Parisien de Recherche en Informatique – Summa Cum Laude
Main topics Logics, Semantics, Automata Theory, Lambda-calculus, Categories, Functional Programming.
2009-2010 École Normale Supérieure de Cachan, antenne de Bretagne
Rennes Second Year in Computer Science
Main topics Logics, Algorithmics and Computer Science Foundations.
2008-2009 École Normale Supérieure de Cachan, antenne de Bretagne
Rennes Licence d’Informatique (Bachelor’s Degree in Computer Science)
Main topics Logics, Algorithmics and Computer Science Foundations.
2007-2008 École Normale Supérieure de Lyon
Lyon First Year in Computer Science
Main topics Logics, Algorithmics and Computer Science Foundations.
2005-2007 Lycée Corneille
Rouen Classe Préparatoire aux Grandes Écoles
Main topics Mathematics, Physics and Computer Science.
2005 Lycée Jean Prévost
Montivilliers Baccalauréat Scientifique option Physique – Summa Cum Laude
Main topics Mathematics, Physics and Biology.

Internships

2013 Relation algebras, automata and regular expressions
Lyon École Normale Supérieure de Lyon
supervised by Damien Pous in the team Plume
2012 Categorical study of the exponential in Linear Logic
Paris University Paris VII Diderot
supervised by Paul-André Melliès
2011 Functional Minimalist Grammars
Chicago, IL University of Chicago
supervised by Gregory M. Kobele
2009 Relevance of linear logic for composing semantic representations in simply typed λ-calculus
Bordeaux Laboratoire Bordelais de Recherche en Informatique
supervised by Christian Retoré and Lionel Clément in the team Signes
2008 Proof to help programming
Saclay INRIA Saclay Île de France
supervised by Sylvie Boldo in the team Proval

Skills

  • Languages: French, English
  • Programming: Proficient in OCaml, Coq and L A TEX, working knowledge of C/C++, java, python, HTML, CSS, PHP and SQL
  • Operating Systems: Ubuntu, ArchLinux and Windows