Publications

Sort by: Date | Author | Title

Dreyer, D., Ahmed, A. & Birkedal, L. (2009). Logical Step-Indexed Logical Relations. In Proceedings of the Twenty-Fourth Annual IEEE Symposium on Logic in Computer Science, LICS 2009, Los Angeles, CA, USA IEEE Computer Society Press.

Dreyer, D., Ahmed, A. & Birkedal, L. (2011). Logical Step-Indexed Logical Relations. Logical Methods in Computer Science, 7(2:16). https://doi.org/10.2168/LMCS-7(2:16)2011

Dongmei, Z. & Møller, A. (Eds.) (2019). ISSTA 2019: Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and Analysis. Association for Computing Machinery. https://dl.acm.org/citation.cfm?id=3293882&picked=prox

Dodds, M., Jagannathan, S., Parkinson, M. J., Svendsen, K. & Birkedal, L. (2016). Verifying custom synchronisation constructs using higher-order separation logic. ACM Transactions on Programming Languages and Systems, 38/2(2), 4:1 - 4:72. Article 4. https://doi.org/10.1145/2818638

Dinsdale-Young, T., Birkedal, L., Gardner, P., Parkinson, M. & Yang, H. (2013). Views: Compositional reasoning for concurrent programs. In R. Giacobazzi & R. Cousot (Eds.), POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages : Proceedings (pp. 287-299). Association for Computing Machinery. https://doi.org/10.1145/2429069.2429104

Dinsdale-Young, T., da Rocha Pinto, P., Andersen, K. J. A. & Birkedal, L. (2017). Caper: Automatic Verification for Fine-Grained Concurrency. In H. Yang (Ed.), Programming Languages and Systems - 26th European Symposium on Programming, ESOP 2017 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Proceedings: 26th European Symposium on Programming, ESOP 2017 (Vol. 10201, pp. 420-447). Springer VS. https://doi.org/10.1007/978-3-662-54434-1_16

Dijk, T. V., Meijer, J. & van de Pol, J. (2019). Multi-core On-The-Fly Saturation. In Tools and Algorithms for the Construction and Analysis of Systems - 25th International Conference, TACAS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Proceedings (pp. 58-75). Springer. https://doi.org/10.1007/978-3-030-17465-1_4

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

Daniel, G. (2022). Normalization for Multimodal Type Theory. In Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022 Article 2 Association for Computing Machinery. https://doi.org/10.1145/3531130.3532398

Damgaard, T. C. & Birkedal, L. (2006). Axiomatizing binding bigraphs. Nordic Journal of Computing, 33(1), 58 - 77 . http://dl.acm.org/citation.cfm?id=1161598&CFID=557689612&CFTOKEN=63942596

Damgaard, T. C., Glenstrup, A. J., Birkedal, L. & Milner, R. (2013). An inductive characterization of matching in binding bigraphs. Formal Aspects of Computing, 25(2), 257-288. https://doi.org/10.1007/s00165-011-0184-5

Dahlsen-Jensen, M. B., Fievet, B., Petrucci, L. & de Pol, J. V. (2024). On-The-Fly Algorithm for Reachability in Parametric Timed Games. In B. Finkbeiner & L. Kovács (Eds.), Tools and Algorithms for the Construction and Analysis of Systems - 30th International Conference, TACAS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Proceedings (pp. 194-212). Springer Science+Business Media. https://doi.org/10.1007/978-3-031-57256-2_10

Dahlsen-Jensen, M. B., Fievet, B., Petrucci, L. & van de Pol, J. (2025). Controller Synthesis for Parametric Timed Games. In P. Prabhakar & A. Vandin (Eds.), Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems - Second International Joint Conference, QEST+FORMATS 2025, Proceedings (pp. 314-332). Springer Science+Business Media. https://doi.org/10.1007/978-3-032-05792-1_17

Conrado, G. K. & Pavlogiannis, A. (2024). A Better Approximation for Interleaved Dyck Reachability. In SOAP 2024 - Proceedings of the 13th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis (pp. 18-25). Association for Computing Machinery. https://doi.org/10.1145/3652588.3663318

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

Conrado, G. K. & Pavlogiannis, A. (2025). CFL-based methods for approximating interleaved Dyck reachability. International Journal on Software Tools for Technology Transfer, 27(2), 255-266. Article 106135. https://doi.org/10.1007/s10009-025-00787-0

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

Clouston, R., Bizjak, A., Grathwohl, H. B. & Birkedal, L. (2016). The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types. Logical Methods in Computer Science, 12(3), 1 - 39. https://doi.org/10.2168/LMCS-12(3:7)2016

Christensen, A. S. & Møller, A. (2002). JWIG User Manual. BRICS Notes Series, (NS-02-6).

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

Christensen, A. S., Møller, A. & Schwartzbach, M. I. (2002). Static Analysis for Dynamic XML. In E-Proceeding of PLAN-X 2002 http://homepages.inf.ed.ac.uk/wadler/planx/planx-eproceed/papers/E00-1868950904.pdf

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

Christensen, A. S., Kirkegaard, C. & Møller, A. (2004). A Runtime System for XML Transformations in Java. In Z. Bellahsene, T. Milo, M. Rys, D. Suciu & R. Unland (Eds.), Database and XML Technologies: Second International XML Database Symposium, XSym 2004, Toronto, Canada, August 29-30, 2004. Proceedings (pp. 143-157). Springer. https://doi.org/10.1007/978-3-540-30081-6_11

Christensen, J. E., Jørgensen, S. F., Pavlogiannis, A. & van de Pol, J. (2025). On Exact Sizes of Minimal CNOT Circuits. In R. Glück & R. Kaarsgaard (Eds.), Reversible Computation: 17th International Conference, RC 2025, Proceedings (pp. 71-88). Springer. https://doi.org/10.1007/978-3-031-97063-4_6

Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A. & Spirakis, P. G. (2011). All Symmetric Predicates in NSPACE(n 2) Are Stably Computable by the Mediated Population Protocol Model. Lecture Notes in Computer Science, 6281, 270. https://doi.org/10.1007/978-3-642-15155-2_25

Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K. & Pavlogiannis, A. (2018). Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. ACM Transactions on Programming Languages and Systems, 40(3), Article 9. https://doi.org/10.1145/3210257

Chatterjee, K., Pavlogiannis, A., Koessler, A. & Schmid, U. (2018). Automated competitive analysis of real-time scheduling with graph games. Real-Time systems, 54(1), 166-207. https://doi.org/10.1007/s11241-017-9293-4

Chatterjee, K., Choudhary, B. & Pavlogiannis, A. (2018). Optimal Dyck Reachability for Data-Dependence and Alias Analysis. Proceedings of the ACM on Programming Languages , 2(POPL), Article 30. https://doi.org/10.1145/3158118

Chatterjee, K., Pavlogiannis, A. & Toman, V. (2019). Value-centric Dynamic Partial Order Reduction. Proceedings of the ACM on Programming Languages , 3(OOPSLA), Article 124. https://doi.org/10.1145/3360550

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

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

Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R. & Pavlogiannis, A. (2020). Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis. In P. Müller (Ed.), Programming Languages and Systems- 29th European Symposium on Programming, ESOP 2020 held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Proceedings (pp. 112-140). Springer. https://doi.org/10.1007/978-3-030-44914-8_5

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

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

Chatterjee, K., Svoboda, J., Žikelić, Đ., Pavlogiannis, A. & Tkadlec, J. (2022). Social balance on networks: Local minima and best-edge dynamics. Physical Review E, 106(3), Article 034321. https://doi.org/10.1103/PhysRevE.106.034321

Chatterjee, K., Ibsen-Jensen, R. R. & Pavlogiannis, A. (2016). Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs. In 24th Annual European Symposium on Algorithms (ESA 2016) (pp. 28:1-28:17). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2016.28

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

Chakraborty, M., Gnanakumar, A., Sridharan, M. & Møller, A. (2024). Indirection-Bounded Call Graph Analysis. In J. Aldrich & G. Salvaneschi (Eds.), 38th European Conference on Object-Oriented Programming, ECOOP 2024 Article 3 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ECOOP.2024.10

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

Buisse, A., Birkedal, L. & Støvring, K. (2011). A Step-Indexed Kripke Model of Separation Logic for Storable Locks. Electronic Notes in Theoretical Computer Science, 276. https://doi.org/10.1016/j.entcs.2011.09.018

Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A. & Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages , 5(OOPSLA), Article 164. https://doi.org/10.1145/3485541

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

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., Olesen, S. & Schwartzbach, M. I. (2002). Language-Based Caching of Dynamically Generated HTML. World Wide Web (New York), 5(4), 305-323. https://doi.org/10.1023/A:1021020226173

Brabrand, C., Møller, A. & Schwartzbach, M. I. (2001). Static Validation of Dynamically Generated HTML. In Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (pp. 38-45). Association for Computing Machinery. https://doi.org/10.1145/379605.379657

Brabrand, C., Møller, A. & Schwartzbach, M. I. (2002). The <bigwig> Project. A C M Transactions on Internet Technology, 2(2), 79-114. https://doi.org/10.1145/514183.514184

Brabrand, C., Møller, A., Sandholm, A. & Schwartzbach, M. I. (1999). A Runtime System for Interactive Web Services. Computer Networks, 31(11-16), 1391-1401. https://doi.org/10.1016/S1389-1286(99)00025-0

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

Brabrand, C., Giegerich, R. & Møller, A. (2006). Analyzing Ambiguity of Context-Free Grammars. BRICS Report Series, (RS-06-09).

Displaying results 351 to 400 out of 533

Revised 05.12.2025

Marianne Dammand Iversen