Filter by
Annual Report 2022/2023
VeTSS
2023
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
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
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
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
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
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
A Formalization of SQL with Nulls.
Wilmer Ricciotti and James Cheney.
Journal of Automated Reasoning 66, 989–1030. 2022
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
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
Mind the Gap: Bit-vector Interpolation recast over Linear Integer Arithmetic.
Takamasa Okudono and Andy King.
In: Biere, A., Parker, D. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2020. Lecture Notes in Computer Science, vol 12078. 2020
Describing and Simulating Concurrent Quantum Systems.
Richard Bornat, Jaap Boender, Florian Kammueller, Guillaume Poly, and Rajagopal Nagarajan.
In: Biere, A., Parker, D. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2020. Lecture Notes in Computer Science, vol 12079. 2020
by