Publications

Sort by: Date | Author | Title

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 - 7th International Conference, POST 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Proceedings (Vol. 10804, pp. 53-78). Springer VS. https://doi.org/10.1007/978-3-319-89722-6_3

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. Article e20. https://doi.org/10.1017/S0956796818000151

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

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). Association for Computing Machinery. https://doi.org/10.1145/2951913.2951943

Jung, R., Lepigre, R., Parthasarathy, G., Rapoport, M., Timany, A., Dreyer, D. & Jacobs, B. (2020). The future is ours: prophecy variables in separation logic. Proceedings of the ACM on Programming Languages , 4(POPL), Article 45. https://doi.org/10.1145/3371113

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

Jensen, J. B. & Birkedal, L. (2012). Fictional Separation Logic. In H. Seidl (Ed.), Lecture Notes in Computer Science: 21st European Symposium on Programming, ESOP 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings (Vol. 7211, pp. 377-396). Springer.

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

Jakobsen, A. B., Jørgensen, R. S. M., van de Pol, J. & Pavlogiannis, A. (2024). Fast Symbolic Computation of Bottom SCCs. In B. Finkbeiner & L. Kovács (Eds.), Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2024 (pp. 110-128). Springer. https://doi.org/10.1007/978-3-031-57256-2_6

Jacobs, K., Timany, A. & Devriese, D. (2021). Fully abstract from static to gradual. Proceedings of the ACM on Programming Languages , 5(POPL), Article 7. https://doi.org/10.1145/3434288

Jacobs, K., Devriese, D. & Timany, A. (2022). Purity of an ST monad: Full abstraction by semantically typed back-translation. Proceedings of the ACM on Programming Languages , 6(OOPSLA1), Article 82. https://doi.org/10.1145/3527326

Hvass, B. S., Aranha, D. F. & Spitters, B. (2020). High-assurance field inversion for pairing-friendly primes. Abstract from The Coq Workshop 2020. https://coq-workshop.gitlab.io/2020/abstracts/Coq2020_04-02-primes.pdf

Hvass, B. S., Aranha, D. F. & Spitters, B. (2020). High-assurance field inversion for pairing-friendly primes. Abstract from 2nd Workshop on Formal Methods for Blockchains. https://fmbc.gitlab.io/2020/files/FMBC2020.pdf

Hvass, B. S., Aranha, D. F. & Spitters, B. (2023). High-assurance field inversion for curve-based cryptography. In 2023 IEEE 36th Computer Security Foundations Symposium (CSF) (pp. 552-567). IEEE. https://doi.org/10.1109/CSF57540.2023.00008

Huang, D., Morrisett, G. & Spitters, B. (2018, Jun 20). An Application of Computable Distributions to the Semantics of Probabilistic Programs. Cornell University.

Huang, D., Morrisett, G. & Spitters, B. (2020). Application of Computable Distributions to the Semantics of Probabilistic Programs. In G. Barthe, J.-P. Katoen & A. Silva (Eds.), Foundations of Probabilistic Programming (pp. 75-120). Cambridge University Press. https://doi.org/10.1017/9781108770750

Huang, D., Morrisett, G. & Spitters, B. (2020). Application ofComputable Distributions to the Semantics of Probabilistic Programs. In Foundations of Probabilistic Programming (pp. 75-120). Cambridge University Press. https://doi.org/10.1017/9781108770750.004

Heunen, C., Landsman, N. P. & Spitters, B. (2012). Bohrification of operator algebras and quantum logic. Synthese, 186(3), 719-752. https://doi.org/10.1007/s11229-011-9918-4

Haselwarter, P. G., Rivas, E., Van Muylder, A., Winterhalter, T., Abate, C., Sidorenco, N., Hriţcu, C., Maillard, K. & Spitters, B. (2023). SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq. ACM Transactions on Programming Languages and Systems, 45(3), 61. Article 15. https://doi.org/10.1145/3594735

Haselwarter, P. G. & Bauer, A. (2023). Finitary Type Theories With and Without Contexts. Journal of Automated Reasoning, 67(4), Article 36. https://doi.org/10.1007/s10817-023-09678-y

Haselwarter, P. G., Hvass, B. S., Hansen, L. L., Winterhalter, T., Hriţcu, C. & Spitters, B. (2024). The Last Yard: Foundational End-to-End Verification of High-Speed Cryptography. In A. Timany, D. Traytel, B. Pientka & S. Blazy (Eds.), CPP 2024: Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs (pp. 30-44). Association for Computing Machinery. https://doi.org/10.1145/3636501.3636961

Haselwarter, P. G., Li, K. H. E. I., Medeiros, M. D. E., Gregersen, S. O., Aguirre, A., Tassarotti, J. & Birkedal, L. (2024). Tachis: Higher-Order Separation Logic with Credits for Expected Costs. Proceedings of the ACM on Programming Languages , 8(OOPSLA2), 1189 - 1218. Article 313. https://doi.org/10.1145/3689753

Haselwarter, P. G., Li, K. H., Aguirre, A., Gregersen, S. O., Tassarotti, J. & Birkedal, L. (2025). Approximate Relational Reasoning for Higher-Order Probabilistic Programs. Proceedings of the ACM on Programming Languages , 9(POPL), 1196-1226. Article 41. https://doi.org/10.1145/3704877

Hansen, K. A. & Sølvsten, S. C. (2020). ∃R-completeness of stationary nash equilibria in perfect information stochastic games. In J. Esparza & D. Král (Eds.), 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020 (pp. 45:1-45:15). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2020.45

Hansen, S. T., Gomes, C., Larsen, P. G. & Van De Pol, J. (2021). Synthesizing Co-Simulation Algorithms with Step Negotiation and Algebraic Loop Handling. In C. R. Martin, M. J. Blas & A. I. Psijas (Eds.), 2021 Annual Modeling and Simulation Conference (ANNSIM) (pp. 62-73). IEEE. https://doi.org/10.23919/ANNSIM52504.2021.9552073

Hansen, S. T., Gomes, C., Palmieri, M., Thule, C., van de Pol, J. & Woodcock, J. (2021). Verification of Co-simulation Algorithms Subject to Algebraic Loops and Adaptive Steps. In A. L. Lafuente & A. Mavridou (Eds.), Formal Methods for Industrial Critical Systems (pp. 3-20). Springer. https://doi.org/10.1007/978-3-030-85248-1_1

Hansen, S. T., Thule, C., Gomes, C., van de Pol, J., Palmieri, M., Inci, E. O., Madsen, F., Alfonso, J., Castellanos, J. Á. & Rodriguez, J. M. (2022). Verification and synthesis of co-simulation algorithms subject to algebraic loops and adaptive steps. International Journal on Software Tools for Technology Transfer, 24(6), 999-1024. https://doi.org/10.1007/s10009-022-00686-8

Hammond, A., Liu, Z., Pérami, T., Sewell, P., Birkedal, L. & Pichon-Pharabod, J. (2024). An Axiomatic Basis for Computer Programming on the Relaxed Arm-A Architecture: The AxSL Logic. Proceedings of the ACM on Programming Languages , 8, 604-637. Article 21. https://doi.org/10.1145/3632863

Haagh, H., Karbyshev, A., Oechsner, S., Spitters, B. & Strub, P.-Y. (2018, Jun 19). Computer-aided proofs for multiparty computation with active security. arxiv.org. Computer Security Foundations https://arxiv.org/abs/1806.07197

Haagh, H., Karbyshev, A., Oechsner, S., Spitters, B. & Strub, P. (2018). Computer-Aided Proofs for Multiparty Computation with Active Security. In Proceedings - IEEE 31st Computer Security Foundations Symposium, CSF 2018 (Vol. 2018, pp. 119-131). Article 8429300 IEEE. https://doi.org/10.1109/CSF.2018.00016

Guéneau, A., Hostert, J., Spies, S., Sammler, M., Birkedal, L. & Dreyer, D. (2023). Melocoton: A Program Logic for Verified Interoperability Between OCaml and C. Proceedings of the ACM on Programming Languages , 7(OOPSLA2), 716-744. Article 247. https://doi.org/10.1145/3622823

Gregersen, S. O., Thomsen, S. E. & Askarov, A. (2019). A Dependently Typed Library for Static Information-Flow Control in IDRIS. In F. Nielson & D. Sands (Eds.), Principles of Security and Trust: 8th International Conference, POST 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Proceedings (pp. 51-75). Springer. https://doi.org/10.1007/978-3-030-17138-4_3

Gregersen, S. O., Bay, J., Timany, A. & Birkedal, L. (2021). Mechanized logical relations for termination-insensitive noninterference. Proceedings of the ACM on Programming Languages , 5(POPL), Article 10. https://doi.org/10.1145/3434291

Gregersen, S. O., Aguirre, A., Haselwarter, P. G., Tassarotti, J. & Birkedal, L. (2024). Asynchronous Probabilistic Couplings in Higher-Order Separation Logic. Proceedings of the ACM on Programming Languages , 8(POPL), Article 26. https://doi.org/10.1145/3632868

Gregersen, S. O., Aguirre, A., Haselwarter, P. G., Tassarotti, J. & Birkedal, L. (2024). Almost-Sure Termination by Guarded Refinement. Proceedings of the ACM on Programming Languages , 8(ICFP), 203-233. Article 243. https://doi.org/10.1145/3674632

Gratzer, D., Sterling, J. & Birkedal, L. (2019). Implementing a modal dependent type theory. Proceedings of the ACM on Programming Languages , 3(ICFP), 1-29. Article 107. https://doi.org/10.1145/3341711

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). Article 3394736 Association for Computing Machinery. https://doi.org/10.1145/3373718.3394736

Gratzer, D., Kavvos, G. A., Nuyts, A. & Birkedal, L. (2021). Multimodal Dependent Type Theory. Logical Methods in Computer Science, 17(3), Article 11. https://doi.org/10.46298/lmcs-17(3:11)2021

Gratzer, D. & Birkedal, L. (2022). A Stratified Approach to Löb Induction. In A. P. Felty (Ed.), 7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022 Article 23 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.FSCD.2022.23

Gratzer, D., Cavallo, E., Kavvos, G. A., Guatto, A. & Birkedal, L. (2022). Modalities and Parametric Adjoints. ACM Transactions on Computational Logic, 23(3), Article 18. https://doi.org/10.1145/3514241

Gratzer, D. (2025). A Modal Deconstruction of Löb Induction. Proceedings of the ACM on Programming Languages , 9, Article 30. https://doi.org/10.1145/3704866

Gratzer, D., Møller, M. A. & Birkedal, L. (2025). Idempotent Resources in Separation Logic: The Heart of core in Iris. In P. A. Abdulla & D. Kesner (Eds.), Foundations of Software Science and Computation Structures - 28th International Conference, FoSSaCS 2025, Held as Part of the International Joint Conferences on Theory and Practice of Software: ETAPS 2025, Proceedings (pp. 45-66). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-90897-2_3

Gratzer, D. (2023). Syntax and semantics of modal type theory. Aarhus University.

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

Gondelman, L., Gregersen, S. O., Nieto, A., Timany, A. & Birkedal, L. (2021). Distributed causal memory: Modular specification and verification in higher-order distributed separation logic. Proceedings of the ACM on Programming Languages , 5(POPL), Article 42. https://doi.org/10.1145/3434323

Gondelman, L., Hinrichsen, J. K., Pereira, M., Timany, A. & Birkedal, L. (2023). Verifying Reliable Network Components in a Distributed Separation Logic with Dependent Separation Protocols. Proceedings of the ACM on Programming Languages , 7(ICFP), 847-877. Article 217. https://doi.org/10.1145/3607859

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.

Gleirscher, M., Pol, J. V. D. & Woodcock, J. (Eds.) (2021). Proceedings First Workshop on Applicable Formal Methods. Electronic Proceedings in Theoretical Computer Science https://doi.org/10.4204/EPTCS.349

Gleirscher, M., Pol, J. V. D. & Woodcock, J. (2021). A Manifesto for Applicable Formal Methods. (pp. 1-17). CoRR https://arxiv.org/abs/2112.12758

Displaying results 151 to 200 out of 345

Revised 17.04.2023

Sofia Hedegaard Rasmussen