Modular Relaxed Dependencies in Weak Memory Concurrency.Marco Paviotti, Simon Cooksey, Anouk Paradis, Daniel Wright, Scott Owens, and Mark Batty. In: Müller, P. (eds) Programming Languages and Systems. ESOP 2020. Lecture Notes in Computer Science, vol 12075. 2020
The Taint Rabbit: Optimizing Generic Taint Analysis with Dynamic Fast Path Generation.John Galea and Daniel Kroening. ASIA CCS ’20: Proceedings of the 15th ACM Asia Conference on Computer and Communications Security, October 2020, 622–636. 2020
CoSMed: A Confidentiality-Verified Social Media Platform.Thomas Bauereiss and Andrei Popescu. Arch. Formal Proofs 2021. 2021
CoSMeDis: A Confidentiality-Verified Distributed Social Media Platform.Thomas Bauereiss and Andrei Popescu. Arch. Formal Proofs 2021. 2021
CoCon: A Confidentiality-Verified Conference Management System.Andrei Popescu, Peter Lammich, and Thomas Bauereiss. Arch. Formal Proofs 2021. 2021
Foundations of Persistent Programming.Hans-J. Boehm, Ori Lahav, and Azalea Raad. In Dagstuhl Reports, Volume 11, Issue 10, pp. 94-110, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022) 2022
Canonical Algebraic Generators in Automata LearningStefan Jens Zetzsche. PhD Thesis, University College London. 2023
Specifying and Verifying Persistent Transactional MemoryEleni Vafeiadi Bila. PhD Thesis, University of Surrey. 2023
Verified compilation of a purely functional language to a realistic machine semanticsHrutvik Kanabar. PhD Thesis, University of Kent. 2023
Lightweight Approaches to the Verification of Functional Programs.Eddie Jones. PhD Thesis, University of Bristol. 2023