Publications

Sort by: Date | Author | Title

Laursen, M. R., Xu, W. & Møller, A. (2024). Reducing Static Analysis Unsoundness with Approximate Interpretation. Proceedings of the ACM on Programming Languages , 8, 1165-1188. https://doi.org/10.1145/3656424

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

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

Mathiasen, A. A., Gondelman, L., Ducruet, L., Timany, A. & Birkedal, L. (2025). Reasoning about Weak Isolation Levels in Separation Logic. Proceedings of the ACM on Programming Languages , 9(ICFP), 306-340. https://doi.org/10.1145/3747515

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

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). Article 7467352 IEEE Press. https://doi.org/10.1109/EuroSP.2016.22

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

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 - 27th European Symposium on Programming, ESOP 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Proceedings (Vol. 10801, pp. 475-501). Springer VS. 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), Article 5. https://doi.org/10.1145/3363519

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

Kristensen, E. K. & Møller, A. (2019). Reasonably-Most-General Clients for JavaScript Library Analysis. Proceedings of the International Conference on Software Engineering, 83-93. https://doi.org/10.1109/ICSE.2019.00026

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

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

Ganardi, M., Majumdar, R., Pavlogiannis, A., Schütze, L. & Zetzsche, G. (2022). Reachability in Bidirected Pushdown VASS. In M. Bojanczyk, E. Merelli & D. P. Woodruff (Eds.), 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022 Article 124 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2022.124

Ma, W., Egger, M. K., Pavlogiannis, A., Li, Y. & Karras, P. (2024). Reachability-Aware Fair Influence Maximization. In W. Zhang, Z. Yang, X. Wang, A. Tung, Z. Zheng & H. Guo (Eds.), Web and Big Data - 8th International Joint Conference, APWeb-WAIM 2024, Proceedings: 8th International Joint Conference, APWeb-WAIM 2024, Jinhua, China, August 30 – September 1, 2024, Proceedings, Part III (pp. 342-359). BMJ, Springer Nature. https://doi.org/10.1007/978-981-97-7238-4_22

Sølvsten, S., Rysgaard, C. M. & van de Pol, J. (2025). Random Access on Narrow Decision Diagrams in External Memory. In T. Neele & A. Wijs (Eds.), Model Checking Software: 30th International Symposium, SPIN 2024, Luxembourg City, Luxembourg, April 8–9, 2024, Proceedings (pp. 137–145). Springer. https://doi.org/10.1007/978-3-031-66149-5_7

Midtgaard, J. & Møller, A. (2015). QuickChecking Static Analysis Properties. In 8th IEEE International Conference on Software Testing, Verification and Validation (ICST), 2015 (pp. 1-10). IEEE. https://doi.org/10.1109/ICST.2015.7102603

Midtgaard, J. & Møller, A. (2017). QuickChecking static analysis properties. Software Testing, Verification and Reliability, 27(6), Article e1640. https://doi.org/10.1002/stvr.1640

Chatterjee, K., Ibsen-Jensen, R. & Pavlogiannis, A. (2021). Quantitative Verification on Product Graphs of Small Treewidth. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021) (Vol. ´, pp. 42:1-42:23). Article 42 https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42

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

Strydonck, T. V., Georges, A. L., Guéneau, A., Trieu, A., Timany, A., Piessens, F., Birkedal, L. & Devriese, D. (2022). Proving full-system security properties under multiple attacker models on capability machines. In Proceedings - 2022 IEEE 35th Computer Security Foundations Symposium, CSF 2022 (pp. 80-95). IEEE. https://doi.org/10.1109/CSF54842.2022.9919645

Møller, A. (2002). Program Verification with Monadic Second-Order Logic & Languages for Web Service Development. Datalogisk Institut, Aarhus Universitet.

Madsen, M. & Pol, J. V. D. (2023). Programming with Purity Reflection: Peaceful Coexistence of Effects, Laziness, and Parallelism. In K. Ali & G. Salvaneschi (Eds.), 37th European Conference on Object-Oriented Programming (ECOOP 2023) Article 18 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ECOOP.2023.18

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. https://doi.org/10.1007/978-3-662-46678-0_26

Conrado, G. K., Kjelstrøm, A. H., Van De Pol, J. & Pavlogiannis, A. (2025). Program Analysis via Multiple Context Free Language Reachability. Proceedings of the ACM on Programming Languages , 9, Article 18. https://doi.org/10.1145/3704854

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/

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

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

Faissole, F. & Spitters, B. (2018). Preuves constructives de programmes probabilistes. In Journées Francophones des Langages Applicatifs

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

Sølvsten, S. & van de Pol, J. (2023). Predicting Memory Demands of BDD Operations using Maximum Graph Cuts. In É. André & J. Sun (Eds.), Automated technology for verification and analysis: Part II (pp. 72-92). Springer. https://doi.org/10.1007/978-3-031-45332-8_4

Li, Y., Tan, T., Møller, A. & Smaragdakis, Y. (2018). Precision-Guided Context Sensitivity for Pointer Analysis. Proceedings of the ACM on Programming Languages , 2(OOPSLA), 141:1-141:29. Article 141. https://doi.org/10.1145/3276511

Simner, B., Armstrong, A., Bauereiss, T., Campbell, B., Kammar, O., Pichon-Pharabod, J. & Sewell, P. (2025). Precise exceptions in relaxed architectures. In ISCA 2025 - Proceedings of the 52nd Annual International Symposium on Computer Architecture: Proceedings of the 52nd Annual International Symposium on Computer Architecture (pp. 211–224) https://doi.org/10.1145/3695053.3731102

Christensen, A. S., Møller, A. & Schwartzbach, M. I. (2003). Precise Analysis of String Expressions. In Static Analysis: 10th International Symposium, SAS 2003 San Diego, CA, USA, June 11-13, 2003 Proceedings (pp. 1-18). Springer. https://doi.org/10.1007/3-540-44898-5_1

Pavlogiannis, A., Schaumberger, N., Schmid, U. & Chatterjee, K. (2020). Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 39(11), 3981-3992. Article 9211419. https://doi.org/10.1109/TCAD.2020.3012803

Madsen, M., Livshits, B. & Fanning, M. (2013). Practical static analysis of JavaScript applications in the presence of frameworks and libraries. In B. Meyer, L. Baresi & M. Mezini (Eds.), Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering , ESEC/FSE 2013 (pp. 499-509). Association for Computing Machinery. https://doi.org/10.1145/2491411.2491417

Adamsen, C. Q., Møller, A. & Tip, F. (2017). Practical Initialization Race Detection for JavaScript Web Applications. Proceedings of the ACM on Programming Languages , 1(OOPSLA), 66:1-66:22. Article 66. https://doi.org/10.1145/3133890

Adamsen, C. Q., Møller, A., Alimadadi, S. & Tip, F. (2018). Practical AJAX Race Detection for JavaScript Web Applications. In G. T. Leavens, A. Garcia & C. S. Păsăreanu (Eds.), ESEC/FSE 2018 - Proceedings of the 2018 26th ACM Joint Meeting on European So ftware Engineering Conference and Symposium on the Foundations of So ftware Engineering (pp. 38-48). Association for Computing Machinery. https://doi.org/10.1145/3236024.3236038

Brabrand, C., Møller, A., Ricky, M. & Schwartzbach, M. I. (2000). PowerForms: Declarative Client-side Form Field Validation. World Wide Web (New York), 3(4), 205-214. https://doi.org/10.1023/A:1018772405468

Tkadlec, J., Pavlogiannis, A., Chatterjee, K. & Nowak, M. A. (2019). Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology, 2(1), Article 138. https://doi.org/10.1038/s42003-019-0373-y

Nanevski, A., Morrisett, G. & Birkedal, L. (2006). Polymorphism and separation in Hoare type theory. ACM SIGPLAN Notices, 41(9), 62-73. https://doi.org/10.1145/1160074.1159812

Madsen, M. & Pol, J. V. D. (2020). Polymorphic types and effects with Boolean unification. In Proceedings of the ACM on Programming Languages (OOPSLA ed., Vol. 4). Association for Computing Machinery. https://doi.org/10.1145/3428222

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.

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

Tan, J. & Madsen, M. (2025). Overloading the Dot. In D. Kluss, S. Achour & J. Palsberg (Eds.), CC 2025 - Proceedings of the 34th ACM SIGPLAN International Conference on Compiler Construction (pp. 60-69). Association for Computing Machinery. https://doi.org/10.1145/3708493.3712684

Shi, Z., Mathur, U. & Pavlogiannis, A. (2024). Optimistic Prediction of Synchronization-Reversal Data Races. In Proceedings - 2024 ACM/IEEE 44th International Conference on Software Engineering, ICSE 2024: Proceedings of the IEEE/ACM 46th International Conference on Software Engineering (pp. 1-13). Article 134 Association for Computing Machinery. https://doi.org/10.1145/3597503.3639099

Tunç, H. C., Abdulla, P. A., Chakraborty, S., Krishna, S., Mathur, U. & Pavlogiannis, A. (2023). Optimal Reads-From Consistency Checking for C11-Style Memory Models. Proceedings of the ACM on Programming Languages , 7(PLDI), 761–785. Article 137. https://doi.org/10.1145/3591251

Displaying results 151 to 200 out of 533

Revised 05.12.2025

Marianne Dammand Iversen