Filter by
Annual Report 2022/2023
VeTSS
2023
VeTSS EDI statement.
VeTSS
2023
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
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
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
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
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
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
CoCon: A Confidentiality-Verified Conference Management System.
Andrei Popescu, Peter Lammich, and Thomas Bauereiss.
Arch. Formal Proofs 2021. 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
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
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
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
A Formalization of SQL with Nulls.
Wilmer Ricciotti and James Cheney.
Journal of Automated Reasoning 66, 989–1030. 2022
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
by