Publications

Sort by: Date | Author | Title

Birkedal, L., Reus, B., Schwinghammer, J., Støvring, K., Thamsborg, J. J. & Yang, H. (2011). Step-Indexed Kripke Models over Recursive Worlds. In Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, Texas, USA (pp. 119-132). Association for Computing Machinery.

Schwinghammer, J. & Birkedal, L. (2011). Step-indexed relational reasoning for countable nondeterminism. In M. Bezem (Ed.), Computer Science Logic (CSL'11) : 25th International Workshop/20th Annual Conference of the EACSL (pp. 512-524). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CSL.2011.512

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

Ahmed, A. (Ed.), Benton, N. (Ed.) & Birkedal, L. (2010). 10351 Abstracts Collection Modelling, Controlling and Reasoning About State: Dagstuhl Seminar . Dagstuhl Publishing. Dagstuhl Seminar Proceedings Vol. 10351 http://drops.dagstuhl.de/opus/volltexte/2010/2811/

Birkedal, L., Swinghammer, J. & Støvring, K. (2010). A Metric Model of Lambda Calculus with Guarded Recursion. In L. Santocanale (Ed.), Fixed Points in Computer Science 2010: Brno, August 21-22, 2010 http://www.diku.dk/~stovring/papers/metric-model-guarded-recursion.pdf

Glenstrup, A. J., Damgaard, T. C., Birkedal, L. & Højsgaard, E. (2010). An Implementation of Bigraph Matching. (TR 2010-135 ed.) IT-Universitetet i København.

Dreyer, D., Neis, G., Rossberg, A. & Birkedal, L. (2010). A relational modal logic for higher-order stateful ADTs. In M. Hermenegildo & J. Palsberg (Eds.), Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Madrid, Spain, January 17-23, 2010 (pp. 185-198). Association for Computing Machinery. https://doi.org/10.1145/1706299.1706323

Schwinghammer, J., Yang, H., Birkedal, L., Pottier, F. & Reus, B. (2010). A semantic foundation for hidden state. In L. Ong (Ed.), Foundations of Software Science and Computational Structures: 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings (pp. 2-17). Springer. https://doi.org/10.1007/978-3-642-12032-9_2

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

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

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., 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., Støvring, K. & Thamsborg, J. J. (2010). The category-theoretic solution of recursive metric-space equations. Theoretical Computer Science, 411(47), 4102-4122.

Dreyer, D., Neis, G. & Birkedal, L. (2010). The impact of higher-order state and control effects on local relational reasoning. In S. Weirich & P. Hudak (Eds.), Proceedings of the 15th ACM SIGPLAN international conference on Functional programming, ICFP 2010, Baltimore, Maryland, USA, September 27-29, 2010 (pp. 143-156). Association for Computing Machinery. https://doi.org/10.1145/1863543.1863566

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., 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. R., Aldrich, J., Birkedal, L., Svendsen, K. & Buisse, A. (2009). Design patterns in separation logic. In A. Kennedy & A. Ahmed (Eds.), Proceedings of the 2009 ACM SIGPLAN Workshop on Types in Language Design and Implementation, TLDI'09 (pp. 105-115). Association for Computing Machinery. https://doi.org/10.1145/1481861.1481874

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

Dreyer, D., Ahmed, A. & Birkedal, L. (2009). Logical Step-Indexed Logical Relations. In Proceedings of the Twenty-Fourth Annual IEEE Symposium on Logic in Computer Science, LICS 2009, Los Angeles, CA, USA IEEE Computer Society Press.

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

Birkedal, L., Støvring, K. & Thamsborg, J. (2009). Realizability semantics of parametric polymorphism, general references, and recursive types. In L. D. Alfaro (Ed.), Foundations of Software Science and Computational Structures: 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings (pp. 456-470). Springer. https://doi.org/10.1007/978-3-642-00596-1_32

Birkedal, L., Støvring, K. & Thamsborg, J. J. (2009). Relational Parametricity for References and Recursive Types. In A. Kennedy & A. Ahmed (Eds.), Proceedings of TLDI'09: 2009 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, Savannah, GA, USA, January 24, 2009. (pp. 91-104). Association for Computing Machinery.

Birkedal, L., Støvring, K. & Thamsborg, J. (2009). Solutions of generalized recursive metric-space equations. In R. Matthes & T. Uustalu (Eds.), 6th Workshop on Fixed Points in Computer Science, FICS 2009: Coimbr a, P ortugal, 12-13 September 2009, Proceedings (pp. 18-24). Institute of Cybernetics at Tallinn University of Technology.

Petersen, R. L., Birkedal, L., Nanevski, A. & Morrisett, G. (2008). A realizability model for impredicative Hoare Type Theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4960 LNCS, pp. 337-352) https://doi.org/10.1007/978-3-540-78739-6_26

Birkedal, L., Reus, B., Schwinghammer, J. & Yang, H. (2008). A Simple Model of Separation Logic for Higher-order Store. Lecture Notes in Computer Science, 348-360.

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.

Varming, C. & Birkedal, L. (2008). Higher-Order Separation Logic in Isabelle/HOLCF. Electronic Notes in Theoretical Computer Science, 218, 371-389. https://doi.org/10.1016/j.entcs.2008.10.022

Nanevski, A., Morrisett, J. G. & Birkedal, L. (2008). Hoare type theory, polymorphism and separation. Journal of Functional Programming, 18(5-6), 865-911.

Torp-Smith, N., Birkedal, L. & Reynolds, J. C. (2008). Local Reasoning about a Copying Garbage Collector. A C M Transactions on Programming Languages and Systems, 30(4), 24-81.

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

Birkedal, L. & Yang, H. (2008). Relational Parametricity and Separation Logic. Logical Methods in Computer Science, 4(2), 1-27. https://doi.org/10.2168/LMCS-4(2:6)2008

Møgelberg, R. E., Birkedal, L. & Rosolini, G. (2008). Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic. Annals of Pure and Applied Logic, 155(2), 115-133.

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

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.

Nanevski, A., Ahmed, A., Morrisett, G. & Birkedal, L. (2007). Abstract predicates and mutable ADTs in hoare type theory. In R. D. Nicola (Ed.), Programming Languages and Systems: 16th European Symposium on Programming, ESOP 2007, Held as Part of the Joint European Conferences on Theory and Practics of Software, ETAPS 2007, Braga, Portugal, March 24 - April 1, 2007. Proceedings (pp. 189-204). Springer VS. https://doi.org/10.1007/978-3-540-71316-6_14

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

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

Møgelberg, R. E., Birkedal, L. & Petersen, R. L. (2007). Domain theoretic models of parametric polymorphism. Theoretical Computer Science, 388(1-3), 152-172. https://doi.org/10.1016/j.tcs.2007.06.016

Birkedal, L., Damgaard, T. C., Glenstrup, A. J. & Milner, R. (2007). Matching of Bigraphs. Electronic Notes in Theoretical Computer Science, 175(4 SPEC. ISS.), 3-19. https://doi.org/10.1016/j.entcs.2007.04.013

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

Birkedal, L. & Yang, H. (2007). Relational parametricity and separation logic. In S. Helmut (Ed.), Foundations of Software Science and Computation Structures: 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007. Proceedings (pp. 93-107). Springer. https://doi.org/10.1007/978-3-540-71389-0_8

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

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

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

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

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

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

Displaying results 251 to 300 out of 336

Revised 17.04.2023

Sofia Hedegaard Rasmussen