Filter by
Annual Report 2022/2023
VeTSS
2023
VeTSS EDI statement.
VeTSS
2023
Away From Linear Models of Concurrent Programs
Daniel Wright.
PhD Thesis, University of Kent. 2022
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
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
Towards verified file systems.
Andrea Giugliano.
PhD Thesis, University of Leicester. 2018
A B-tree library for Ocaml.
Tom Ridge.
ICFP 2017. 2017
Logic in Computer ScienceOn the Quest for an Acyclic Graph.
Mikolas Janota, Radu Grigore, and Vasco Manquinho.
arXiv: Logic in Computer Science. 2017
ExpoSE: practical symbolic execution of standalone JavaScript.
Blake Loring, Duncan Mitchell, and Johannes Kinder.
SPIN 2017: Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, July 2017, 196–199. 2017
Problem Book 2024
VeTSS, 2024.
Semantics of Remote Direct Memory Access: Operational and Declarative Models of RDMA on TSO Architectures.
Guillaume Ambal, Brijesh Dongol, Haggai Eran, Vasileios Klimis, Ori Lahav, Azalea Raad.
Proceedings of the ACM on Programming Languages, Volume 8, Issue OOPSLA2
Article No.: 341, Pages 1982 – 2009. OOPSLA 2024.
by