Publications

Sort by: Date | Author | Title

Liu, Z., Hammond, A., Pérami, T., Sewell, P., Birkedal, L. & Pichon-Pharabod, J. (2026). An Axiomatic Basis for Computer Programming on Relaxed Hardware Architectures: The AxSL Logics. ACM Transactions on Programming Languages and Systems. Advance online publication. https://doi.org/10.1145/3786762

Marionneau, V., Sassus Bourda, F., Aguirre, A. & Birkedal, L. (2026). Modular Specifications and Implementations of Random Samplers in Higher-Order Separation Logic. In CPP '26: Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs https://doi.org/10.1145/3779031.3779109

Shi, Z., Møldrup, L., Mathur, U. & Pavlogiannis, A. (2026). The Complexity of Testing Message-Passing Concurrency. Proceedings of the ACM on Programming Languages , 10, 1-32. https://doi.org/10.1145/3776643

van de Pol, J. & Bouyer, P. (Eds.) (2025). 36th International Conference on Concurrency Theory, CONCUR 2025. Dagstuhl Publishing. Leibniz International Proceedings in Informatics, LIPIcs Vol. 348 https://www.dagstuhl.de/dagpub/978-3-95977-389-8

Gratzer, D. (2025). A Modal Deconstruction of Löb Induction. Proceedings of the ACM on Programming Languages , 9, Article 30. https://doi.org/10.1145/3704866

Haselwarter, P. G., Li, K. H., Aguirre, A., Gregersen, S. O., Tassarotti, J. & Birkedal, L. (2025). Approximate Relational Reasoning for Higher-Order Probabilistic Programs. Proceedings of the ACM on Programming Languages , 9(POPL), 1196-1226. Article 41. https://doi.org/10.1145/3704877

Møldrup, L. & Pavlogiannis, A. (2025). AWDIT: An Optimal Weak Database Isolation Tester. Proceedings of the ACM on Programming Languages , 9, 1540-1564. Article 209. https://doi.org/10.1145/3742465

Meier, W., Jensen, M., Pichon-Pharabod, J. & Spitters, B. (2025). CertiCoq-Wasm: A Verified WebAssembly Backend for CertiCoq. In Proceedings of the 14th ACM SIGPLAN International Conference on Certified Programs and Proofs (pp. 127-139). Association for Computing Machinery. https://doi.org/10.1145/3703595.3705879

Conrado, G. K. & Pavlogiannis, A. (2025). CFL-based methods for approximating interleaved Dyck reachability. International Journal on Software Tools for Technology Transfer, 27(2), 255-266. Article 106135. https://doi.org/10.1007/s10009-025-00787-0

Shaik, I. & van de Pol, J. (2025). CNOT-Optimal Clifford Synthesis as SAT. In J. Berg, J. Nordstrom & J. Nordstrom (Eds.), 28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025 Article 28 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SAT.2025.28

Stepanenko, S., Nardino, E., Frumin, D., Timany, A. & Birkedal, L. (2025). Context-Dependent Effects in Guarded Interaction Trees. In V. Vafeiadis (Ed.), Programming Languages and Systems - 34th European Symposium on Programming, ESOP 2025, Held as Part of the International Joint Conferences on Theory and Practice of Software, ETAPS 2025, Proceedings (Vol. Part II, pp. 286-313). Springer. https://doi.org/10.1007/978-3-031-91121-7_12

Dahlsen-Jensen, M. B., Fievet, B., Petrucci, L. & van de Pol, J. (2025). Controller Synthesis for Parametric Timed Games. In P. Prabhakar & A. Vandin (Eds.), Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems - Second International Joint Conference, QEST+FORMATS 2025, Proceedings (pp. 314-332). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-032-05792-1_17

Gratzer, D., Sterling, J., Angiuli, C., Coquand, T. & Birkedal, L. (2025). Controlling unfolding in type theory. Mathematical Structures in Computer Science, 35, Article e38. https://doi.org/10.1017/S0960129525100327

Jakobsen, A. B., Clausen, A. B., van de Pol, J. & Shaik, I. (2025). Depth-Optimal Quantum Layout Synthesis as SAT. In J. Berg & J. Nordstrom (Eds.), 28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025 Article 16 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SAT.2025.16

Saioc, G.-V., Lee, I.-T. A., Møller, A. & Chabbi, M. (2025). Dynamic Partial Deadlock Detection and Recovery via Garbage Collection. In ASPLOS 2025 - Proceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems (pp. 244-259). Association for Computing Machinery. https://doi.org/10.1145/3676641.3715990

Tunç, H. C., Dong, Y., Deshmukh, A. P., Cirisci, B., Enea, C. & Pavlogiannis, A. (2025). Efficient Dynamic Concurrency Analysis with Collective Sparse Segment Trees. ACM transactions on computer systems. Advance online publication. https://doi.org/10.1145/3773085

Endo, A. T. & Møller, A. (2025). Event Race Detection for Node.js Using Delay Injections. In J. Aldrich & A. Silva (Eds.), 39th European Conference on Object-Oriented Programming, ECOOP 2025 Article 9 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ECOOP.2025.9

Madsen, M. & Lhoták, O. (2025). Flix: A Design for Language-Integrated Datalog. Proceedings of the ACM on Programming Languages , 9(OOPSLA2), 2115-2143. https://doi.org/10.1145/3763126

Bhargavan, K., Hansen, L. L., Kiefer, F., Schneider-Bensch, J. & Spitters, B. (2025). Formal Security and Functional Verification of Cryptographic Protocol Implementations in Rust. In CCS 2025 - Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security (pp. 2729-2743). Association for Computing Machinery. https://doi.org/10.1145/3719027.3765213

Chakraborty, S., Krishna, S., Pavlogiannis, A. & Tuppe, O. (2025). GPUMC: A Stateless Model Checker for GPU Weak Memory Concurrency. In R. Piskac & Z. Rakamaric (Eds.), Computer Aided Verification (pp. 321-346). Springer. https://doi.org/10.1007/978-3-031-98682-6_17

Bhargavan, K., Buyse, M., Franceschino, L., Hansen, L. L., Kiefer, F., Schneider-Bensch, J. & Spitters, B. (2025). hax: Verifying Security-Critical Rust Software Using Multiple Provers. In J. Protzenko & A. Raad (Eds.), Verified Software. Theories, Tools and Experiments - 16th International Conference, VSTTE 2024, Revised Selected Papers (pp. 96-119). Springer. https://doi.org/10.1007/978-3-031-86695-1_7

Gratzer, D., Møller, M. A. & Birkedal, L. (2025). Idempotent Resources in Separation Logic: The Heart of core in Iris. In P. A. Abdulla & D. Kesner (Eds.), Foundations of Software Science and Computation Structures - 28th International Conference, FoSSaCS 2025, Held as Part of the International Joint Conferences on Theory and Practice of Software: ETAPS 2025, Proceedings (pp. 45-66). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-90897-2_3

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.

Stassen, P., Møgelberg, R. E., Zwart, M. A., Aguirre, A. & Birkedal, L. (2025). Modelling Recursion and Probabilistic Choice in Guarded Type Theory. Proceedings of the ACM on Programming Languages , 9(POPL), 1417-1445. Article 48. https://doi.org/10.1145/3704884

Li, K. H., Aguirre, A., Gregersen, S. O., Haselwarter, P. G., Tassarotti, J. & Birkedal, L. (2025). Modular Reasoning about Error Bounds for Concurrent Probabilistic Programs. Proceedings of the ACM on Programming Languages , 9(ICFP), 276-305. https://doi.org/10.1145/3747514

Haselwarter, P. G., Aguirre, A., Gregersen, S. O., Tassarotti, J. & Birkedal, L. (2025). Modular Verification of Differential Privacy in Probabilistic Higher-Order Separation Logic. Advance online publication.

Christensen, J. E., Jørgensen, S. F., Pavlogiannis, A. & van de Pol, J. (2025). On Exact Sizes of Minimal CNOT Circuits. In R. Glück & R. Kaarsgaard (Eds.), Reversible Computation: 17th International Conference, RC 2025, Proceedings (pp. 71-88). Springer. https://doi.org/10.1007/978-3-031-97063-4_6

Tan, J. & Madsen, M. (2025). Overloading the Dot. In D. Kluss, S. Achour & J. Palsberg (Eds.), CC 2025 - Proceedings of the 34th ACM SIGPLAN International Conference on Compiler Construction (pp. 60-69). Association for Computing Machinery. https://doi.org/10.1145/3708493.3712684

Simner, B., Armstrong, A., Bauereiss, T., Campbell, B., Kammar, O., Pichon-Pharabod, J. & Sewell, P. (2025). Precise exceptions in relaxed architectures. In ISCA '25: Proceedings of the 52nd Annual International Symposium on Computer Architecture (pp. 211–224) https://doi.org/10.1145/3695053.3731102

Conrado, G. K., Kjelstrøm, A. H., Van De Pol, J. & Pavlogiannis, A. (2025). Program Analysis via Multiple Context Free Language Reachability. Proceedings of the ACM on Programming Languages , 9, Article 18. https://doi.org/10.1145/3704854

Sølvsten, S., Rysgaard, C. M. & van de Pol, J. (2025). Random Access on Narrow Decision Diagrams in External Memory. In T. Neele & A. Wijs (Eds.), Model Checking Software: 30th International Symposium, SPIN 2024, Luxembourg City, Luxembourg, April 8–9, 2024, Proceedings (pp. 137–145). Springer. https://doi.org/10.1007/978-3-031-66149-5_7

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

Stepanenko, S. & Timany, A. (2025). Solving Guarded Domain Equations in Presheaves over Ordinals and Mechanizing It. In M. Fernandez (Ed.), 10th International Conference on Formal Structures for Computation and Deduction, FSCD 2025 Article 33 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.FSCD.2025.33

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

Sølvsten, S. & van de Pol, J. (2025). Symbolic Model Checking in External Memory. ArXiv. https://doi.org/10.48550/arXiv.2505.11229

Pichon-Pharabod, J. (2025). Synchronous Programming for Kids: A Manifesto. In S. Chiba, C. N. Klokmose & C. Gordon (Eds.), Onward! 2025 - Proceedings of the 2025 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software, Co-located with SPLASH 2025 (pp. 1-12). Association for Computing Machinery. https://doi.org/10.1145/3759429.3762617

Vindum, S. F., Georges, A. L. & Birkedal, L. (2025). The Nextgen Modality: A Modality for Non-Frame-Preserving Updates in Separation Logic. In K. Stark, A. Timany, S. Blazy & N. Tabareau (Eds.), Proceedings of the 14th ACM SIGPLAN International Conference on Certified Programs and Proofs, Co-located with: POPL 2025 (pp. 83-97). Association for Computing Machinery. https://doi.org/10.1145/3703595.3705876

Gratzer, D., Weinberger, J. & Buchholtz, U. (2025). The Yoneda embedding in simplicial type theory. In Proceedings - 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2025 (pp. 127-142). IEEE. https://doi.org/10.1109/LICS65433.2025.00017

Blazy, S., Tabareau, N., Stark, K. & Timany, A. (2025). Welcome from the Chairs. In CPP '25: Proceedings of the 14th ACM SIGPLAN International Conference on Certified Programs and Proofs (pp. iii-iv). Association for Computing Machinery. https://doi.org/10.1145/3703595

Conrado, G. K. & Pavlogiannis, A. (2024). A Better Approximation for Interleaved Dyck Reachability. In SOAP 2024 - Proceedings of the 13th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis (pp. 18-25). Association for Computing Machinery. https://doi.org/10.1145/3652588.3663318

Gregersen, S. O., Aguirre, A., Haselwarter, P. G., Tassarotti, J. & Birkedal, L. (2024). Almost-Sure Termination by Guarded Refinement. Proceedings of the ACM on Programming Languages , 8(ICFP), 203-233. Article 243. https://doi.org/10.1145/3674632

Timany, A., Krebbers, R., Dreyer, D. & Birkedal, L. (2024). A Logical Approach to Type Soundness. Journal of the ACM, 71(6), Article 40. https://doi.org/10.1145/3676954

Hammond, A., Liu, Z., Pérami, T., Sewell, P., Birkedal, L. & Pichon-Pharabod, J. (2024). An Axiomatic Basis for Computer Programming on the Relaxed Arm-A Architecture: The AxSL Logic. Proceedings of the ACM on Programming Languages , 8, 604-637. Article 21. https://doi.org/10.1145/3632863

Lutze, M. & Madsen, M. (2024). Associated Effects: Flexible Abstractions for Effectful Programming. Proceedings of the ACM on Programming Languages , 8, Article 163. https://doi.org/10.1145/3656393

Gregersen, S. O., Aguirre, A., Haselwarter, P. G., Tassarotti, J. & Birkedal, L. (2024). Asynchronous Probabilistic Couplings in Higher-Order Separation Logic. Proceedings of the ACM on Programming Languages , 8(POPL), Article 26. https://doi.org/10.1145/3632868

Schenck, R., Hinnerskov, N. H., Henriksen, T., Madsen, M. & Elsman, M. (2024). AUTOMAP: Inferring Rank-Polymorphic Function Applications with Integer Linear Programming. Proceedings of the ACM on Programming Languages , 8(OOPSLA2), 1787-1813. Article 334. https://doi.org/10.1145/3689774

Saioc, G.-V., Lange, J. & Møller, A. (2024). Automated Verification of Parametric Channel-Based Process Communication. In Proceedings of the ACM on Programming Languages (Vol. 8, pp. 2070-2096). Article 344 https://doi.org/10.1145/3689784

Georges, A. L., Guéneau, A., Van Strydonck, T., Timany, A., Trieu, A., Devriese, D. & Birkedal, L. (2024). Cerise: Program Verification on a Capability Machine in the Presence of Untrusted Code. Journal of the ACM, 71(1), Article 3. https://doi.org/10.1145/3623510

Tunç, H. C., Deshmukh, A. P., Çirisci, B., Enea, C. & Pavlogiannis, A. (2024). CSSTs: A Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis. In ASPLOS '24: Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems (Vol. 3, pp. 223-238). Association for Computing Machinery. https://doi.org/10.1145/3620666.3651358

Aguirre, A., Haselwarter, P. G., De Medeiros, M., Li, K. H., Gregersen, S. O., Tassarotti, J. & Birkedal, L. (2024). Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs. Proceedings of the ACM on Programming Languages , 8, Article 246. https://doi.org/10.1145/3674635

Displaying results 1 to 50 out of 533

Revised 05.12.2025

Marianne Dammand Iversen