Publications

Sort by: Date | Author | Title

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.

Madsen, M., Tip, F., Andreasen, E. S., Sen, K. & Møller, A. (2016). Feedback-directed instrumentation for deployed JavaScript applications. In Proceedings - 2016 IEEE/ACM 38th IEEE International Conference on Software Engineering Companion, ICSE 2016: ICSE 2016 (pp. 899-910). Association for Computing Machinery. https://doi.org/10.1145/2884781.2884846

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

Pavlogiannis, A. (2020). Fast, Sound, and Effectively Complete Dynamic Race Prediction. Proceedings of the ACM on Programming Languages , 4(POPL), 1-29. Article 17. https://doi.org/10.1145/3371085

Aranha, D. F., Hvass, B. S., Spitters, B. & Tibouchi, M. (2023). Faster constant-time evaluation of the Kronecker symbol with application to elliptic curve hashing. In CCS'23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (pp. 3228-3238). Association for Computing Machinery. https://doi.org/10.1145/3576915.3616597

Chatterjee, K., Ibsen-Jensen, R. & Pavlogiannis, A. (2021). Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design, 57(3), 401-428. https://doi.org/10.1007/s10703-021-00373-5

Asadi, A., Chatterjee, K., Goharshady, A. K., Mohammadi, K. & Pavlogiannis, A. (2020). Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth. In D. Van Hung & O. Sokolsky (Eds.), Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Proceedings (pp. 253-270). Springer. https://doi.org/10.1007/978-3-030-59152-6_14

Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R. & Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraicqueries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems, 41(4), Article 23. https://doi.org/10.1145/3363525

Tkadlec, J., Pavlogiannis, A., Chatterjee, K. & Nowak, M. A. (2021). Fast and strong amplifiers of natural selection. Nature Communications, 12(1), Article 4009. https://doi.org/10.1038/s41467-021-24271-w

Madsen, M., Van De Pol, J. & Henriksen, T. (2023). Fast and Efficient Boolean Unification for Hindley-Milner-Style Type and Effect Systems. Proceedings of the ACM on Programming Languages , 7(OOPSLA2), 516–543. Article 240. https://doi.org/10.1145/3622816

Staicu, C. A., Torp, M. T., Schafer, M., Møller, A. & Pradel, M. (2020). Extracting Taint Specifications for JavaScript Libraries. In ICSE '20: Proceedings of the ACM/IEEE 42nd International Conference on Software Engineering (pp. 198-209). Article 3380390 Association for Computing Machinery. https://doi.org/10.1145/3377811.3380390

Annenkov, D., Milo, M., Nielsen, J. B. & Spitters, B. (2021). Extracting smart contracts tested and verified in Coq. In C. Hritcu & A. Popescu (Eds.), CPP 2021 - Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, co-located with POPL 2021 (pp. 105-121). Association for Computing Machinery. https://doi.org/10.1145/3437992.3439934

Annenkov, D., Milo, M., Nielsen, J. B. & Spitters, B. (2021). Extracting functional programs from Coq, in Coq. ArXiv. https://doi.org/10.48550/arXiv.2108.02995

Annenkov, D., Milo, M., Nielsen, J. B. & Spitters, B. A. S. (2022). Extracting functional programs from Coq, in Coq. Journal of Functional Programming, 32(5), Article e11. https://doi.org/10.1017/S0956796822000077

Christensen, A. S., Møller, A. & Schwartzbach, M. I. (2003). Extending Java for High-Level Web Service Construction. A C M Transactions on Programming Languages and Systems, 25(6), 814-875. https://doi.org/10.1145/945885.945890

van de Pol, J. (2022). Exploring a Parallel SCC Algorithm: Using TLA ⁺ and the TLC Model Checker. In T. Margaria & B. Steffen (Eds.), Leveraging Applications of Formal Methods, Verification and Validation. Verification Principles - 11th International Symposium, ISoLA 2022, Proceedings (pp. 535-555). Springer. https://doi.org/10.1007/978-3-031-19849-6_30

Endo, A. T. & Møller, A. (2025). Event Race Detection for Node.js Using Delay Injections. In J. Aldrich & A. Silva (Eds.), 39th European Conference on Object-Oriented Programming, ECOOP 2025 Article 9 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ECOOP.2025.9

Aguirre, A., Haselwarter, P. G., De Medeiros, M., Li, K. H., Gregersen, S. O., Tassarotti, J. & Birkedal, L. (2024). Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs. Proceedings of the ACM on Programming Languages , 8, Article 246. https://doi.org/10.1145/3674635

Bauer, A., Birkedal, L. & Scott, D. S. (2004). Equilogical spaces. Theoretical Computer Science, 315(1), 35-59. https://doi.org/10.1016/j.tcs.2003.11.012

Møller, A. & Veileborg, O. H. (2020). Eliminating abstraction overhead of Java stream pipelines using ahead-of-time program optimization. Proceedings of the ACM on Programming Languages , 4(OOPSLA), Article 168. https://doi.org/10.1145/3428236

Awodey, S. & Birkedal, L. (2003). Elementary axioms for local maps of toposes. Journal of Pure and Applied Algebra, 177(3), 215-230. https://doi.org/10.1016/S0022-4049(02)00283-9

Chatterjee, K., Goharshady, A. K., Okati, N. & Pavlogiannis, A. (2019). Efficient Parameterized Algorithms for Data Packing. Proceedings of the ACM on Programming Languages , 3(POPL), Article 53. https://doi.org/10.1145/3290366

Tunç, H. C., Dong, Y., Deshmukh, A. P., Cirisci, B., Enea, C. & Pavlogiannis, A. (2025). Efficient Dynamic Concurrency Analysis with Collective Sparse Segment Trees. ACM transactions on computer systems. Advance online publication. https://doi.org/10.1145/3773085

André, É., Marinho, D., Petrucci, L. & van de Pol, J. (2022). Efficient Convex Zone Merging in Parametric Timed Automata. In S. Bogomolov & D. Parker (Eds.), Formal Modeling and Analysis of Timed Systems. FORMATS 2022 (pp. 200-218). Springer. https://doi.org/10.1007/978-3-031-15839-1_12

Sølvsten, S., van de Pol, J., Jakobsen, A. B. & Thomasen, M. W. B. (2021). Efficient Binary Decision Diagram Manipulation in External Memory. ArXiv. https://doi.org/10.48550/arXiv.2104.12101

Ahmadi, A., Daliri, M., Goharshady, A. K. & Pavlogiannis, A. (2022). Efficient approximations for cache-conscious data placement. In R. Jhala & I. Dillig (Eds.), Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 857-871). Association for Computing Machinery. https://doi.org/10.1145/3519939.3523436

Georges, A. L., Guéneau, A., Van Strydonck, T., Timany, A., Trieu, A., Huyghebaert, S., Devriese, D. & Birkedal, L. (2021). Efficient and provable local capability revocation using uninitialized capabilities. Proceedings of the ACM on Programming Languages , 5(POPL), Article 6. https://doi.org/10.1145/3434287

Birkedal, L. (2020). Editorial message. Proceedings of the ACM on Programming Languages , 4(POPL).

Schivo, S., Khurana, S., Govindaraj, K., Scholma, J., Kerkhofs, J., Zhong, L., Huang, X., van de Pol, J., Langerak, R., van Wijnen, A. J., Geris, L., Karperien, M. & Post, J. N. (2020). ECHO, the executable CHOndrocyte: A computational model to study articular chondrocytes in health and disease. Cellular Signalling, 68, Article 109471. https://doi.org/10.1016/j.cellsig.2019.109471

Saioc, G.-V., Lee, I.-T. A., Møller, A. & Chabbi, M. (2025). Dynamic Partial Deadlock Detection and Recovery via Garbage Collection. In ASPLOS 2025 - Proceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems (pp. 244-259). Association for Computing Machinery. https://doi.org/10.1145/3676641.3715990

Kulkarni, R., Mathur, U. & Pavlogiannis, A. (2021). Dynamic Data-Race Detection Through the Fine-Grained Lens. In S. Haddad & D. Varacca (Eds.), 32nd International Conference on Concurrency Theory (CONCUR 2021) (pp. 16:1-16:23). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CONCUR.2021.16

Brabrand, C., Møller, A. & Schwartzbach, M. I. (2005). Dual Syntax for XML Languages. In Database Programming Languages: 10th International Workshop, DBPL 2005, Trondheim, Norway, August 28-29, 2005, Revised Selected Papers (pp. 27-41). Springer. https://doi.org/10.1007/11601524_2

Brabrand, C., Møller, A. & Schwartzbach, M. I. (2008). Dual Syntax for XML Languages. Information Systems, 33(4), 385-406. https://doi.org/10.1016/j.is.2008.01.006

Klarlund, N., Møller, A. & Schwartzbach, M. I. (2000). DSD: A Schema Language for XML. In Proceedings of the third workshop on Formal methods in software practice (pp. 101-111). Association for Computing Machinery. https://doi.org/10.1145/349360.351158

Møgelberg, R. E., Birkedal, L. & Petersen, R. L. (2007). Domain theoretic models of parametric polymorphism. Theoretical Computer Science, 388(1-3), 152-172. https://doi.org/10.1016/j.tcs.2007.06.016

Møller, A. (2002). Document Structure Description 2.0. BRICS Notes Series, (NS-02-7).

Klarlund, N., Møller, A. & Schwartzbach, M. I. (2000). Document Structure Description 1.0. BRICS Notes Series, (NS-00-7).

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

Birkedal, L. (2000). Developing theories of types and computability via realizability. Elsevier. Electronic Notes in Theoretical Computer Science Vol. 34 https://doi.org/10.1016/S1571-0661(05)80642-5

Andreasen, E. & Møller, A. (2014). Determinacy in Static Analysis of jQuery. In A. Black & T. Millstein (Eds.), Proceedings of the ACM International Conference on Object Oriented Programming Systems Languages & Applications, OOPSLA '14 (pp. 17-31 ). Association for Computing Machinery. https://doi.org/10.1145/2660193.2660214

Nielsen, B. B., Torp, M. T. & Møller, A. (2020). Detecting Locations in JavaScript Programs Affected by Breaking Library Changes. Proceedings of the ACM on Programming Languages , 4(OOPSLA), Article 187. https://doi.org/10.1145/3428255

Veileborg, O. H., Saioc, G.-V. & Møller, A. (2022). Detecting Blocking Errors in Go Programs using Localized Abstract Interpretation. In iWOAR 2022 - 7th International Workshop on Sensor-Based Activity Recognition and Artificial Intelligence, Proceedings (pp. 1-12). Article 32 Association for Computing Machinery. https://doi.org/10.1145/3551349.3561154

Krishnaswami, N. R., Aldrich, J., Birkedal, L., Svendsen, K. & Buisse, A. (2009). Design patterns in separation logic. In A. Kennedy & A. Ahmed (Eds.), Proceedings of the 2009 ACM SIGPLAN Workshop on Types in Language Design and Implementation, TLDI'09 (pp. 105-115). Association for Computing Machinery. https://doi.org/10.1145/1481861.1481874

Jakobsen, A. B., Clausen, A. B., van de Pol, J. & Shaik, I. (2025). Depth-Optimal Quantum Layout Synthesis as SAT. In J. Berg & J. Nordstrom (Eds.), 28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025 Article 16 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SAT.2025.16

Timany, A. & Sozeau, M. (2018). Cumulative inductive types in coq. In H. Kirchner (Ed.), 3rd International Conference on Formal Structures for Computation and Deduction, FSCD 2018 Article 29 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.FSCD.2018.29

Sterling, J., Angiuli, C. & Gratzer, D. (2019). Cubical syntax for reflection-free extensional equality. In H. Geuvers (Ed.), 4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019 Article 31 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.FSCD.2019.31

Spitters, B. (2015). Cubical sets as a classifying topos. Abstract from 21st International Conference on Types for Proofs and Programs, , Tallinn, Estonia.

Spitters, B. (2016, Oct 17). Cubical sets and the topological topos. https://arxiv.org/pdf/1610.05270v1.pdf

Tunç, H. C., Deshmukh, A. P., Çirisci, B., Enea, C. & Pavlogiannis, A. (2024). CSSTs: A Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis. In ASPLOS '24: Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems (Vol. 3, pp. 223-238). Association for Computing Machinery. https://doi.org/10.1145/3620666.3651358

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

Displaying results 351 to 400 out of 533

Revised 05.12.2025

Marianne Dammand Iversen