Publications

Sort by: Date | Author | Title

Birkedal, L., Støvring, K. & Thamsborg, J. (2010). Realisability semantics of parametric polymorphism, general references and recursive types. Mathematical Structures in Computer Science, 20(4), 655-703. https://doi.org/10.1017/S0960129510000162

Hansen, K. A. & Sølvsten, S. C. (2020). ∃R-completeness of stationary nash equilibria in perfect information stochastic games. In J. Esparza & D. Král (Eds.), 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020 (pp. 45:1-45:15). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2020.45

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

Jacobs, K., Devriese, D. & Timany, A. (2022). Purity of an ST monad: Full abstraction by semantically typed back-translation. Proceedings of the ACM on Programming Languages , 6(OOPSLA1), Article 82. https://doi.org/10.1145/3527326

Strydonck, T. V., Georges, A. L., Guéneau, A., Trieu, A., Timany, A., Piessens, F., Birkedal, L. & Devriese, D. (2022). Proving full-system security properties under multiple attacker models on capability machines. In Proceedings - 2022 IEEE 35th Computer Security Foundations Symposium, CSF 2022 (pp. 80-95). IEEE. https://doi.org/10.1109/CSF54842.2022.9919645

Madsen, M. & Pol, J. V. D. (2023). Programming with Purity Reflection: Peaceful Coexistence of Effects, Laziness, and Parallelism. In K. Ali & G. Salvaneschi (Eds.), 37th European Conference on Object-Oriented Programming (ECOOP 2023) Article 18 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ECOOP.2023.18

Clouston, R., Bizjak, A., Grathwohl, H. B. & Birkedal, L. (2015). Programming and reasoning with guarded recursion for coinductive types. In A. Pitts (Ed.), Foundations of Software Science and Computation Structures: 18th International Conference, FOSSACS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings (pp. 305-316). Springer VS. https://doi.org/10.1007/978-3-662-46678-0_26

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

Birkedal, L., Rosolini, G., Scott, D. S. & van Oosten, J. (Eds.) (2002). Proceedings of the Tutorial Workshop on Realizability Semantics and Applications: held June 30 and July 1, 1999 in Trento, Italy, as one of the satellite workshops associated to the Federated Logic Conference. Elsevier. Mathematical Structures in Computer Science Vol. 12 No. 3, special issue http://journals.cambridge.org/action/displayIssue?decade=2000&jid=MSC&volumeId=12&issueId=03&iid=114628

Birkedal, L., van Oosten, J., Rosolini, G. & Scott, D. S. (Eds.) (1999). Proceedings of the Tutorial Workshop on Realizability Semantics and Applications: held June 30 and July 1, 1999 in Trento, Italy, as one of the satellite workshops associated to the Federated Logic Conference. Elsevier. Electronic Notes in Theoretical Computer Science Vol. 23 No. 1 http://www.journals.elsevier.com/electronic-notes-in-theoretical-computer-science/

Birkedal, L. (Ed.) (2004). Proceedings of the 10th Conference on Category Theory in Computer Science (CTCS 2004). Elsevier. Electronic Notes in Theoretical Computer Science Vol. 122 https://doi.org/10.1016/j.entcs.2004.11.009

Gleirscher, M., Pol, J. V. D. & Woodcock, J. (Eds.) (2021). Proceedings First Workshop on Applicable Formal Methods. Electronic Proceedings in Theoretical Computer Science https://doi.org/10.4204/EPTCS.349

Faissole, F. & Spitters, B. (2018). Preuves constructives de programmes probabilistes. In Journées Francophones des Langages Applicatifs

Birkedal, L. (2016). Preface. Electronic Notes in Theoretical Computer Science, 325, 1-2. https://doi.org/10.1016/j.entcs.2016.09.028

Sølvsten, S. & van de Pol, J. (2023). Predicting Memory Demands of BDD Operations using Maximum Graph Cuts. In É. André & J. Sun (Eds.), Automated technology for verification and analysis: Part II (pp. 72-92). Springer. https://doi.org/10.1007/978-3-031-45332-8_4

Nanevski, A., Morrisett, G. & Birkedal, L. (2006). Polymorphism and separation in Hoare type theory. ACM SIGPLAN Notices, 41(9), 62-73. https://doi.org/10.1145/1160074.1159812

Madsen, M. & Pol, J. V. D. (2020). Polymorphic types and effects with Boolean unification. In Proceedings of the ACM on Programming Languages (OOPSLA ed., Vol. 4). Association for Computing Machinery. https://doi.org/10.1145/3428222

Svendsen, K., Birkedal, L. & Nanevski, A. (2011). Partiality, State, and Dependent Types. In Proceedings of Typed LAmbda Calculi and Applications - 10th International Conference, TLCA 2011, Novi Sad, Serbia, June 1-3, 2011 (Vol. LNCS 6690, pp. 198-212). Springer.

Birkedal, L., Møgelberg, R. E. & Petersen, R. L. (2006). Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus. Electronic Notes in Theoretical Computer Science, 155(1 SPEC. ISS.), 191-217. https://doi.org/10.1016/j.entcs.2005.11.057

Shaik, I. & van de Pol, J. (2023). Optimal Layout Synthesis for Quantum Circuits as Classical Planning. In 2023 IEEE/ACM International Conference on Computer Aided Design (ICCAD) IEEE. https://doi.org/10.1109/ICCAD57390.2023.10323924

Shaik, I. & Van de Pol, J. (2024). Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits. In S. Chakraborty & J.-H. R. Jiang (Eds.), 27th International Conference on Theory and Applications of Satisfiability Testing, SAT 2024 Article 26 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SAT.2024.26

Shaik, I. & Pol, J. V. D. (2024). Optimal Layout-Aware CNOT Circuit Synthesis with Qubit Permutation. In U. Endriss, F. S. Melo, K. Bach, A. Bugarin-Diz, J. M. Alonso-Moral, S. Barro & F. Heintz (Eds.), ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain - Including 13th Conference on Prestigious Applications of Intelligent Systems (PAIS 2024) (pp. 4207-4215). IOS Press. https://doi.org/10.3233/FAIA240993

Neele, T. & Pol, J. V. D. (2024). Operations on Fixpoint Equation Systems. Logical Methods in Computer Science, 20(3), 5:1-5:32. https://doi.org/10.46298/LMCS-20(3:5)2024

Dahlsen-Jensen, M. B., Fievet, B., Petrucci, L. & de Pol, J. V. (2024). On-The-Fly Algorithm for Reachability in Parametric Timed Games. In B. Finkbeiner & L. Kovács (Eds.), Tools and Algorithms for the Construction and Analysis of Systems - 30th International Conference, TACAS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Proceedings (pp. 194-212). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-57256-2_10

Birkedal, L., Debois, S. & Hildebrandt, T. (2008). On the Construction of Sorted Reactive Systems. Lecture Notes in Computer Science, 5201, 218-232. https://doi.org/10.1007/978-3-540-85361-9

Bizjak, A. & Birkedal, L. (2018). On Models of Higher-Order Separation Logic. Electronic Notes in Theoretical Computer Science, 336(4), 57-78. https://doi.org/10.1016/j.entcs.2018.03.016

van de Pol, J. & Petrucci, L. (2021). On Completeness of Liveness Synthesis for Parametric Timed Automata (Extended Abstract). In M. Roggenbach (Ed.), Recent Trends in Algebraic Development Techniques - 25th International Workshop, WADT 2020, Revised Selected Papers (pp. 3-10). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-73785-6_1

Blaabjerg, J. F. & Askarov, A. (2023). OblivIO: Securing reactive programs by oblivious execution with bounded traffic overheads. Paper presented at 36th IEEE Computer Security Foundations Symposium, Dubrovnik, Croatia.

Daniel, G. (2022). Normalization for Multimodal Type Theory. In Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022 Article 2 Association for Computing Machinery. https://doi.org/10.1145/3531130.3532398

Ahmadpanah, M. M., Askarov, A. & Sabelfeld, A. (2021). Nontransitive policies transpiled. In 2021 IEEE European Symposium on Security and Privacy (EuroS&P) (pp. 543-561). IEEE. https://doi.org/10.1109/EuroSP51992.2021.00043

Schwinghammer, J., Birkedal, L., Reus, B. & Yang, H. (2011). Nested Hoare Triples and Frame Rules for Higher-Order Store. Logical Methods in Computer Science, 7(3:21), 440-454. https://doi.org/10.2168/LMCS-7(3:21)2011

Schwinghammer, J., Birkedal, L., Reus, B. & Yang, H. (2009). Nested hoare triples and frame rules for higher-order store. In E. Grädel & R. Kahle (Eds.), Computer Science Logic: 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings (pp. 440-454). Springer. https://doi.org/10.1007/978-3-642-04027-6_32

Sølvsten, S. & van de Pol, J. (2024). Multi-variable Quantification of BDDs in External Memory using Nested Sweeping. ArXiv. https://doi.org/10.48550/arXiv.2408.14216

Gratzer, D., Kavvos, G. A., Nuyts, A. & Birkedal, L. (2020). Multimodal Dependent Type Theory. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2020 (pp. 492-506). Article 3394736 Association for Computing Machinery. https://doi.org/10.1145/3373718.3394736

Gratzer, D., Kavvos, G. A., Nuyts, A. & Birkedal, L. (2021). Multimodal Dependent Type Theory. Logical Methods in Computer Science, 17(3), Article 11. https://doi.org/10.46298/lmcs-17(3:11)2021

Dijk, T. V., Meijer, J. & van de Pol, J. (2019). Multi-core On-The-Fly Saturation. In Tools and Algorithms for the Construction and Analysis of Systems - 25th International Conference, TACAS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Proceedings (pp. 58-75). Springer. https://doi.org/10.1007/978-3-030-17465-1_4

Krebbers, R., Jourdan, J.-H., Jung, R., Tassarotti, J., Kaiser, J.-O., Timany, A., Charguéraud, A. & Dreyer, D. (2018). MoSeL: a general, extensible modal framework for interactive proofs in separation logic. PACMPL, 2(ICFP), 77:1-77:30. Article 3236772. https://doi.org/10.1145/3236772

Sieczkowski, F., Bizjak, A. & Birkedal, L. (2015). ModuRes: A Coq Library for Modular Reasoning About Concurrent Higher-Order Imperative Programming Languages. In C. Urban & X. Zhang (Eds.), Interactive Theorem Proving: 6th International Conference, ITP 2015, Nanjing, China, August 24-27, 2015, Proceedings (pp. 375-390). Springer. https://doi.org/10.1007/978-3-319-22102-1_25

Krishnaswam, N. R. K., Aldrich, J. & Birkedal, L. (2007). Modular Verification of the Subject-Observer Pattern via Higher-order Separation Logic. In Proceedings of 9th Workshop on Formal Techniques for Java-like Programs, FTfJP Fakultät für Informatik, Universität Magdeburg. http://www.cs.cmu.edu/~neelk/observer.pdf

Nieto, A., Daby-Seesaram, A., Gondelman, L., Timany, A. & Birkedal, L. (2023). Modular Verification of State-Based CRDTs in Separation Logic. In K. Ali & G. Salvaneschi (Eds.), 37th European Conference on Object-Oriented Programming, ECOOP 2023 Article 22 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ECOOP.2023.22

Nieto, A., Gondelman, L., Reynaud, A., Timany, A. & Birkedal, L. (2022). Modular verification of op-based CRDTs in separation logic. Proceedings of the ACM on Programming Languages , 6(OOPSLA2), 1788-1816. Article 188. https://doi.org/10.1145/3563351

Jensen, J. B., Birkedal, L. & Sestoft, P. (2011). Modular Verification of Linked Lists with Views via Separation Logic. Journal of Object Technology, 10(1), 21-40. https://doi.org/10.5381/jot.2011.10.1.a2

Jensen, J. B., Birkedal, L. & Sestoft, P. (2010). Modular verification of linked lists with views via separation logic. In Proceedings of the 12th Workshop on Formal Techniques for Java-Like Programs (pp. 4:1--4:7). Association for Computing Machinery. https://doi.org/10.1145/1924520.1924524

Jensen, J. B., Birkedal, L. & Sestoft, P. (2010). Modular verification of linked lists with views via separation logic. In FTFJP '10. Proceedings of the 12th Workshop on Formal Techniques for Java-Like Programs Article 4 Association for Computing Machinery. https://doi.org/10.1145/1924520.1924524

Svendsen, K., Birkedal, L. & Parkinson, M. (2013). Modular Reasoning about Separation of Concurrent Data Structures. In M. Felleisen & P. Gardner (Eds.), Programming Languages and Systems: 22nd European Symposium on Programming, ESOP 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings (pp. 169-188 ). Springer. https://doi.org/10.1007/978-3-642-37036-6_11

Birkedal, L. (2014). Modular reasoning about concurrent higher-order imperative programs. Abstract from ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, United States. https://doi.org/10.1145/2535838.2537849

Frumin, D., Timany, A. & Birkedal, L. (2024). Modular Denotational Semantics for Effects with Guarded Interaction Trees. Proceedings of the ACM on Programming Languages , 8(POPL), Article 12. https://doi.org/10.1145/3632854

Protzenko, J. & Spitters, B. (2024). Modernizing FIPS for safe languages and verified libraries. Paper presented at NIST Workshop on Formal Methods within Certification Programs (FMCP 2024), Rockville, Maryland, United States. https://www.nist.gov/system/files/documents/2024/06/11/08-ProtzenkoSpitters.pdf

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

Bloemen, V., Duret-Lutz, A. & van de Pol, J. (2019). Model checking with generalized Rabin and Fin-less automata. International Journal on Software Tools for Technology Transfer, 21(3), 307-324. https://doi.org/10.1007/s10009-019-00508-4

Displaying results 101 to 150 out of 345

Revised 17.04.2023

Sofia Hedegaard Rasmussen