Aarhus University Seal

Publications

Sort by: Date | Author | Title

Brabrand, C., Giegerich, R. & Møller, A. (2007). Analyzing Ambiguity of Context-Free Grammars. In Proc. 12th International Conference on Implementation and Application of Automata
Brabrand, C., Giegerich, R. & Møller, A. (2010). Analyzing Ambiguity of Context-Free Grammars. Science of Computer Programming, 75(3), 176-191. https://doi.org/10.1016/j.scico.2009.11.002
Brabrand, C., Møller, A., Sandholm, A. & Schwartzbach, M. I. (1999). A Runtime System for Interactive Web Services. In Proceedings of the 8th International World Wide Web Conference Elsevier.
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). https://doi.org/10.1007/11924661_5
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
Bloemen, V., Zelst, S. V., Aalst, W. V. D., Dongen, B. V. & Pol, J. V. D. (2022). Aligning observed and modelled behaviour by maximizing synchronous moves and using milestones. Information Systems, 103, Article 101456. https://doi.org/10.1016/j.is.2019.101456
Blazy, S., Tabareau, N., Stark, K. & Timany, A. (2025). Welcome from the Chairs. In CPP '25: Proceedings of the 14th ACM SIGPLAN International Conference on Certified Programs and Proofs (pp. iii-iv). Association for Computing Machinery. https://doi.org/10.1145/3703595
Blaabjerg, J. F. & Askarov, A. (2021). Towards Language-Based Mitigation of Traffic Analysis Attacks. Paper presented at 34th IEEE Computer Security Foundations Symposium, Online, United States. https://doi.org/10.1109/CSF51468.2021.00030
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.
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. https://doi.org/10.1007/978-3-319-08918-8_8
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. https://doi.org/10.1007/978-3-662-46678-0_18
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. https://doi.org/10.1007/978-3-662-49630-5_2
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. https://doi.org/10.1007/978-3-662-49630-5_2
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
Bizjak, A., Gratzer, D., Krebbers, R. & Birkedal, L. (2019). Iron: managing obligations in higher-order concurrent separation logic. Proceedings of the ACM on Programming Languages , 3(POPL), 1-30. Article 65. https://doi.org/10.1145/3290378
Birkedal, L., Bizjak, A. & Schwinghamme, J. (2013). Step-Indexed Relational Reasoning for Countable Nondeterminism. Logical Methods in Computer Science, 9(4), Article 4. https://doi.org/10.2168/LMCS-9(4:4)2013
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.
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., 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.
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. J. (2010). The category-theoretic solution of recursive metric-space equations. Theoretical Computer Science, 411(47), 4102-4122.
Birkedal, L., Møgelberg, R. E., Støvring, K. & schwinghammer, J. (2011). First steps in synthetic guarded domain theory: step-indexing in the topos of trees. Annual Symposium on Logic in Computer Science, 55-64. https://doi.org/10.1109/LICS.2011.16
Birkedal, L., Møgelberg, R. E., Schwinghammer, J. & Støvring, K. (2012). First steps in synthetic guarded domain theory: step-indexing in the topos of trees. Logical Methods in Computer Science, 8(4). https://doi.org/10.2168/LMCS-8(4:1)2012
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., 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. & 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. & Welinder, M. (1995). Binding-time analysis for Standard ML. Higher-Order and Symbolic Computation, 8(3), 191-208. https://doi.org/10.1007/BF01019003
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
Birkedal, L. & Tofte, M. (2001). A constraint-based region inference algorithm. Theoretical Computer Science, 258(1-2), 299-392. https://doi.org/10.1016/S0304-3975(00)00025-6
Birkedal, L., Sieczkowski, F. & Thamsborg, J. J. (2012). A Concurrent Logical Relation. In P. Cégielski & A. Durand (Eds.), Computer Science Logic 2012: 26th International Workshop. 21th Annual Conference of the EACSL. CSL’12, September 3–6, 2012, Fontainebleau, Franc Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CSL.2012.107
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. (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., 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
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
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
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. https://doi.org/10.1007/11817949_17
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., 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., 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