Find

For students
For PhDs
For employees

Department of Computer Science

Publications

Sort by: Date | Author | Title

Livshits, B., Sridharan, M., Smaragdakis, Y., Lhoták, O., Amaral, J. N., Chang, B.-Y. E., Guyer, S. Z., Khedker, U. P., Møller, A. & Vardoulakis, D. (2015). In Defense of Soundiness: A Manifesto. Communications of the A C M, 58(2). https://doi.org/10.1145/2644805

Andreasen, E., Feldthaus, A., Jensen, S. H., Jensen, C. S., Jonsson, P. A., Madsen, M. & Møller, A. (2012). Improving Tools for JavaScript Programmers (Position Paper). Paper presented at International Workshop on Scripts to Programs, Beijing, China. http://cs.au.dk/~amoeller/papers/stop/

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. https://doi.org/10.1007/978-3-642-54833-8_9

Shaik, I., Mayer-Eichberger, V., van de Pol, J. & Saffidine, A. (2023). Implicit State and Goals in QBF Encodings for Positional Games (extended version). https://doi.org/10.48550/arXiv.2301.07345

Shaik, I., Mayer-Eichberger, V., van de Pol, J. & Saffidine, A. (2024). Implicit QBF Encodings for Positional Games. In M. Hartisch, C.-H. Hsueh & J. Schaeffer (Eds.), Advances in Computer Games - 18th International Conference, ACG 2023, Revised Selected Papers (pp. 133-145). Springer. https://doi.org/10.1007/978-3-031-54968-7_12

Madsen, M. & Lhoták, O. (2018). Implicit Parameters for Logic Programming. In D. Sabel & P. Thiemann (Eds.), Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming Article 14 Association for Computing Machinery. https://doi.org/10.1145/3236950.3236953

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., 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+Business Media. https://doi.org/10.1007/978-3-031-90897-2_3

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

Møller, A. & Schwarz, M. R. (2011). HTML Validation of Context-Free Languages. Lecture Notes in Computer Science, 6604, 426-440. https://doi.org/10.1007/978-3-642-19805-2_29

Chakraborty, S., Krishna, S. N., Mathur, U. & Pavlogiannis, A. (2024). How Hard Is Weak-Memory Testing? Proceedings of the ACM on Programming Languages , 8, Article 66. https://doi.org/10.1145/3632908

Rijke, E. & Spitters, B. (2016). Homotopy type theory and the formalization of mathematics. Nieuw Archief voor Wiskunde , 5/17(3), 159 - 164. http://www.cs.au.dk/~spitters/naw5-2016-17-3-159.pdf

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

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

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

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

Svendsen, K., Birkedal, L. & Parkinson, M. (2013). Higher-order Concurrent Abstract Predicates.

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

Bhargavan, K., Buyse, M., Franceschino, L., Hansen, L. L., Kiefer, F., Schneider-Bensch, J. & Spitters, B. (2025). hax: Verifying Security-Critical Rust Software Using Multiple Provers. In J. Protzenko & A. Raad (Eds.), Verified Software. Theories, Tools and Experiments - 16th International Conference, VSTTE 2024, Revised Selected Papers (pp. 96-119). Springer. https://doi.org/10.1007/978-3-031-86695-1_7

Birkedal, L. & Welinder, M. (1994). Hand-writing program generator generators. In M. Hermenegildo & J. Penjam (Eds.), Programming Language Implementation and Logic Programming: 6th International Symposium, PLILP '94 Madrid, Spain, September 14–16, 1994 Proceedings (pp. 198-214). Springer VS. https://doi.org/10.1007/3-540-58402-1_15

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

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)

Birkedal, L., Bizjak, A., Clouston, R., Grathwohl, H. B., Spitters, B. & Vezzosi, A. (2016, Aug 1). Guarded Cubical Type Theory. https://doi.org/10.4230/LIPIcs.CSL.2016.23

Birkedal, L., Bizjak, A., Clouston, R., Grathwohl, H. B., Spitters, B. & Vezzosi, A. (2019). Guarded Cubical Type Theory. Journal of Automated Reasoning, 63(2), 211-253. https://doi.org/10.1007/s10817-018-9471-7, https://doi.org/10.1007/s10817-018-9471-7

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. http://www.cs.au.dk/~spitters/TYPES16.pdf

Chakraborty, S., Krishna, S., Pavlogiannis, A. & Tuppe, O. (2025). GPUMC: A Stateless Model Checker for GPU Weak Memory Concurrency. In R. Piskac & Z. Rakamaric (Eds.), Computer Aided Verification - 37th International Conference, CAV 2025, Proceedings (pp. 321-346). Springer. https://doi.org/10.1007/978-3-031-98682-6_17

Spitters, B., Vickers, S. & Wolters, S. (2014). Gelfand spectra in Grothendieck toposes using geometric mathematics. Electronic Proceedings in Theoretical Computer Science, EPTCS, 158, 77-107. https://doi.org/10.4204/EPTCS.158.7

Stiévenart, Q. & Madsen, M. (2020). Fuzzing channel-based concurrency runtimes using types and effects. In Proceedings of the ACM on Programming Languages (OOPSLA ed., Vol. 4). Association for Computing Machinery. https://doi.org/10.1145/3428254

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

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). Article 7958605 IEEE Computer Society Press. https://doi.org/10.1109/SP.2017.64

Birkedal, L., Tofte, M. & Vejlstrup, M. (1996). From region inference to von Neumann machines via region representation inference. In Proceedings of the 1996 ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages: St.Petersburg, FL, USA; ; 21 January 1996 through 24 January 1996 (pp. 171-183). Association for Computing Machinery. http://www.scopus.com/inward/record.url?scp=0029725194&partnerID=8YFLogxK

Birkedal, L. (2012). Foundations of Software Science and Computational Structures: 15th International Conference, FOSSACS 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Proceedings. Springer. Lecture Notes in Computer Science Vol. 7213 https://doi.org/10.1007/978-3-642-28729-9

Bhargavan, K., Hansen, L. L., Kiefer, F., Schneider-Bensch, J. & Spitters, B. (2025). Formal Security and Functional Verification of Cryptographic Protocol Implementations in Rust. In CCS 2025 - Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security (pp. 2729-2743). Association for Computing Machinery. https://doi.org/10.1145/3719027.3765213

Sidorenco, N., Oechsner, S. & Spitters, B. (2021). Formal security analysis of MPC-in-the-head zero-knowledge protocols. In Proceedings - 2021 IEEE 34th Computer Security Foundations Symposium, CSF 2021 (pp. 607-620). IEEE. https://doi.org/10.1109/CSF51468.2021.00050

Thomsen, S. E. & Spitters, B. (2020). Formalizing Nakamoto-Style Proof of Stake.

Thomsen, S. E. & Spitters, B. (2021). Formalizing Nakamoto-Style Proof of Stake. In Proceedings - 2021 IEEE 34th Computer Security Foundations Symposium, CSF 2021 IEEE. https://doi.org/10.1109/CSF51468.2021.00042

Mehnert, H., Sieczkowski, F., Birkedal, L. & Sestoft, P. (2012). Formalized verification of snapshotable trees: Separation and sharing. In R. Joshi, P. Müller & A. Podelski (Eds.), Verified Software: Theories, Tools, Experiments: 4th International Conference, VSTTE 2012, Philadelphia, PA, USA, January 28-29, 2012. Proceedings (pp. 179-195). Springer. https://doi.org/10.1007/978-3-642-27705-4_15

Nielsen, E. H., Annenkov, D. & Spitters, B. (2023). Formalising Decentralised Exchanges in Coq. In R. Krebbers, D. Traytel, B. Pientka & S. Zdancewic (Eds.), CPP '23: 12th ACM SIGPLAN International Conference on Certified Programs and Proofs (pp. 290-302). Association for Computing Machinery. https://doi.org/10.1145/3573105.3575685

Madsen, M., Starup, J. L. & Lhoták, O. (2022). Flix: A Meta Programming Language for Datalog. In Proceedings of the 4th International Workshop on the Resurgence of Datalog in Academia and Industry (Datalog-2.0 2022) (pp. 202-206). CEUR-WS.org. https://ceur-ws.org/Vol-3203/short8.pdf

Madsen, M. & Lhoták, O. (2025). Flix: A Design for Language-Integrated Datalog. Proceedings of the ACM on Programming Languages , 9(OOPSLA2), 2115-2143. https://doi.org/10.1145/3763126

Madsen, M. & Lhoták, O. (2020). Fixpoints for the masses: programming with first-class Datalog constraints. In Proceedings of the ACM on Programming Languages (OOPSLA ed., Vol. 4). Association for Computing Machinery. https://doi.org/10.1145/3428193

Brendborg, J., Karras, P., Pavlogiannis, A., Rasmussen, A. U. & Tkadlec, J. (2022). Fixation Maximization in the Positional Moran Process. Proceedings of the AAAI Conference on Artificial Intelligence, 36(9, AAAI Technical Track on Multiagent Systems), 9304-9312. https://doi.org/10.1609/aaai.v36i9.21160

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

Milo, M., Nielsen, E. H., Annenkov, D. & Spitters, B. (2022). Finding Smart Contract Vulnerabilities with ConCert's Property-Based Testing Framework. In Z. Dargaye & C. Schneidewind (Eds.), 4th International Workshop on Formal Methods for Blockchains (FMBC 2022) Dagstuhl Publishing. https://doi.org/10.4230/OASIcs.FMBC.2022.2

Milo, M., Nielsen, E. H., Annenkov, D. & Spitters, B. (2022). Finding smart contract vulnerabilities with ConCert's property-based testing framework. FMBC: Formal Methods for Blockchains https://doi.org/10.48550/arXiv.2208.00758

Alimadadi, S., Zhong, D., Madsen, M. & Tip, F. (2018). Finding Broken Promises in Asynchronous JavaScript Programs. Proceedings of the ACM on Programming Languages , 2(OOPSLA), 162:1-162:26. Article 162. https://doi.org/10.1145/3276532

Displaying results 301 to 350 out of 533

7

Revised 05.12.2025

-

Marianne Dammand Iversen