Publications

Sort by: Date | Author | Title

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.

Møller, A. & Schwartzbach, M. I. (2007). XML Graphs in Program Analysis. In G. Ramalingam & E. Visser (Eds.), Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (pp. 1-10). Association for Computing Machinery. https://doi.org/10.1145/1244381.1244383

Møller, A. & Schwartzbach, M. I. (2011). XML Graphs in Program Analysis. Science of Computer Programming, 76(6), 492-515. https://doi.org/10.1016/j.scico.2009.11.007

Lutze, M., Madsen, M., Schuster, P. & Brachthäuser, J. I. (2023). With or Without You: Programming with Effect Exclusion. Proceedings of the ACM on Programming Languages , 7(ICFP), 448-475. https://doi.org/10.1145/3607846

Pientka, B., Blazy, S., Traytel, D. & Timany, A. (2024). Welcome from the Chairs. In CPP 2024 - Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs, Co-located with: POPL 2024 (pp. iii-iv)

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

Liu, Z., Stepanenko, S., Pichon-Pharabod, J., Timany, A., Askarov, A. & Birkedal, L. (2023). VMSL: A Separation Logic for Mechanised Robust Safety of Virtual Machines Communicating above FF-A. Proceedings of the ACM on Programming Languages , 7, 1438-1462. https://doi.org/10.1145/3591279

Dinsdale-Young, T., Birkedal, L., Gardner, P., Parkinson, M. & Yang, H. (2013). Views: Compositional reasoning for concurrent programs. In R. Giacobazzi & R. Cousot (Eds.), POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages : Proceedings (pp. 287-299). Association for Computing Machinery. https://doi.org/10.1145/2429069.2429104

Gondelman, L., Hinrichsen, J. K., Pereira, M., Timany, A. & Birkedal, L. (2023). Verifying Reliable Network Components in a Distributed Separation Logic with Dependent Separation Protocols. Proceedings of the ACM on Programming Languages , 7(ICFP), 847-877. Article 217. https://doi.org/10.1145/3607859

Bengtson, J., Jensen, J. B., Sieczkowski, F. & Birkedal, L. (2011). Verifying object-oriented programs with higher-order separation logic in Coq. In M. V. Eekelen , H. Geuvers, J. Schmaltz & F. Wiedijk (Eds.), Interactive Theorem Proving: Second International Conference, ITP 2011, Berg en Dal, The Netherlands, August 22-25, 2011. Proceedings (pp. 22-38). Springer. https://doi.org/10.1007/978-3-642-22863-6_5

Svendsen, K., Birkedal, L. & Parkinson, M. (2010). Verifying generics and delegates. In ECOOP 2010 – Object-Oriented Programming: 24th European Conference, Maribor, Slovenia, June 21-25, 2010. Proceedings (pp. 175-199). Springer. https://doi.org/10.1007/978-3-642-14107-2_9

Krishnaswami, N., Birkedal, L. & Aldrich, J. (2010). Verifying event-driven programs using ramified frame properties. In A. Kennedy & N. Benton (Eds.), {Proceedings of TLDI 2010: 2010 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, Madrid, Spain, January 23, 2010 (pp. 63-76). Association for Computing Machinery. https://doi.org/10.1145/1708016.1708025

Svendsen, K., Buisse, A. & Birkedal, L. (2008). Verifying design patterns in Hoare type theory. IT University of Copenhagen. I T University. Technical Report Series No. TR-2008-112

Dodds, M., Jagannathan, S., Parkinson, M. J., Svendsen, K. & Birkedal, L. (2016). Verifying custom synchronisation constructs using higher-order separation logic. ACM Transactions on Programming Languages and Systems, 38/2(2), 4:1 - 4:72. Article 4. https://doi.org/10.1145/2818638

Svendsen, K., Birkedal, L. & Parkinson, M. (2013). Verification of the Joins Library in Higher-Order Separation Logic. http://www.itu.dk/people/kasv/joins-tr.pdf

Hansen, S. T., Gomes, C., Palmieri, M., Thule, C., van de Pol, J. & Woodcock, J. (2021). Verification of Co-simulation Algorithms Subject to Algebraic Loops and Adaptive Steps. In A. L. Lafuente & A. Mavridou (Eds.), Formal Methods for Industrial Critical Systems (pp. 3-20). Springer. https://doi.org/10.1007/978-3-030-85248-1_1

Hansen, S. T., Thule, C., Gomes, C., van de Pol, J., Palmieri, M., Inci, E. O., Madsen, F., Alfonso, J., Castellanos, J. Á. & Rodriguez, J. M. (2022). Verification and synthesis of co-simulation algorithms subject to algebraic loops and adaptive steps. International Journal on Software Tools for Technology Transfer, 24(6), 999-1024. https://doi.org/10.1007/s10009-022-00686-8

Nielsen, B. B. & Møller, A. (2020). Value Partitioning: A Lightweight Approach to Relational Static Analysis for JavaScript. In 34th European Conference on Object-Oriented Programming, ECOOP 2020 Article 16 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ECOOP.2020.16

Chatterjee, K., Pavlogiannis, A. & Toman, V. (2019). Value-centric Dynamic Partial Order Reduction. Proceedings of the ACM on Programming Languages , 3(OOPSLA), Article 124. https://doi.org/10.1145/3360550

Shaik, I., Heisinger, M., Seidl, M. & Pol, J. V. D. (2023). Validation of QBF Encodings with Winning Strategies. Leibniz International Proceedings in Informatics, 271. https://doi.org/10.4230/LIPIcs.SAT.2023.24

Turon, A., Dreyer , D. & Birkedal, L. (2013). Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency. In G. Morrisett & T. Uustalu (Eds.), Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming, ICFP '13 (pp. 377-390 ). Association for Computing Machinery. https://doi.org/10.1145/2500365.2500600

Aagaard, F. L., Kristensen, M., Gratzer, D. & Birkedal, L. (2022). Unifying Cubical and Multimodal Type Theory. Abstract from 28th International Conference on Types for Proofs and Programs, Nantes, France. https://types22.inria.fr/files/2022/06/TYPES_2022_paper_35.pdf

Tofte, M. & Birkedal, L. (2000). Unification and polymorphism in region inference: essays in honour of Robin Milner. In G. Plotkin , C. Stirling & M. Tofte (Eds.), Proof, language, and interaction (pp. 389-423 ). MIT Press. http://dl.acm.org/citation.cfm?id=345868.345907&coll=DL&dl=GUIDE&CFID=560593603&CFTOKEN=90733199

Kavvos, G. A. & Gratzer, D. (2023). Under Lock and Key: A Proof System for a Multimodal Logic. Bulletin of Symbolic Logic, 29(2), 264-293. https://doi.org/10.1017/bsl.2023.14

Mezzetti, G., Møller, A. & Strocco, F. (2016). Type unsoundness in practice: An empirical study of dart. In R. Ierusalimschy (Ed.), DLS 2016 - Proceedings of the 12th Symposium on Dynamic Languages (pp. 13-24). Association for Computing Machinery. https://doi.org/10.1145/2989225.2989227

Birkedal, L., Carboni, A., Rosolini, G. & Scott, D. S. (1998). Type theory via exact categories. In K. Kelly (Ed.), Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science: 21-24 Jun 1998, Indianapolis, IN (pp. 188 - 198 ). IEEE. https://doi.org/10.1109/LICS.1998.705655

Kristensen, E. K. & Møller, A. (2017). Type Test Scripts for TypeScript Testing. Proceedings of the ACM on Programming Languages , 1(OOPSLA), 90:1-90:25. Article 90. https://doi.org/10.1145/3133914

Heinze, T. S., Møller, A. & Strocco, F. (2016). Type safety analysis for dart. In R. Ierusalimschy (Ed.), DLS 2016 - Proceedings of the 12th Symposium on Dynamic Languages (pp. 1-12). Association for Computing Machinery. https://doi.org/10.1145/2989225.2989226

Mezzetti, G., Møller, A. & Torp, M. T. (2018). Type Regression Testing to Detect Breaking Changes in Node.js Libraries. In T. D. Millstein (Ed.), 32nd European Conference on Object-Oriented Programming, ECOOP 2018 (Vol. 109, pp. 7:1-7:24). Article 7 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ECOOP.2018.7

Krebbers, R. & Spitters, B. (2013). Type classes for efficient exact real arithmetic in CoQ. Logical Methods in Computer Science, 9(1). https://doi.org/10.2168/LMCS-9(1:01)2013

Kirkegaard, C. & Møller, A. (2006). Type Checking with XML Schema in XACT. Paper presented at PLAN-X 2006: ACM SIGPLAN Workshop on Programming Language Technologies for XML, Charleston, SC, United States.

Jensen, S. H., Møller, A. & Thiemann, P. (2009). Type Analysis for JavaScript. Lecture Notes in Computer Science, 5673, 238–255. https://doi.org/10.1007/978-3-642-03237-0_17

Thamsborg, J. J., Birkedal, L. & Yang, H. (2012). Two for the Price of One: Lifting Separation Logic Assertions. Logical Methods in Computer Science, 8(3).

Timany, A., Gregersen, S. O., Stefanesco, L., Hinrichsen, J. K., Gondelman, L., Nieto, A. & Birkedal, L. (2024). Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement. Proceedings of the ACM on Programming Languages , 8, Article 9. https://doi.org/10.1145/3632851

Svendsen, K., Sieczkowski, F. & Birkedal, L. (2016). Transfinite step-indexing: Decoupling concrete and logical steps. In P. Thiemann (Ed.), Programming Languages and Systems (Vol. 9632, pp. 727-751). Springer VS. https://doi.org/10.1007/978-3-662-49498-1_28

Spies, S., Gäher, L., Gratzer, D., Tassarotti, J., Krebbers, R., Dreyer, D. & Birkedal, L. (2021). Transfinite Iris: Resolving an existential dilemma of step-indexed separation logic. In S. N. Freund & E. Yahav (Eds.), PLDI 2021 - Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 80-95). Association for Computing Machinery. https://doi.org/10.1145/3453483.3454031

Sterling, J., Gratzer, D. & Birkedal, L. (2024). Towards Univalent Reference Types: The Impact of Univalence on Denotational Semantics. In A. Murano & A. Silva (Eds.), 32nd EACSL Annual Conference on Computer Science Logic, CSL 2024 Article 47 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CSL.2024.47

Blaabjerg, J. F. & Askarov, A. (2021). Towards Language-Based Mitigation of Traffic Analysis Attacks. Paper presented at 34th IEEE Computer Security Foundations Symposium, Online, United States. https://doi.org/10.1109/CSF51468.2021.00030

Feldthaus, A., Millstein, T., Møller, A., Schäfer, M. & Tip, F. (2011). Tool-supported Refactoring for JavaScript. In Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications (pp. 119-138). Association for Computing Machinery. https://doi.org/10.1145/2048066.2048078

Hansen, J. C., Kjelstrøm, A. H. & Pavlogiannis, A. (2021). Tight bounds for reachability problems on one-counter and pushdown systems. Information Processing Letters, 171, Article 106135. https://doi.org/10.1016/j.ipl.2021.106135

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

Møller, A. & Schwartzbach, M. I. (2001). The XML Revolution. BRICS Notes Series, (NS-01-8).

Spitters, B. (2012). The Space of Measurement Outcomes as a Spectral Invariant for Non-Commutative Algebras. Foundations of Physics, 42(7), 896-908. https://doi.org/10.1007/s10701-011-9619-3

Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A. & Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages , 5(OOPSLA), Article 164. https://doi.org/10.1145/3485541

Madsen, M. (2022). The Principles of the Flix Programming Language. In Onward! 2022 - Proceedings of the 2022 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software, co-located with SPLASH 2022 (pp. 112-127). Association for Computing Machinery. https://doi.org/10.1145/3563835.3567661

Møller, A. & Schwartzbach, M. I. (2001). The Pointer Assertion Logic Engine. In M. L. Sofia (Ed.), Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (Vol. 36(5), pp. 221-231). Association for Computing Machinery. https://doi.org/10.1145/381694.378851

Makarov, E. & Spitters, B. (2013). The Picard algorithm for ordinary differential equations in Coq. In Interactive Theorem Proving - 4th International Conference, ITP 2013, Proceedings (pp. 463-468) https://doi.org/10.1007/978-3-642-39634-2_34

Birkedal, L., Dinsdale-Young, T., Guéneau, A., Jaber, G., Svendsen, K. & Tzevelekos, N. (2021). Theorems for free from separation logic specifications. Proceedings of the ACM on Programming Languages , 5(ICFP), Article 81. https://doi.org/10.1145/3473586

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

Brabrand, C., Møller, A. & Schwartzbach, M. I. (2002). The <bigwig> Project. A C M Transactions on Internet Technology, 2(2), 79-114. https://doi.org/10.1145/514183.514184

Displaying results 1 to 50 out of 533

Revised 05.12.2025

Marianne Dammand Iversen