Below you can find a list of all our publications, including the VeTSS Problem Book and our annual reports, papers authored by VeTSS supported researchers and copies of PhD theses by VeTSS funded PhD students.
Filter by
Annual Report 2023/2024
VeTSS
2025
Annual Report 2022/2023
VeTSS
2023
Annual Report 2020/2021
VeTSS
2021
Annual Report 2018/2019
VeTSS
2019
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
Towards verified file systems.
Andrea Giugliano.
PhD Thesis, University of Leicester. 2018
Annual Report 2017/2018
VeTSS
2018
A B-tree library for Ocaml.
Tom Ridge.
ICFP 2017. 2017
Type checking beyond type checkers, via slice & run.
Justus Adam and Stephen Kell.
TAPAS 2020: Proceedings of the 11th ACM SIGPLAN International Workshop on Tools for Automatic Program Analysis, November 2020, 23–29. 2020
Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory.
Eleni Bila, Simon Doherty, Brijesh Dongol, John Derrick, Gerhard Schellhorn, and Heike Wehrheim.
In: Gotsman, A., Sokolova, A. (eds) Formal Techniques for Distributed Objects, Components, and Systems. FORTE 2020. Lecture Notes in Computer Science, vol 12136. 2020
Featherweight go.
Robert Griesemer, Raymond Hu, Wen Kokke, Julien Lange, Ian Lance Taylor, Bernardo Toninho, Philip Wadler, and Nobuko Yoshida.
Proceedings of the ACM on Programming Languages, Volume 4, Issue OOPSLA, 2020, Article No.: 149, 1–29. 2020
Static Race Detection and Mutex Safety and Liveness for Go Programs.
Julia Gabet and Nobuko Yoshida.
34th European Conference on Object-Oriented Programming, ECOOP 2020. 2020
Learning Weighted Automata over Principal Ideal Domains. FoSSaCS 2020. Lecture Notes in Computer Science, vol 12077.
Gerco van Heerdt, Clemens Kupke, Jurriaan Rot, and Alexandra Silva.
In: Goubault-Larrecq, J., König, B. (eds) Foundations of Software Science and Computation Structures. 2020
Modular Relaxed Dependencies in Weak Memory Concurrency.
Marco Paviotti, Simon Cooksey, Anouk Paradis, Daniel Wright, Scott Owens, and Mark Batty.
In: Müller, P. (eds) Programming Languages and Systems. ESOP 2020. Lecture Notes in Computer Science, vol 12075. 2020
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
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
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
by