A Formalization of SQL with Nulls.Wilmer Ricciotti and James Cheney. Journal of Automated Reasoning 66, 989–1030. 2022
Intensional datatype refinement: with application to scalable verification of pattern-match safety.Eddie Jones and Steven Ramsay. Proceedings of the ACM on Programming Languages, Volume 5, Issue POPL, 2021, Article No.: 55, 1–29. 2021
Foundations of Persistent Programming.Hans-J. Boehm, Ori Lahav, and Azalea Raad. In Dagstuhl Reports, Volume 11, Issue 10, pp. 94-110, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022) 2022
Formal verification of high-level synthesis.Yann Herklotz, James D. Pollard, Nadesh Ramanathan, and John Wickerson. Proceedings of the ACM on Programming Languages, Volume 5, Issue OOPSLA, 2021, Article No.: 117, 1–30. 2021
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
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
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
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
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
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
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.