Filter by
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
Query Lifting: Language-integrated query for heterogeneous nested collections.
Wilmer Ricciotti & James Cheney.
In: Yoshida, N. (eds) Programming Languages and Systems. ESOP 2021, vol 12648, 579–606. 2021
View-Based Owicki–Gries Reasoning for Persistent x86-TSO.
Eleni Vafeiadi Bila, Brijesh Dongol, Ori Lahav, Azalea Raad, and John Wickerson
In: Sergey, I. (eds) Programming Languages and Systems. ESOP 2022. Lecture Notes in Computer Science, vol 13240. 2022
Protocol combinators for modeling, testing, and execution of distributed systems.
Kristoffer Just Arndal Andersen and Ilya Sergey.
Journal of Functional Programming, 31, E3, 2021. 2021
Away From Linear Models of Concurrent Programs
Daniel Wright.
PhD Thesis, University of Kent. 2022
PISTIS: An Event-Triggered Real-Time Byzantine-Resilient Protocol Suite.
David Kozhaya, Jérémie Decouchant, Vincent Rahli, and Paulo Esteves-Verissimo.
IEEE Transactions on Parallel and Distributed Systems, vol. 32, no. 9, 2277-2290. 2021
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
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
Compositional BD Security.
Thomas Bauereiss and Andrei Popescu.
Arch. Formal Proofs 2021. 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
CoCon: A Confidentiality-Verified Conference Management System.
Andrei Popescu, Peter Lammich, and Thomas Bauereiss.
Arch. Formal Proofs 2021. 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
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
Proof-Producing Synthesis of CakeML from Monadic HOL Functions.
Oskar Abrahamsson, Son Ho, Hrutvik Kanabar, Ramana Kumar, Magnus O. Myreen, Michael Norrish, and Yong Kiam Tan.
Journal of Automated Reasoning, 64, 1287–1306, 2020. 2020
by