Aarhus University Seal

Publications

Sort by: Date | Author | Title

Oortwijn, W., Huisman, M., Joosten, S. J. C. & van de Pol, J. (2020). Automated verification of parallel nested DFS. In A. Biere & D. Parker (Eds.), Tools and Algorithms for the Construction and Analysis of Systems- 26th International Conference, TACAS 2020, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Proceedings, Part I (pp. 247-265). Springer. https://doi.org/10.1007/978-3-030-45190-5_14
Jensen, C. S., Prasad, M. R. & Møller, A. (2013). Automated Testing with Targeted Event Sequence Generation. In M. Pezzè & M. Harman (Eds.), International Symposium on Software Testing and Analysis (ISSTA), 2013: Proceedings (pp. 67-77). Association for Computing Machinery. https://doi.org/10.1145/2483760.2483777
Møller, A. & Schwarz, M. (2012). Automated Detection of Client-State Manipulation Vulnerabilities. In M. Glinz, G. Murphy & M. Pezzè (Eds.), 34th International Conference on Software Engineering (ICSE 2012) : Proceedings (pp. 749 - 759 ). IEEE Communications Society. https://doi.org/10.1109/ICSE.2012.6227143
Møller, A. & Schwarz, M. R. (2014). Automated Detection of Client-State Manipulation Vulnerabilities. A C M Transactions on Software Engineering and Methodology, 23/4, Article 29. https://doi.org/10.1145/2531921
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
Schenck, R., Hinnerskov, N. H., Henriksen, T., Madsen, M. & Elsman, M. (2024). AUTOMAP: Inferring Rank-Polymorphic Function Applications with Integer Linear Programming. Proceedings of the ACM on Programming Languages , 8(OOPSLA2), 1787-1813. Article 334. https://doi.org/10.1145/3689774
Larsen, C. A., Schmidt, S. M., Steensgaard, J., Jakobsen, A. B., Pol, J. V. D. & Pavlogiannis, A. (2023). A Truly Symbolic Linear-Time Algorithm for SCC Decomposition. In S. Sankaranarayanan & N. Sharygina (Eds.), Tools and Algorithms for the Construction and Analysis of Systems: 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22–27, 2023, Proceedings, Part II (pp. 353-371). Springer. https://doi.org/10.1007/978-3-031-30820-8_22
Mathur, U., Pavlogiannis, A., Tunc, H. C. & Viswanathan, M. (2022). A Tree Clock Data Structure for Causal Orderings in Concurrent Executions. In B. Falsafi, M. Ferdman, S. Lu & T. F. Wenisch (Eds.), ASPLOS 2022 - Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems (pp. 710-725). Association for Computing Machinery. https://doi.org/10.1145/3503222.3507734
Andreasen, E., Gong, L., Møller, A., Pradel, M., Selakovic, M., Sen, K. & Staicu, C.-A. (2017). A Survey of Dynamic Analysis and Test Generation for JavaScript. A C M Computing Surveys, 50(5), 66:1-66:36. Article 66. https://doi.org/10.1145/3106739
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
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
Schwinghammer, J., Birkedal, L. & Støvring, K. (2011). A Step-Indexed Kripke Model of Hidden State via Recursive Properties on Recursively Defined Metric Spaces. In M. Hofmann (Ed.), Foundations of Software Science and Computational Structures: 14th International Conference, FOSSACS 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26–April 3, 2011. Proceedings (pp. 305-319). Springer. https://doi.org/10.1007/978-3-642-19805-2_21
Schwinghammer, J., Birkedal, L., Pottier, F., Reus, B., Støvring, K. & Yang, H. (2013). A step-indexed Kripke model of hidden state. Mathematical Structures in Computer Science, 23(1), 1-54. https://doi.org/10.1017/S0960129512000035
Birkedal, L., Reus, B., Schwinghammer, J. & Yang, H. (2008). A Simple Model of Separation Logic for Higher-order Store. Lecture Notes in Computer Science, 348-360.
Reinhard, T., Timany, A. & Jacobs, B. (2020). A separation logic to verify termination of busy-waiting for abrupt program exit. In FTfJP 2020: Proceedings of the 22nd ACM SIGPLAN International Workshop on Formal Techniques for Java-Like Programs (pp. 26-32). Association for Computing Machinery. https://doi.org/10.1145/3427761.3428345
Sieczkowski, F., Svendsen, K., Birkedal, L. & Pichon-Pharabod, J. (2015). A separation logic for fictional sequential consistency. In J. Vitek (Ed.), Programming Languages and Systems : 24th European Symposiumon Programming, ESOP 2015 held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015 (pp. 736-761). Springer. https://doi.org/10.1007/978-3-662-46669-8_30
Madsen, M., Lhoták, O. & Tip, F. (2020). A Semantics for the Essence of React. In R. Hirschfeld & T. Pape (Eds.), 34th European Conference on Object-Oriented Programming (ECOOP 2020) (Vol. 166, pp. 12:1-12:26). Article 12 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ECOOP.2020.12
Schwinghammer, J., Yang, H., Birkedal, L., Pottier, F. & Reus, B. (2010). A semantic foundation for hidden state. In L. Ong (Ed.), Foundations of Software Science and Computational Structures: 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings (pp. 2-17). Springer. https://doi.org/10.1007/978-3-642-12032-9_2
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
Brabrand, C., Møller, A., Sandholm, A. & Schwartzbach, M. I. (1999). A Runtime System for Interactive Web Services. In Proceedings of the 8th International World Wide Web Conference Elsevier.
Spencer, B., Benedikt, M., Møller, A. & Breugel, F. V. (2017). ArtForm: A Tool for Exploring the Codebase of Form-based Websites. In K. Sen & T. Bultan (Eds.), ISSTA 2017 - Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis (pp. 380-383). Association for Computing Machinery. https://doi.org/10.1145/3092703.3098226
Tofte, M., Birkedal, L., Elsman, M. & Hallenberg, N. (2004). A retrospective on Region-based Memory Management. Higher-Order and Symbolic Computation, 17(3), 245-265. https://doi.org/10.1023/B:LISP.0000029446.78563.a4
Krogh-Jespersen, M., Svendsen, K. & Birkedal, L. (2017). A relational model of types-and-effects in higher-order concurrent separation logic. In POPL 2017 - Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages: POPL 2017 (pp. 218-231). Association for Computing Machinery. https://doi.org/10.1145/3009837.3009877
Dreyer, D., Neis, G., Rossberg, A. & Birkedal, L. (2010). A relational modal logic for higher-order stateful ADTs. In M. Hermenegildo & J. Palsberg (Eds.), Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Madrid, Spain, January 17-23, 2010 (pp. 185-198). Association for Computing Machinery. https://doi.org/10.1145/1706299.1706323
Tofte, M. & Birkedal, L. (1998). A Region Inference Algorithm. A C M Transactions on Programming Languages and Systems, 20(4), 724-767. http://www.scopus.com/inward/record.url?scp=0032108162&partnerID=8YFLogxK
Petersen, R. L., Birkedal, L., Nanevski, A. & Morrisett, G. (2008). A realizability model for impredicative Hoare Type Theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4960 LNCS, pp. 337-352) https://doi.org/10.1007/978-3-540-78739-6_26
Li, Y., Tan, T., Møller, A. & Smaragdakis, Y. (2020). A Principled Approach to Selective Context Sensitivity for Pointer Analysis. ACM Transactions on Programming Languages and Systems, 42(2), Article 10. https://doi.org/10.1145/3381915
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
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
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
Sørensen, J. A., Kristoffersen, K. J., Cervera, A., Schiøtz, M., Lynge, T., Safar, Z. & Birkedal, L. (2004). An infrastructure for context dependent mobile multimedia communication. In 2004 IEEE 6th Workshop on Multimedia Signal Processing (pp. 462-464). IEEE Press. https://doi.org/10.1109/MMSP.2004.1436595
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
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.
Krogh-Jespersen, M., Timany, A., Ohlenbusch, M. E., Gregersen, S. O. & Birkedal, L. (2020). Aneris: A Mechanised Logic for Modular Reasoning about Distributed Systems. 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. 336-365). Springer. https://doi.org/10.1007/978-3-030-44914-8_13
Khurana, S., Schivo, S., Plass, J. R. M., Mersinis, N., Scholma, J., Kerkhofs, J., Zhong, L., van de Pol, J., Langerak, R., Geris, L., Karperien, M. & Post, J. N. (2021). An ECHO of Cartilage: In Silico Prediction of Combinatorial Treatments to Switch Between Transient and Permanent Cartilage Phenotypes With Ex Vivo Validation. Frontiers in Bioengineering and Biotechnology, 9, Article 732917. https://doi.org/10.3389/fbioe.2021.732917
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
Liu, Z., Hammond, A., Pérami, T., Sewell, P., Birkedal, L. & Pichon-Pharabod, J. (2026). An Axiomatic Basis for Computer Programming on Relaxed Hardware Architectures: The AxSL Logics. ACM Transactions on Programming Languages and Systems. Advance online publication. https://doi.org/10.1145/3786762
Adamsen, C. Q., Mezzetti, G. & Møller, A. (2016). Analyzing Test Completeness for Dynamic Languages. In ISSTA 2016 - Proceedings of the 25th International Symposium on Software Testing and Analysis: ISSTA 2016 (pp. 142-153). Association for Computing Machinery. https://doi.org/10.1145/2931037.2931059
Brabrand, C., Giegerich, R. & Møller, A. (2006). Analyzing Ambiguity of Context-Free Grammars. BRICS Report Series, (RS-06-09).
Brabrand, C., Giegerich, R. & Møller, A. (2007). Analyzing Ambiguity of Context-Free Grammars. In Proc. 12th International Conference on Implementation and Application of Automata
Brabrand, C., Giegerich, R. & Møller, A. (2010). Analyzing Ambiguity of Context-Free Grammars. Science of Computer Programming, 75(3), 176-191. https://doi.org/10.1016/j.scico.2009.11.002
Pavlogiannis, A., Tkadlec, J., Chatterjee, K. & Nowak, M. A. (2017). Amplification on Undirected Population Structures: Comets Beat Stars. Scientific Reports, 7(1), 82. Article 82. https://doi.org/10.1038/s41598-017-00107-w