Nanevski, A., Morrisett, G., Shinnar, A., Govereau, P.
& Birkedal, L. (2008).
Ynot: Depent Types for Imperative Programs. In
International Conference on Functional Programming: Proceeding of the 13th ACM SIGPLAN International Conference on Functional Programming, (Vol. session 9, pp. 229-240). Association for Computing Machinery.
Nanevski, A., Ahmed, A., Morrisett, G.
& Birkedal, L. (2007).
Abstract predicates and mutable ADTs in hoare type theory. In R. D. Nicola (Ed.),
Programming Languages and Systems: 16th European Symposium on Programming, ESOP 2007, Held as Part of the Joint European Conferences on Theory and Practics of Software, ETAPS 2007, Braga, Portugal, March 24 - April 1, 2007. Proceedings (pp. 189-204). Springer VS.
https://doi.org/10.1007/978-3-540-71316-6_14
Namakonov, E. S., Fasse, J., Jacobs, B.
, Birkedal, L. & Timany, A. (2025).
Lawyer: Modular Obligations-Based Liveness Reasoning in Higher-Order Impredicative Concurrent Separation Logic. Paper presented at Object-Oriented Programming, Systems, Languages & Applications 2026, Oakland, United States. Advance online publication.
Mortensen, K. O., Skitsas, K., Christensen, E. M., Talebi, M. S.
, Pavlogiannis, A., Mottin, D. & Karras, P. (2025).
SwiftVI: Time-Efficient Planning and Learning with MDPs. In M. Zaharia, G. Joshi & Y. Lin (Eds.),
Proceedings of Machine Learning and Systems (Vol. 7). MLSys.
https://proceedings.mlsys.org/paper_files/paper/2025/file/0f8426558905746fc38da5e335700aec-Paper-Conference.pdf
Mehnert, H.
, Sieczkowski, F., Birkedal, L. & Sestoft, P. (2012).
Formalized verification of snapshotable trees: Separation and sharing. In R. Joshi, P. Müller & A. Podelski (Eds.),
Verified Software: Theories, Tools, Experiments: 4th International Conference, VSTTE 2012, Philadelphia, PA, USA, January 28-29, 2012. Proceedings (pp. 179-195). Springer.
https://doi.org/10.1007/978-3-642-27705-4_15
Mathiasen, A. A., Gondelman, L.
, Ducruet, L., Timany, A. & Birkedal, L. (2025).
Reasoning about Weak Isolation Levels in Separation Logic.
Proceedings of the ACM on Programming Languages ,
9(ICFP), 306-340.
https://doi.org/10.1145/3747515
Marionneau, V., Sassus Bourda, F.
, Aguirre, A. & Birkedal, L. (2026).
Modular Specifications and Implementations of Random Samplers in Higher-Order Separation Logic. In K. Stark, Y. Zakowski, N. Swamy & N. Tabareau (Eds.),
CPP 2026 - Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs, Co-located with POPL 2026 (pp. 368-382)
https://doi.org/10.1145/3779031.3779109
Madsen, M. & Andreasen, E. (2014).
String Analysis for Dynamic Field Access. In A. Cohen (Ed.),
Compiler Construction: 23rd International Conference, CC 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014. Proceedings (pp. 197-217). Springer.
https://doi.org/10.1007/978-3-642-54807-9_12