Filter by
Deadlock-free asynchronous message reordering in Rust with multiparty session types.
Zak Cutner, Nobuko Yoshida, and Martin Vassor.
PPoPP ’2022. 2022
Neural Network Robustness as a Verification Property: A Principled Case Study.
Marco Casadio, Ekaterina Komendantskaya, Matthew L. Daggitt, Wen Kokke, Guy Katz, Guy Amir, and Idan Refaeli.
International Conference on Computer Aided Verification, CAV 2022: Computer Aided Verification, 219–231. 2022
An Internal Language for Categories Enriched over Generalised Metric Spaces.
Fredrik Dahlqvist and Renato Neves.
In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 16:1-16:18 2022
The leaky semicolon: compositional semantic dependencies for relaxed-memory concurrency.
Alan Jeffrey, James Riely, Mark Batty, Simon Cooksey, Ilya Kaysin, and Anton Podkopaev.
Proceedings of the ACM on Programming Languages, Volume 6, Issue POPL 2022, Article No.: 54, 1–30. 2022
CycleQ: an efficient basis for cyclic equational reasoning.
Eddie Jones, C.-H. Luke Ong, and Steven Ramsay.
PLDI 2022: Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language, Pages 395–409. 2022
Resource Sharing for Verified High-Level Synthesis.
Michalis Pardalos, Yann Herklotz, and John Wickerson.
IEEE 30th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM), 2022, 1-6. 2022
Canonical Algebraic Generators in Automata Learning
Stefan Jens Zetzsche.
PhD Thesis, University College London. 2023
Specifying and Verifying Persistent Transactional Memory
Eleni Vafeiadi Bila.
PhD Thesis, University of Surrey. 2023
Verified compilation of a purely functional language to a realistic machine semantics
Hrutvik Kanabar.
PhD Thesis, University of Kent. 2023
Lightweight Approaches to the Verification of Functional Programs.
Eddie Jones.
PhD Thesis, University of Bristol. 2023
Two Mechanisations of WebAssembly 1.0.
Conrad Watt, Xiaojia Rao, Jean Pichon-Pharabod, Martin Bodin, and Philippa Gardner.
In Huisman, M., Păsăreanu, C., Zhan, N. (eds) Formal Methods. FM 2021. Lecture Notes in Computer Science, vol 13047. 2021
Bounded-Deducibility Security (Invited Paper).
Andrei Popescu, Thomas Bauereiss, and Peter Lammich.
In L. Cohen, & C. Kaliszyk (Eds.), 12th International Conference on Interactive Theorem Proving, ITP 2021, Italy, 3:1-3:20. 2021
Intensional datatype refinement: with application to scalable verification of pattern-match safety.
Eddie Jones and Steven Ramsay.
Proceedings of the ACM on Programming Languages, Volume 5, Issue POPL, 2021, Article No.: 55, 1–29. 2021
Formal verification of high-level synthesis.
Yann Herklotz, James D. Pollard, Nadesh Ramanathan, and John Wickerson.
Proceedings of the ACM on Programming Languages, Volume 5, Issue OOPSLA, 2021, Article No.: 117, 1–30. 2021
An Empirical Study of the Reliability of High-Level Synthesis Tools.
Yann Herklotz, Zewei Du, Nadesh Ramanathan, and John Wickerson.
IEEE 29th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM), 2021, 219-223. 2021
Verifying correctness of persistent concurrent data structures: a sound and complete method.
John Derrick, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim.
Formal Aspects of Computing, Volume 33, Issue 4-5, 547–573. 2021
Modularising Verification Of Durable Opacity.
Eleni Bila, John Derrick, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim.
Logical Methods in Computer Science, July 28, 2022, Volume 18, Issue 3. 2022
Canonical Automata via Distributive Law Homomorphisms.
Stefan Zetzsche, Gerco van Heerdt, Matteo Sammartino, and Alexandra Silva.
EPTCS 351, 2021, 296-313. 2021
by