Publications

Sort by: Date | Author | Title

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

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+Business Media. https://doi.org/10.1007/978-3-032-05792-1_17

Böttger, H., Møller, A. & Schwartzbach, M. I. (2006). Contracts for Cooperation between Web Service Programmers and HTML Designers. Journal of Web Engineering, 5(1), 65-90.

Bauer, A. & Birkedal, L. (2000). Continuous Functionals of Dependent Types and Equilogical Spaces. In P. G. Clote & H. Schwichtenberg (Eds.), Computer Science Logic: 14th InternationalWorkshop, CSL 2000 Annual Conference of the EACSL Fischbachau, Germany, August 21 – 26, 2000 Proceedings (pp. 202-216). Springer. https://doi.org/10.1007/3-540-44622-2_13

Vindum, S. F. & Birkedal, L. (2021). Contextual refinement of the Michael-Scott queue (proof pearl). In C. Hriţcu & A. Popescu (Eds.), CPP 2021: Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs (pp. 76-90). Association for Computing Machinery. https://doi.org/10.1145/3437992.3439930

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

Niss, H. & Birkedal, L. (Eds.) (2004). Context-aware computing: proceedings of conference on Context-aware Computing, Copenhagen, November 30, 2004. IT University of Copenhagen.

Pavlogiannis, A., Tkadlec, J., Chatterjee, K. & Nowak, M. A. (2018). Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology, 1(1), Article 71. https://doi.org/10.1038/s42003-018-0078-7

Van Der Berg, F. I. & Van De Pol, J. (2019). Concurrent chaining hash maps for software model checking. In C. Barrett & J. Yang (Eds.), Proceedings of the 19th Conference on Formal Methods in Computer-Aided Design, FMCAD 2019 (pp. 46-54). Article 8894279 IEEE. https://doi.org/10.23919/FMCAD.2019.8894279

van de Pol, J. (2019). Concurrent algorithms and data structures for model checking. In W. Fokkink & R. van Glabbeek (Eds.), 30th International Conference on Concurrency Theory, CONCUR 2019 Article 4 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CONCUR.2019.4

Shaik, I. & van de Pol, J. (2023). Concise QBF Encodings for Games on a Grid (extended version). https://doi.org/10.48550/arXiv.2303.16949

Annenkov, D., Botsch Nielsen, J. & Spitters, B. (2020). ConCert: A smart contract certification framework in Coq. In Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’20), January 20-21, 2020, New Orleans, LA, USA (pp. 215-228). Association for Computing Machinery. https://doi.org/10.1145/3372885.3373829

Annenkov, D., Nielsen, J. B. & Spitters, B. (2020). ConCert: A Smart Contract Certification Framework in Coq. (pp. 215-228). arxiv.org. https://doi.org/10.1145/3372885.3373829

Krebbers, R. & Spitters, B. (2011). Computer certified efficient exact reals in Coq. In Intelligent Computer Mathematics - 18th Symposium, Calculemus 2011 and 10th International Conference, MKM 2011, Proceedings (pp. 90-106) https://doi.org/10.1007/978-3-642-22673-1_7

Haagh, H., Karbyshev, A., Oechsner, S., Spitters, B. & Strub, P. (2018). Computer-Aided Proofs for Multiparty Computation with Active Security. In Proceedings - IEEE 31st Computer Security Foundations Symposium, CSF 2018 (Vol. 2018, pp. 119-131). Article 8429300 IEEE. https://doi.org/10.1109/CSF.2018.00016

Haagh, H., Karbyshev, A., Oechsner, S., Spitters, B. & Strub, P.-Y. (2018, Jun 19). Computer-aided proofs for multiparty computation with active security. arxiv.org. https://arxiv.org/abs/1806.07197

Frumin, D., Krebbers, R. & Birkedal, L. (2021). Compositional non-interference for fine-grained concurrent programs. In 2021 IEEE Symposium on Security and Privacy (SP) (pp. 1416-1433). IEEE. https://doi.org/10.1109/SP40001.2021.00003

Karbyshev, A., Svendsen, K., Askarov, A. & Birkedal, L. (2018). Compositional Non-interference for Concurrent Programs via Separation and Framing. In L. Bauer & R. Küsters (Eds.), Principles of Security and Trust - 7th International Conference, POST 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Proceedings (Vol. 10804, pp. 53-78). Springer VS. https://doi.org/10.1007/978-3-319-89722-6_3

Elgaard, J., Møller, A. & Schwartzbach, M. I. (2000). Compile-Time Debugging of C Programs Working on Trees. In G. Smolka (Ed.), Programming Languages and Systems: 9th European Symposium on Programming, ESOP 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 – April 2, 2000 Proceedings (pp. 119-134). Springer. https://doi.org/10.1007/3-540-46425-5_8

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

Qian, Z., Kavvos, G. A. & Birkedal, L. (2020). Client-Server Sessions in Linear Logic. arxiv.org. https://arxiv.org/abs/2010.13926

Qian, Z., Kavvos, G. A. & Birkedal, L. (2021). Client-server sessions in linear logic. Proceedings of the ACM on Programming Languages , 5(ICFP), Article 62. https://doi.org/10.1145/3473567

Shaik, I. & Pol, J. V. D. (2021). Classical Planning as QBF without Grounding (extended version). (pp. 1-17). https://arxiv.org/abs/2106.10138

Shaik, I. & van de Pol, J. (2022). Classical Planning as QBF without Grounding. In A. Kumar, S. Thiebaux, P. Varakantham & W. Yeoh (Eds.), Proceedings of the 32nd International Conference on Automated Planning and Scheduling, ICAPS 2022 (pp. 329-337). AAAI Press. https://doi.org/10.1609/icaps.v32i1.19817

Feldthaus, A. & Møller, A. (2014). Checking Correctness of TypeScript Interfaces for JavaScript Libraries. In OOPSLA '14 Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications Association for Computing Machinery. https://doi.org/10.1145/2660193.2660215

Bengtson, J., Jensen, J. B. & Birkedal, L. (2012). Charge! A framework for higher-order separation logic in Coq. In L. Beringer & A. Felty (Eds.), Interactive Theorem Proving: Third International Conference, ITP 2012, Princeton, NJ, USA, August 13-15, 2012. Proceedings (Vol. 7406, pp. 315-331). Springer VS. https://doi.org/10.1007/978-3-642-32347-8_21

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

Wimmer, S., Herbreteau, F. & van de Pol, J. (2020). Certifying Emptiness of Timed Büchi Automata. In N. Bertrand & N. Jansen (Eds.), Formal Modeling and Analysis of Timed Systems : 18th International Conference, FORMATS 2020 (pp. 58-75). Springer. https://doi.org/10.1007/978-3-030-57628-8_4

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

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

Pavlogiannis, A., Chatterjee, K., Adlam, B. & Nowak, M. A. (2015). Cellular cooperation with shift updating and repulsion. Scientific Reports, 5, 17147. https://doi.org/10.1038/srep17147

Birkedal, L., Møgelberg, R. E. & Lerchedahl Petersen, R. (2008). Category-theoretic models of linear Abadi & Plotkin Logic. Theory and Applications of Categories, 20(7), 116-151.

Møgelberg, R. E. & Birkedal, L. (2005). Categorical Models of Abadi-Plotkin's logic for parametricity. Mathematical Structures in Computer Science, 15(4), 709-772.

Birkedal, L. & Møgelberg, R. E. (2005). Categorical models for Abadi and Plotkin's logic for parametricity. Mathematical Structures in Computer Science, 15(4), 709-772. https://doi.org/10.1017/S0960129505004834

Georges, A. L., Guéneau, A., Van Strydonck, T., Timany, A., Trieu, A., Devriese, D. & Birkedal, L. (2021). Cap’ ou pas cap’ ?: Preuve de programmes pour une machine à capacités en présence de code inconnu. In Journées Francophones des Langages Applicatifs 2021 Institut de Recherche en Informatique Fondamentale. https://researchportal.vub.be/en/publications/cap-ou-pas-cap-preuve-de-programmes-pour-une-machine-%C3%A0-capacit%C3%A9s-

Georges, A. L., Guéneau, A., Van Strydonck, T., Timany, A., Trieu, A., Devriese, D. & Birkedal, L. (2021). Cap’ ou pas cap’ ? Preuve de programmes pour une machine à capacités en présence de code inconnu. 157-173. Paper presented at 32emes Journees Francophones des Langages Applicatifs, JFLA 2021 - 32nd French-Speaking Conference on Applicative Languages, JFLA 2021, Virtual, Online.

Dinsdale-Young, T., da Rocha Pinto, P., Andersen, K. J. A. & Birkedal, L. (2017). Caper: Automatic Verification for Fine-Grained Concurrency. In H. Yang (Ed.), Programming Languages and Systems - 26th European Symposium on Programming, ESOP 2017 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Proceedings: 26th European Symposium on Programming, ESOP 2017 (Vol. 10201, pp. 420-447). Springer VS. https://doi.org/10.1007/978-3-662-54434-1_16

Starup, J. L., Madsen, M. & Lhoták, O. (2023). Breaking the Negative Cycle: Exploring the Design Space of Stratification for First-Class Datalog Constraints. In K. Ali & G. Salvaneschi (Eds.), 37th European Conference on Object-Oriented Programming, ECOOP 2023 Article 31 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ECOOP.2023.31

Birkedal, L. (2007). Book reviews of S. Awodey: Category Theory. Clarendon Press. Studia Logica: An International Journal for Symbolic Logic, 86(1). https://doi.org/10.1007/s11225-007-9053-x

Heunen, C., Landsman, N. P. & Spitters, B. (2012). Bohrification of operator algebras and quantum logic. Synthese, 186(3), 719-752. https://doi.org/10.1007/s11229-011-9918-4

Birkedal, L. & Welinder, M. (1995). Binding-time analysis for Standard ML. Higher-Order and Symbolic Computation, 8(3), 191-208. https://doi.org/10.1007/BF01019003

Birkedal, L. & Welinder, M. (1995). Binding-time analysis for Standard ML. In PEPM'94 - ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, Walt Disney World Vilage, Orlando, Florida, USA, 25 June 1994, Proceedings: Technical Report 94/9. (pp. 61-71). University of Melbourne. Department of Computer Science.

Biering, B., Birkedal, L. & Torp-Smith, N. (2007). BI-hyperdoctrines, higher-order separation logic, and abstraction. A C M Transactions on Programming Languages and Systems, 29(5), Article 1275499. https://doi.org/10.1145/1275497.1275499

Biering, B., Birkedal, L. & Torp-Smith, N. (2005). BI hyperdoctrines and higher-order separation logic. In M. Sagiv (Ed.), Programming Languages and Systems: 14th European Symposium on Programming, ESOP 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005. Proceedings (pp. 233-247). Springer. https://doi.org/10.1007/978-3-540-31987-0_17

Birkedal, L., Bundgaard, M., Debois, S., Elsborg, E., Glenstrup, A. J., Hildebrandt, T., Milner, R. & Niss, H. (2006). Bigraphical Programming Languages for Pervasive Computing. In T. Strang, V. Cahill & A. Quigley (Eds.), Proceedings of Pervasive 2006 International Workshop on Combining Theory and Systems Building in Pervasive Computing (CTSB'06 (pp. 653-658)

Birkedal, L. & Hildebrandt, T. (2004). Bigraphical Programming Languages: A LaCoMoCo research project .

Birkedal, L., Debois, S., Elsborg, E., Hildebrandt, T. & Niss, H. (2006). Bigraphical models of context-aware systems. In L. Aceto & A. Ingólfsdóttir (Eds.), Foundations of Software Science and Computation Structures: 9th International Conference, FOSSACS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25-31, 2006. Proceedings (Vol. 3921 , pp. 187-201). Springer VS. https://doi.org/10.1007/11690634_13

Damgaard, T. C. & Birkedal, L. (2006). Axiomatizing binding bigraphs. Nordic Journal of Computing, 33(1), 58 - 77 . http://dl.acm.org/citation.cfm?id=1161598&CFID=557689612&CFTOKEN=63942596

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

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

Displaying results 401 to 450 out of 533

Revised 05.12.2025

Marianne Dammand Iversen