Filter by
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
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
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
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
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
A Formalization of SQL with Nulls.
Wilmer Ricciotti and James Cheney.
Journal of Automated Reasoning 66, 989–1030. 2022
Canonical Automata via Distributive Law Homomorphisms.
Stefan Zetzsche, Gerco van Heerdt, Matteo Sammartino, and Alexandra Silva.
EPTCS 351, 2021, 296-313. 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
C4: the C compiler concurrency checker.
Matt Windsor, Alastair F. Donaldson, and John Wickerson.
ISSTA 2021: Proceedings of the 30th ACM SIGSOFT International Symposium on Software Testing and Analysis, July 2021, 670–673. 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
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
Away From Linear Models of Concurrent Programs
Daniel Wright.
PhD Thesis, University of Kent. 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
by