Filter by
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
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
Canonical Automata via Distributive Law Homomorphisms.
Stefan Zetzsche, Gerco van Heerdt, Matteo Sammartino, and Alexandra Silva.
EPTCS 351, 2021, 296-313. 2021
Away From Linear Models of Concurrent Programs
Daniel Wright.
PhD Thesis, University of Kent. 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
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
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
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
Annual Report 2020/2021
VeTSS
2021
Connecting software build with maintaining consistency between models: towards sound, optimal, and flexible building from megamodels.
Perdita Stevens.
Softw Syst Model 19, 935–958, 2020. 2020
Distributed programming using role-parametric session types in go: statically-typed endpoint APIs for dynamically-instantiated communication structures.
David Castro, Raymond Hu, Sung-Shik Jongmans, Nicholas Ng, and Nobuko Yoshida.
Proceedings of the ACM on Programming Languages, Volume 3, Issue POPL, 2019, Article No.: 29, 1–30. 2019
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
Test-case reduction and deduplication almost for free with transformation-based compiler testing.
Alastair F. Donaldson, Paul Thomson, Vasyl Teliman, Stefano Milizia, André Perez Maselco, and Antoni Karpiński.
PLDI 2021: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, June 2021, 1017–1032. 2021
Blockchain Superoptimizer.
Julian Nagele and Maria A Schett.
Preproceedings of the 29th International Symposium on Logic-based Program Synthesis and Transformation, LOPSTR 2019, 166-180. 2019
A Key-Value store for Ocaml.
Tom Ridge.
24th ACM SIGPLAN International Conference on Functional Programming, ICFP 2019. 2019
PrideMM: A Solver for Relaxed Memory Models.
Simon Cooksey, Sarah Harris, Mark Batty, Radu Grigore, and Mikoláš Janota.
arXiv: Logic in Computer Science. 2019
Structuring the synthesis of heap-manipulating programs.
Nadia Polikarpova and Ilya Sergey.
Proceedings of the ACM on Programming Languages, Volume 3, Issue POPL, 2019, Article No.: 72, 1–30. 2019
Distributed Protocol Combinators.
Kristoffer J. A. Andersen and Ilya Sergey.
In: Alferes, J., Johansson, M. (eds) Practical Aspects of Declarative Languages. PADL 2019. Lecture Notes in Computer Science, vol 11372. 2019
by