I welcome applications from prospective doctoral students with interests in semantics of programming languages, automata theory and software verification. The next application deadline for most Oxford scholarships is Friday 9th December 2022.
My research concerns the semantics of programing languages and its applications in software verification. I am interested in a broad spectrum of programming paradigms. Most recent examples include higher-order recursion, first- and higher-order state, concurrency, exceptions and objects.
Much of my work is based on game semantics, a modelling theory that uses games to model computation (a brief introduction to the area can be found here).
I like to blend research in semantics with automata theory. The latest examples are collapsible pushdown automata, automata over infinite alphabets and tree-stack automata. I am also interested in probabilistic systems in the context of differential privacy and machine learning. For more details, please see my publications page.
Recent events: POPL 2023 (pc), PERR 2022 (talk), LICS 2022 (talk), APLAS 2022(pc), LICS 2021 (paper), FSTTCS 2021 (pc), FCT 2021 (pc), ESOP 2021 (paper), FOSSACS 2021 (paper), CSL 2021 (pc), Highlights 2020 (talk), FSTTCS 2020 (pc), HOPE 2020 (paper), PERR 2020 (oc), GaLoP 2020 (pc), LSCSB (talk), FoSSaCS 2020 (pc), POPL 2020 (pc), ATVA 2019 (paper), Highlights 2019 (talk), FoPPS 2019 (course), CONCUR 2019 (paper), MFCS 2019 (paper, pc), ESSLLI 2019 (course), PERR 2019 (pc), POPL 2018 (paper), ATVA 2018 (paper), MFCS 2018 (paper), Dagstuhl 18151 (oc), FoSSaCS 2018 (pc), FLoC 2018 (oc), CONCUR 2017 (paper), ESOP 2017 (paper), FOSSACS 2017 (co-chair), POPL 2017 (erc), ···.