Publications

Sort by: Date | Author | Title

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

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

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

Nielsen, J. B. & Spitters, B. (2019). Smart Contract Interactions in Coq. (0 ed.) ArXiv.

Kordon, F., Leuschel, M., Pol, J. V. D. & Thierry-Mieg, Y. (2019). Software Architecture of Modern Model Checkers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): State of the Art and Perspectives (pp. 393-419). Springer. https://doi.org/10.1007/978-3-319-91908-9_20

Meijer, J. & van de Pol, J. (2019). Sound black-box checking in the LearnLib. Innovations in Systems and Software Engineering, 15(3-4), 267-287. https://doi.org/10.1007/s11334-019-00342-6

Penninckx, W., Timany, A. & Jacobs, B. (2019). Specifying i/o using abstract nested hoare triples in separation logic. In Proceedings of the 21st Workshop on Formal Techniques for Java-Like Programs, FTfJP 2019 - Co-located with ECOOP 2019 Article 5 Association for Computing Machinery. https://doi.org/10.1145/3340672.3341118

Stein, B., Nielsen, B. B., Chang, B.-Y. E. & Møller, A. (2019). Static Analysis with Demand-driven Value Refinement. Proceedings of the ACM on Programming Languages , 3(OOPSLA), Article 140. https://doi.org/10.1145/3360566

Pedersen, M. & Askarov, A. (2019). Static Enforcement of Security in Runtime Systems. In Proceedings - 2019 IEEE 32nd Computer Security Foundations Symposium, CSF 2019 (pp. 335-350). Article 8823712 IEEE. https://doi.org/10.1109/CSF.2019.00030

Skorstengaard, L., Devriese, D. & Birkedal, L. (2019). StkTokens: Enforcing Well-Bracketed Control Flow and Stack Encapsulation Using Linear Capabilities. Proceedings of the ACM on Programming Languages , 3(POPL), Article 19. https://doi.org/10.1145/3290332

Pol, J. V. D. & Meijer, J. (2019). Synchronous or Alternating? LTL Black-Box Checking of Mealy Machines by Combining the LearnLib and LTSmin. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): The What, the How, and the Why Not? (pp. 417-430). Springer. https://doi.org/10.1007/978-3-030-22348-9_24

Bidlingmaier, M. E., Faissole, F. & Spitters, B. (2019). Synthetic topology in Homotopy Type Theory for probabilistic programming. ArXiv.

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

Timany, A., Stefanesco, L., Krogh-Jespersen, M. & Birkedal, L. (2018). A Logical Relation for Monadic Encapsulation of State: Proving contextual equivalences in the presence of runST. In Proceedings of the ACM on Programming Languages (Vol. 2, pp. 64:00-64:28). Association for Computing Machinery. https://doi.org/10.1145/3158152

Bizjak, A. & Birkedal, L. (2018). A Model of Guarded Recursion via Generalised Equilogical Spaces. Theoretical Computer Science, 722, 1-18. https://doi.org/10.1016/j.tcs.2018.02.012

Huang, D., Morrisett, G. & Spitters, B. (2018, Jun 20). An Application of Computable Distributions to the Semantics of Probabilistic Programs. Cornell University.

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

Karbyshev, A., Svendsen, K., Askarov, A. & Birkedal, L. (2018). Compositional Non-interference for Concurrent Programs via Separation and Framing. In L. Bauer & R. Küsters (Eds.), Principles of Security and Trust - 7th International Conference, POST 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Proceedings (Vol. 10804, pp. 53-78). Springer VS. https://doi.org/10.1007/978-3-319-89722-6_3

Haagh, H., Karbyshev, A., Oechsner, S., Spitters, B. & Strub, P.-Y. (2018, Jun 19). Computer-aided proofs for multiparty computation with active security. arxiv.org. Computer Security Foundations https://arxiv.org/abs/1806.07197

Haagh, H., Karbyshev, A., Oechsner, S., Spitters, B. & Strub, P. (2018). Computer-Aided Proofs for Multiparty Computation with Active Security. In Proceedings - IEEE 31st Computer Security Foundations Symposium, CSF 2018 (Vol. 2018, pp. 119-131). Article 8429300 IEEE. https://doi.org/10.1109/CSF.2018.00016

Pavlogiannis, A., Tkadlec, J., Chatterjee, K. & Nowak, M. A. (2018). Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology, 1(1), Article 71. https://doi.org/10.1038/s42003-018-0078-7

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

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

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

Licata, D. R., Orton, I., Pitts, A. M. & Spitters, B. (2018, Jul 1). Internal Universes in Models of Homotopy Type Theory. arxiv.org. https://doi.org/10.4230/LIPIcs.FSCD.2018.22

JUNG, RALF., KREBBERS, ROBBERT., JOURDAN, JACQUES.-HENRI., BIZJAK, ALEŠ., BIRKEDAL, LARS. & DREYER, DEREK. (2018). Iris from the ground up: A modular foundation for higher-order concurrent separation logic. Journal of Functional Programming, 28, 1-73. Article e20. https://doi.org/10.1017/S0956796818000151

Krebbers, R., Jourdan, J.-H., Jung, R., Tassarotti, J., Kaiser, J.-O., Timany, A., Charguéraud, A. & Dreyer, D. (2018). MoSeL: a general, extensible modal framework for interactive proofs in separation logic. PACMPL, 2(ICFP), 77:1-77:30. Article 3236772. https://doi.org/10.1145/3236772

Bizjak, A. & Birkedal, L. (2018). On Models of Higher-Order Separation Logic. Electronic Notes in Theoretical Computer Science, 336(4), 57-78. https://doi.org/10.1016/j.entcs.2018.03.016

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

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

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

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

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

Aguirre, A., Barthe, G., Birkedal, L., Bizjak, A., Gaboardi, M. & Garg, D. (2018). Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda Calculus. 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 (pp. 214-241). Springer VS. https://doi.org/10.1007/978-3-319-89884-1_8

Frumin, D., Krebbers, R. & Birkedal, L. (2018). ReLoC: A Mechanised Relational Logic for Fine-Grained Concurrency. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018 (pp. 442-451). Association for Computing Machinery. https://doi.org/10.1145/3209108.3209174

Madsen, M. & Lhoták, O. (2018). Safe and Sound Program Analysis with Flix. In E. Bodden & F. Tip (Eds.), ISSTA 2018 - Proceedings of the 27th ACM SIGSOFT International Symposium on Software Testing and Analysis (pp. 38-48). Association for Computing Machinery. https://doi.org/10.1145/3213846.3213847

Li, Y., Tan, T., Møller, A. & Smaragdakis, Y. (2018). Scalability-First Pointer Analysis with Self-Tuning Context-Sensitivity. 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. 129-140). Association for Computing Machinery. https://doi.org/10.1145/3236024.3236041

Madsen, M., Zarifi, R. & Lhoták, O. (2018). Tail Call Elimination and Data Representation for Functional Languages on the Java Virtual Machine. In J. Xue & C. Dubach (Eds.), CC 2018 - Proceedings of the 27th International Conference on Compiler Construction, Co-located with CGO 2018 (pp. 139-150). Association for Computing Machinery. https://doi.org/10.1145/3178372.3179499

Møller, A. (2018). Technical Perspective: WebAssembly: A Quiet Revolution of the Web. Communications of the A C M, 61(12), 106-106. https://doi.org/10.1145/3282508

Mezzetti, G., Møller, A. & Torp, M. T. (2018). Type Regression Testing to Detect Breaking Changes in Node.js Libraries. In T. D. Millstein (Ed.), 32nd European Conference on Object-Oriented Programming, ECOOP 2018 (Vol. 109, pp. 7:1-7:24). Article 7 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ECOOP.2018.7

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

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

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

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

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

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

Kristensen, E. K. & Møller, A. (2017). Inference and Evolution of TypeScript Declaration Files. In M. Huisman & J. Rubin (Eds.), Fundamental Approaches to Software Engineering - 20th International Conference, FASE 2017 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Proceedings: 20th International Conference, FASE 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings (Vol. 10202, pp. 99-115). Springer VS. https://doi.org/10.1007/978-3-662-54494-5_6

Krebbers, R., Timany, A. & Birkedal, L. (2017). Interactive proofs in higher-order concurrent separation logic. In A. D. Gordon & G. Castagna (Eds.), Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017 (pp. 205-217). Association for Computing Machinery. https://doi.org/10.1145/3009837.3009855

Ernst, E., Møller, A., Schwarz, M. & Strocco, F. (2017). Message safety in Dart. Science of Computer Programming, 133/1(1), 51-73. https://doi.org/10.1016/j.scico.2016.06.006

Displaying results 251 to 300 out of 533

Revised 05.12.2025

Marianne Dammand Iversen