Filter by
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
Sound regular expression semantics for dynamic symbolic execution of JavaScript.
Blake Loring, Duncan Mitchell, and Johannes Kinder.
PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 425–438. 2019
A Formal Model for Checking Cryptographic API Usage in JavaScript.
Duncan Mitchell and Johannes Kinder.
In: Sako, K., Schneider, S., Ryan, P. (eds) Computer Security – ESORICS 2019. Lecture Notes in Computer Science, vol 11735. 2019
Annual Report 2018/2019
VeTSS
2019
Towards verified file systems.
Andrea Giugliano.
PhD Thesis, University of Leicester. 2018
Program Verification in the Presence of I/O.
Hugo Férée, Johannes Å. Pohjola, Ramana Kumar, Scott Owens, Magnus O. Myreen, and Son Ho.
In: Piskac, R., Rümmer, P. (eds) Verified Software. Theories, Tools, and Experiments. VSTTE 2018. Lecture Notes in Computer Science, vol 11294. 2018
History-deterministic Timed Automata.
Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke.
History-deterministic Timed Automata. 2024. In Logical Methods in Computer Science, 20(4:1). 2024.
by