Publications

Sort by: Date | Author | Title

Birkedal, L., Tofte, M. & Vejlstrup, M. (1996). From region inference to von Neumann machines via region representation inference. In Proceedings of the 1996 ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages: St.Petersburg, FL, USA; ; 21 January 1996 through 24 January 1996 (pp. 171-183). Association for Computing Machinery. http://www.scopus.com/inward/record.url?scp=0029725194&partnerID=8YFLogxK

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.

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

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

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., 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

Birkedal, L. & Harper, R. (1997). Relational interpretations of recursive types in an operational setting: (Summary). In M. Abadi & T. Ito (Eds.), Theoretical Aspects of Computer Software: Third International Symposium, TACS'97 Sendai, Japan, September 23–26, 1997 Proceedings (pp. 458-490). Springer. https://doi.org/10.1007/BFb0014563

Birkedal, L. & Welinder, M. (1994). Hand-writing program generator generators. In M. Hermenegildo & J. Penjam (Eds.), Programming Language Implementation and Logic Programming: 6th International Symposium, PLILP '94 Madrid, Spain, September 14–16, 1994 Proceedings (pp. 198-214). Springer VS. https://doi.org/10.1007/3-540-58402-1_15

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

Birkedal, L., Escardo, M., Jung, A. & Rosolini, G. (Eds.) (2004). Recent Developments in Domain Theory: A collection of papers in honour of Dana S. Scott. Elsevier. Theoretical Computer Science Vol. 316 No. 1-3 http://www.sciencedirect.com/science/journal/03043975/316/1-3

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., Støvring, K. & Thamsborg, J. (2010). Realizability semantics of parametric polymorphism, general references, and recursive types. Mathematical Structures in Computer Science, 20(4), 655-703. https://doi.org/10.1017/S0960129510000162

Birkedal, L., Bundgaard, M., Debois, S., Grohmann, D. & Hildebrandt, T. (2009). Higher-order contexts via games and the Int-construction. (pp. 32). IT University of Copenhagen. I T University. Technical Report Series Vol. TR-2009-117

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

Birkedal, L., Petersen, R. L., Møgelberg, R. E. & Warming, C. (2006). LILY Operational Semantics and Models of Linear Abadi-Plotkin Logic. IT University of Copenhagen. I T University. Technical Report Series No. TR-2006-83

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

Birkedal, L., Møgelberg, R. E. & Lerc Petersen, R. (2006). Linear Abadi and Plotkin Logic. Logical Methods in Computer Science, 2(5), Article 2. https://doi.org/10.2168/LMCS-2(5:2)2006

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

Birkedal, L. (2000). A general notion of realizability. In 15th Annual IEEE Symposium on Logic in Computer Science, 2000. Proceedings. (pp. 7 - 17). IEEE Signal Processing Society. https://doi.org/10.1109/LICS.2000.855751

Birkedal, L., Bizjak, A., Clouston, R., Grathwohl, H. B., Spitters, B. & Vezzosi, A. (2016). Guarded Cubical Type Theory: Path Equality for Guarded Recursion. In J.-M. Talbot & L. Regnier (Eds.), CSL 2016: 25th EACSL Annual Conference on Computer Science Logic (pp. 1 - 17)

Birkedal, L., Bizjak, A., Clouston, R., Grathwohl, H. B., Spitters, B. & Vezzosi, A. (2016, Aug 1). Guarded Cubical Type Theory. https://doi.org/10.4230/LIPIcs.CSL.2016.23

Birkedal, L., Bizjak, A., Clouston, R., Grathwohl, H. B., Spitters, B. & Vezzosi, A. (2016). Guarded cubical type theory. Abstract from 22nd International Conference on Types for Proofs and Programs, Novi Sad, Serbia. http://www.cs.au.dk/~spitters/TYPES16.pdf

Birkedal, L., Jaber, G., Sieczkowski, F. & Thamsborg, J. (2016). A Kripke logical relation for effect-based program transformations. Information and Computation, 249, 160-189. https://doi.org/10.1016/j.ic.2016.04.003

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

Birkedal, L., Bizjak, A., Clouston, R., Grathwohl, H. B., Spitters, B. & Vezzosi, A. (2019). Guarded Cubical Type Theory. Journal of Automated Reasoning, 63(2), 211-253. https://doi.org/10.1007/s10817-018-9471-7, https://doi.org/10.1007/s10817-018-9471-7

Birkedal, L., Clouston, R., Mannaa, B., Ejlers Møgelberg, R., Pitts, A. M. & Spitters, B. (2020). Modal dependent type theory and dependent right adjoints. Mathematical Structures in Computer Science, 30(2), 118-138. https://doi.org/10.1017/S0960129519000197

Birkedal, L. (2020). Editorial message. Proceedings of the ACM on Programming Languages , 4(POPL).

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

Billes, M., Møller, A. & Pradel, M. (2017). Systematic black-box analysis of collaborative web applications. In PLDI 2017 - Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation (Vol. Part F128414, pp. 171-184). Association for Computing Machinery. https://doi.org/10.1145/3062341.3062364

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

Bidlingmaier, M. E., Faissole, F. & Spitters, B. (2019). Synthetic topology in Homotopy Type Theory for probabilistic programming. ArXiv.

Bidlingmaier, M. E., Faissole, F. & Spitters, B. (2021). Synthetic topology in Homotopy Type Theory for probabilistic programming. Mathematical Structures in Computer Science, 31(10), 1301-1329. https://doi.org/10.1017/S0960129521000165

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

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

Berger, C. P., Lutze, M. C. D., Elmqvist, N., Madsen, M. & Klokmose, C. N. (2024). Scientists and Code: Programming as a Tool. Paper presented at PLATEAU, Berkeley, California, United States. https://kilthub.cmu.edu/articles/conference_contribution/Scientists_and_Code_Programming_as_a_Tool/25587726?backTo=/collections/PLATEAU_2024/7093870

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

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

Bay, J. & Askarov, A. (2020). Reconciling progress-insensitive noninterference and declassification. In 2020 IEEE 33rd Computer Security Foundations Symposium (CSF) (pp. 95-106). IEEE. https://doi.org/10.1109/CSF49147.2020.00015

Bauer, A., Birkedal, L. & Scott, D. S. (2004). Equilogical spaces. Theoretical Computer Science, 315(1), 35-59. https://doi.org/10.1016/j.tcs.2003.11.012

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

Bauer, A., Gross, J., Lumsdaine, P. L., Shulman, M., Sozeau, M. & Spitters, B. (2016). The HoTT Library: A formalization of homotopy type theory in Coq. http://arxiv.org/abs/1610.04591

Bauer, A., Gross, J., Lumsdaine, P. L., Shulman, M., Sozeau, M. & Spitters, B. (2017). The HoTT Library: A Formalization of Homotopy Type Theory in Coq. In Y. Bertot & V. Vafeiadis (Eds.), CPP 2017 - Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, co-located with POPL 2017: CPP 2017 (pp. 164-172). Association for Computing Machinery. https://doi.org/10.1145/3018610.3018615

Awodey, S. & Birkedal, L. (2003). Elementary axioms for local maps of toposes. Journal of Pure and Applied Algebra, 177(3), 215-230. https://doi.org/10.1016/S0022-4049(02)00283-9

Awodey, S., Birkedal, L. & Scott, D. S. (1999). Local realizability toposes and a modal logic for computability - (Extended Abstract). Electronic Notes in Theoretical Computer Science, 23(1), 13-26. https://doi.org/10.1016/S1571-0661(04)00101-X

Awodey, S., Birkedal, L. & Scott, D. S. (2002). Local realizability toposes and a modal logic for computability. Mathematical Structures in Computer Science, 12(3), 319-334. https://doi.org/10.1017/S0960129502003675

Askarov, A., Moore, S., Dimoulas, C. & Chong, S. (2015). Cryptographic Enforcement of Language-Based Information Erasure. In L. Viganò (Ed.), 28th IEEE Computer Security Foundations Symposium CSF 2015 : Proceedings (pp. 334-348). IEEE Computer Society Press. https://doi.org/10.1109/CSF.2015.30

Askarov, A., Chong, S. & Mantel, H. A. (2015). Hybrid Monitors for Concurrent Noninterference. In L. Viganò (Ed.), 28th IEEE Computer Security Foundations Symposium CSF 2015 : Proceedings (pp. 137 - 151). IEEE Computer Society Press. https://doi.org/10.1109/CSF.2015.17

Asadi, A., Chatterjee, K., Goharshady, A. K., Mohammadi, K. & Pavlogiannis, A. (2020). Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth. In D. Van Hung & O. Sokolsky (Eds.), Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Proceedings (pp. 253-270). Springer. https://doi.org/10.1007/978-3-030-59152-6_14

Displaying results 451 to 500 out of 533

Revised 05.12.2025

Marianne Dammand Iversen