Publications

Sort by: Date | Author | Title

Timany, A. & Birkedal, L. (2019). Mechanized relational verification of concurrent programs with continuations. Proceedings of the ACM on Programming Languages, 3(ICFP), 1-28. [105]. https://doi.org/10.1145/3341709

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

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. Lecture Notes in Computer Science Vol. 9236 https://doi.org/10.1007/978-3-319-22102-1_25

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. Lecture Notes in Computer Science Vol. 7792 https://doi.org/10.1007/978-3-642-37036-6_11

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

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

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 [4] Association for Computing Machinery. https://doi.org/10.1145/1924520.1924524

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). [3394736] Association for Computing Machinery. ACM International Conference Proceeding Series https://doi.org/10.1145/3373718.3394736

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. Lecture Notes in Computer Science Vol. 5771 https://doi.org/10.1007/978-3-642-04027-6_32

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

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

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.

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

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

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. Lecture Notes in Computer Science Vol. 9034 https://doi.org/10.1007/978-3-662-46678-0_26

Frumin, D., Krebbers, R. & Birkedal, L. (2018). ReLoC: A Mechanised Relational Logic for Fine-Grained Concurrency. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018 (pp. 442-451). Association for Computing Machinery. Annual Symposium on Logic in Computer Science No. 33 https://doi.org/10.1145/3209108.3209174

Frumin, D., Krebbers, R. & Birkedal, L. (2020). ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity. arXiv.org. https://arxiv.org/abs/2006.13635

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. (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. Lecture Notes in Computer Science Vol. 5504 https://doi.org/10.1007/978-3-642-00596-1_32

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

Skorstengaard, L., Devriese, D. & Birkedal, L. (2018). Reasoning About a Machine with Local Capabilities: Provably Safe Stack and Return Pointer Management. In A. Ahmed (Ed.), Programming Languages and Systems (Vol. 10801, pp. 475-501). Springer VS. Lecture Notes in Computer Science (LNCS) No. 10801 https://doi.org/10.1007/978-3-319-89884-1_17

Skorstengaard, L., Devriese, D. & Birkedal, L. (2019). Reasoning About a Machine with Local Capabilities: Provably Safe Stack and Return Pointer Management. A C M Transactions on Programming Languages and Systems, 41(4), [5]. https://doi.org/10.1145/3363519

Devriese, D., Piessens, F. & Birkedal, L. (2015). Reasoning about Object Capabilities with Logical Relations and Effect Parametricity: Technical Report including Proofs and Details. Association for Computing Machinery. http://cs.au.dk/~birke/papers/object-capabilities-tr.pdf

Skorstengaard, L., Devriese, D. & Birkedal, L. (2020). Reasoning about a Machine with Local Capabilities: Provably Safe Stack and Return Pointer Management. ACM Transactions on Programming Languages and Systems, 42(1), [5]. https://doi.org/10.1145/3363519

Timany, A. & Birkedal, L. (2021). Reasoning about monotonicity in separation logic. In Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’21) (pp. 91-104). Association for Computing Machinery. https://doi.org/10.1145/3437992.3439931

Devriese, D., Birkedal, L. & Piessens, F. (2016). Reasoning about object capabilities with logical relations and effect parametricity. In 2016 IEEE European Symposium on Security and Privacy, EURO S and P 2016 (pp. 147-162). [7467352] IEEE Press. https://doi.org/10.1109/EuroSP.2016.22

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

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

Birkedal, L. & Harper, R. (1999). Relational Interpretations of Recursive Types in an Operational Setting. Information and Computation, 155(1-2), 3-63. http://www.scopus.com/inward/record.url?scp=0000650306&partnerID=8YFLogxK

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

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.

Aguirre, A., Barthe, G., Birkedal, L., Bizjak, A., Gaboardi, M. & Garg, D. (2018). Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda Calculus. In A. Ahmed (Ed.), 27th European Symposium on Programming, ESOP 2018 (pp. 214-241). Springer VS. Lecture Notes in Computer Science (LNCS) No. 10801 https://doi.org/10.1007/978-3-319-89884-1_8

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. Lecture Notes in Engineering and Computer Science Vol. 1281 https://doi.org/10.1007/BFb0014563

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. Lecture Notes in Computer Science Vol. 4423 https://doi.org/10.1007/978-3-540-71389-0_8

Bohr, N. & Birkedal, L. (2006). Relational reasoning for recursive types and references. In N. Kobayashi (Ed.), Programming Languages and Systems (Vol. 4279 LNCS, pp. 79-96). Lecture Notes in Computer Science Vol. 4279 https://doi.org/10.1007/11924661_5

Birkedal, L. & van Oosten, J. (2002). Relative and modified relative realizability. Annals of Pure and Applied Logic, 118(1-2), 115-132. https://doi.org/10.1016/S0168-0072(01)00122-1

Giarrusso, P. G., Stefanesco, L., Timany, A., Birkedal, L. & Krebbers, R. (2020). Scala step-by-step: Soundness for DOT with step-indexed logical relations in Iris. Proceedings of the ACM on Programming Languages, 4(ICFP), [114]. https://doi.org/10.1145/3408996

Birkedal, L., Torp-Smith, N. & Yang, H. (2005). Semantics of Separation-logic Typing and Higher-order Frame Rules. In 20th Annual IEEE Symposium on Logic in Computer Science, 2005. LICS 2005. Proceedings (pp. 260-269). IEEE. https://doi.org/10.1109/LICS.2005.47

Birkedal, L., Torp-Smith, N. & Yang, H. (2006). Semantics of Separation-logic Typing and Higher-order Frame Rules for Algol-like Languages. Logical Methods in Computer Science, 2(5:1), 1-33. https://doi.org/10.2168/LMCS-2(5:1)2006

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.

Birkedal, L., Debois, S. & Hildebrandt, T. (2006). Sortings for reactive systems. In C. Baier & H. Hermanns (Eds.), CONCUR 2006 – Concurrency Theory: 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006. Proceedings (pp. 248-262). Springer. Lecture Notes in Engineering and Computer Science Vol. 4137 https://doi.org/10.1007/11817949_17

Pedersen, M. & Askarov, A. (2019). Static Enforcement of Security in Runtime Systems. In Proceedings - 2019 IEEE 32nd Computer Security Foundations Symposium, CSF 2019 (pp. 335-350). [8823712] IEEE. https://doi.org/10.1109/CSF.2019.00030

Displaying results 101 to 150 out of 180

Page 1

Page 2

Page 3

Page 4

Revised 16.11.2021 -

Sofia Rasmussen