Publications

Sort by: Date | Author | Title

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

Birkedal, L., Torp-Smith, N. & Reynolds, J. C. (2004). Local reasoning about a copying garbage collector. SIGPLAN Notices, 39(1), 220-231.

Birkedal, L. & Mogelberg, R. E. (2013). Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes. Annual Symposium on Logic in Computer Science, 213-222. https://doi.org/10.1109/LICS.2013.27

Thomsen, J. G., Clausen, C., Andersen, K. J., Danaher, J. & Ernst, E. (2013). Reducing Lookups for Invariant Checking. In G. Castagna (Ed.), ECOOP 2013 – Object-Oriented Programming : 27th European Conference, Montpellier, France, July 1-5, 2013. Proceedings (pp. 426-450). Springer VS. Lecture Notes in Computer Science, Vol.. 7920 https://doi.org/10.1007/978-3-642-39038-8_18

Birkedal, L., Bizjak, A. & Schwinghamme, J. (2013). Step-Indexed Relational Reasoning for Countable Nondeterminism. Logical Methods in Computer Science, 9(4), [4]. https://doi.org/10.2168/LMCS-9(4:4)2013

Turon, A., Dreyer , D. & Birkedal, L. (2013). Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency. In G. Morrisett & T. Uustalu (Eds.), Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming, ICFP '13 (pp. 377-390 ). Association for Computing Machinery. https://doi.org/10.1145/2500365.2500600

Bizjak, A., Birkedal, L. & Miculan, M. (2014). A model of countable nondeterminism in guarded type theory. In G. Dowek (Ed.), Rewriting and Typed Lambda Calculi: Joint International Conference, RTA-TLCA 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings (pp. 108-123). Springer VS. Lecture Notes in Computer Science, Vol.. 8560 https://doi.org/10.1007/978-3-319-08918-8_8

Svendsen, K. & Birkedal, L. (2014). Impredicative concurrent abstract predicates. In Z. Shao (Ed.), Programming Languages and Systems: 23rd European Symposium on Programming, ESOP 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings (pp. 149-168 ). Springer. Lecture Notes in Computer Science, Vol.. 8410 https://doi.org/10.1007/978-3-642-54833-8_9

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

Paviotti, M., Møgelberg, R. E. & Birkedal, L. (2015). A model of PCF in guarded type theory. Electronic Notes in Theoretical Computer Science, 319, 333–349. https://doi.org/10.1016/j.entcs.2015.12.020

Bizjak, A. & Møgelberg, R. E. (2015). A model of guarded recursion with clock synchronisation. Electronic Notes in Theoretical Computer Science, 319, 83-101. https://doi.org/10.1016/j.entcs.2015.12.007

Sieczkowski, F., Svendsen, K., Birkedal, L. & Pichon-Pharabod, J. (2015). A separation logic for fictional sequential consistency. In J. Vitek (Ed.), Programming Languages and Systems : 24th European Symposiumon Programming, ESOP 2015 held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015 (pp. 736-761). Springer. Lecture Notes in Computer Science, Vol.. 9032 https://doi.org/10.1007/978-3-662-46669-8_30

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

Bizjak, A., Grathwohl, H. B., Clouston, R., Birkedal, L. & Møgelberg, R. E. (2015). Guarded dependent type theory with coinductive types. In Foundations of Software Science and Computation Structures Springer. Lecture Notes in Computer Science https://doi.org/10.1007/978-3-662-49630-5_2

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

Jung, R., Swasey, D., Sieczkowski, F., Svendsen, K., Turon, A., Birkedal, L. & Dreyer, D. (2015). Iris: Monoids and invariants as an orthogonal basis for concurrent reasoning. In S. Rajamani (Ed.), Conference Record of the Annual ACM Symposium on Principles of Programming Languages (pp. 637-650). Association for Computing Machinery. https://doi.org/10.1145/2676726.2676980

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

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

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.

Bizjak, A. & Birkedal, L. (2015). Step-indexed logical relations for probability. 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. 279-294 ). Springer VS. Lecture Notes in Computer Science, Vol.. 9034 https://doi.org/10.1007/978-3-662-46678-0_18

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., 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). Leibniz International Proceedings in Informatics, Vol.. 62

Birkedal, L., Bizjak, A., Clouston, R., Grathwohl, H. B., Spitters, B. & Vezzosi, A. (2016). Guarded Cubical Type Theory.

Grathwohl, H. B. (2016). Guarded Recursive Type Theory. Department of Computer Science, Aarhus University.

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.

Bizjak, A., Grathwohl, H. B., Clouston, R., Møgelberg, R. E. & Birkedal, L. (2016). Guarded dependent type theory with coinductive types. In B. Jacobs & C. Löding (Eds.), Foundations of Software Science and Computation Structures: 19th International Conference, FOSSACS 2016 (Vol. 9634, pp. 20-35). Springer VS. Lecture Notes in Computer Science, Vol.. 9634 https://doi.org/10.1007/978-3-662-49630-5_2

Jung, R., Krebbers, R., Birkedal, L. & Dreyer, D. (2016). Higher-order ghost state. In E. Sumii (Ed.), ICFP 2016 Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming (pp. 256-269). New York, NY, USA: Association for Computing Machinery. https://doi.org/10.1145/2951913.2951943

Bizjak, A. (2016). On semantics and applications of guarded recursion.

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

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

Clouston, R., Bizjak, A., Grathwohl, H. B. & Birkedal, L. (2016). The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types. Logical Methods in Computer Science, 12(3), 1 - 39.

Svendsen, K., Sieczkowski, F. & Birkedal, L. (2016). Transfinite step-indexing: Decoupling concrete and logical steps. In P. Thiemann (Ed.), Programming Languages and Systems (Vol. 9632, pp. 727-751). Springer VS. Lecture Notes in Computer Science, Vol.. 9632 https://doi.org/10.1007/978-3-662-49498-1_28

Dodds, M., Jagannathan, S., Parkinson, M. J., Svendsen, K. & Birkedal, L. (2016). Verifying custom synchronisation constructs using higher-order separation logic. ACM Transactions on Programming Languages and Systems, 38/2, 4:1 - 4:72. [4]. https://doi.org/10.1145/2818638

Krogh-Jespersen, M., Svendsen, K. & Birkedal, L. (2017). A relational model of types-and-effects in higher-order concurrent separation logic. In Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages: POPL 2017 (pp. 218-231). New York, NY, USA : Association for Computing Machinery. https://doi.org/10.1145/3009837.3009877

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 (Vol. 10201, pp. 420-447). Berlin, Heidelberg: Springer VS. Lecture Notes in Computer Science, Vol.. 10201 https://doi.org/10.1007/978-3-662-54434-1_16

Pedersen, M. V. & Askarov, A. (2017). From Trash to Treasure: Timing-Sensitive Garbage Collection. In 2017 IEEE Symposium on Security and Privacy, SP 2017 - Proceedings (pp. 693-709). [7958605] IEEE Computer Society Press. https://doi.org/10.1109/SP.2017.64

Krebbers, R., Timany, A. & Birkedal, L. (2017). Interactive proofs in higher-order concurrent separation logic. In Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017 (pp. 205-217). Association for Computing Machinery.

Krebbers, R., Jung, R., Bizjak, A., Jourdan, J-H., Dreyer, D. & Birkedal, L. (2017). The Essence of Higher-Order Concurrent Separation Logic. 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, Uppsala, Sweden, April 22--29, 2017, Proceedings (pp. 696-723). Springer, Berlin, Heidelberg: Springer VS. Lecture Notes in Computer Science https://doi.org/10.1007/978-3-662-54434-1_26

Bahr, P., Grathwohl, H. B. & Møgelberg, R. E. (2017). The clocks are ticking: No more delays! In 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017 [8005097] IEEE. Annual Symposium on Logic in Computer Science, No. 32 https://doi.org/10.1109/LICS.2017.8005097

Timany, A., Stefanesco, L., Krogh-Jespersen, M. & Birkedal, L. (2018). A Logical Relation for Monadic Encapsulation of State: Proving contextual equivalences in the presence of runST. In Proceedings of the ACM on Programming Languages (POPL ed., Vol. 2, pp. 64:00-64:28). ACM New York, NY, USA: Association for Computing Machinery. Proceedings of the ACM on Programming Languages , No. 2 https://doi.org/10.1145/3158152

Bizjak, A. & Birkedal, L. (2018). A Model of Guarded Recursion via Generalised Equilogical Spaces. Theoretical Computer Science, 722, 1-18. https://doi.org/10.1016/j.tcs.2018.02.012

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 (Vol. 10804, pp. 53-78). Cham: Springer VS. Lecture Notes in Computer Science (LNCS), No. 10804 https://doi.org/10.1007/978-3-319-89722-6_3

Birkedal, L., Bizjak, A., Clouston, R., Grathwohl, H. B., Spitters, B. & Vezzosi, A. (2018). Guarded Cubical Type Theory. Journal of Automated Reasoning, (Special Issue on Homotopy Type Theory and Univalent Foundations), 1-43. https://doi.org/10.1007/s10817-018-9471-7

JUNG, RALF., KREBBERS, ROBBERT., JOURDAN, JACQUES-HENRI., BIZJAK, ALEŠ., BIRKEDAL, LARS. & DREYER, DEREK. (2018). Iris from the ground up: A modular foundation for higher-order concurrent separation logic. Journal of Functional Programming, 28, 1-73. [e20]. https://doi.org/10.1017/S0956796818000151

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

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). New York, NY, USA: Association for Computing Machinery. Annual Symposium on Logic in Computer Science, No. 33 https://doi.org/10.1145/3209108.3209174

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). Cham: Springer VS. Lecture Notes in Computer Science (LNCS), No. 10801 https://doi.org/10.1007/978-3-319-89884-1_17

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

Andersen, K. J. A. & Sergey, I. (2019). Distributed Protocol Combinators. In J. J. Alferes & M. Johansson (Eds.), Practical Aspects of Declarative Languages: 21th International Symposium, PADL 2019, Lisbon, Portugal, January 14-15, 2019, Proceedings (1 ed., Vol. 11372, pp. 169). Lisbon, Portugal: Springer VS. Programming and Software Engineering https://doi.org/10.1007/978-3-030-05998-9_11

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

Comments on content:

Sofia Rasmussen

Revised 13.09.2019