Paul Brunet's home page

Contact: Paul[at]Brunet-Zamansky[dot]fr.

About me

I am a Research Associate in the Programming Principles, Logic and Verification group (PPLV) at UCL’s Dept. of Computer Science, which I joined in January 2017. Since October 2018 I am a member of the IRIS project, working with David Pym and James Brotherston. I hold a PhD in Computer Science from the University of Lyon, under the supervision of Damien Pous.

My research focuses on theoretical aspects of software verification. More specifically I study the algebraic properties of various models of program behaviour. My interests also include logic, automata theory, mechanised proofs, concurrency theory and nominal mathematics. I have authored a number of papers in peer-reviewed international conferences and journals on some of these topics.

My CV is here, and you can download it as a PDF in english or in french.

I have profiles on these websites:

dblp Google Scholar Research Gate ORCID

News

[News archive]
26 August 2020
Our paper on POCKA is now available here!
03 July 2020
I gave a talk on our paper on pomsets with boxes at FSCD 2020.
29 June 2020
Our paper on POCKA has been accepted and will be presented at this year's CONCUR!
04 June 2020
I'll be talking about new models of concurrent Kleene algebra at the PPS seminar on Tuesday 9 June at 4pm.
17 April 2020
Our new FoSSaCS paper on CKAO is now available here.
14 April 2020
Our paper on "Pomsets with Boxes", with David Pym, has been accepted at FSCD!
31 March 2020
WoLLIC 2020 has been cancelled.
03 March 2020
My talk on commutative Kleene algebra has been accepted as a short contribution at RAMiCS.

Research

My research interests include (but are not limited to) language theory, formal proofs, type theory, relation algebra, automata theory...

Publications

[Full list of papers]
Partially Observable Concurrent Kleene Algebra.
In CONCUR,
2020.
Pomsets with Boxes: Protection, Separation, and Locality in Concurrent Kleene Algebra.
With David Pym.
In FSCD,
2020.
Concurrent Kleene Algebra with Observations: From Hypotheses to Completeness.
In FoSSaCS,
2020.
A Complete Axiomatisation of a Fragment of Language Algebra.
In CSL,
2020.
A note on commutative Kleene algebra.
2019.
A Kleene theorem for nominal automata.
In ICALP,
2019.

Coauthors

My research is the result of collaborations with many friends and colleagues. I have in particular written papers together with these people:

Editorial activities

I am a member of the PC of WoLLIC 2020.

I have been a subreviewer for the following conferences, workshops and journals:

MFCS, FSTTCS, JFLA, JLAMP, EXPRESS/SOS, ICALP, FoSSaCS, Petri Nets, ICFP, LiCS, CPP, FORTE, SoSyM, TDSC, CSR.

Teaching

  • MEng/BSc Computer Science, University College London
    • Computability and Complexity Theory – problem classes (2017-2019) [More]
  • Master program in ÉNS de Lyon
    • Semantics and Verification – exercises (2016) [more]
  • 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)