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
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, [...]
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, [...]
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
by