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, [...]
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. [...]
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, [...]
Checking cryptographic API usage with composable annotations (short paper).
Duncan Mitchell, L. Thomas van Binsbergen, Blake Loring, and Johannes Kinder. PEPM ’18: Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, [...]
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
by