Publications

Sort by: Date | Author | Title

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

Birkedal, L., Bizjak, A., Clouston, R., Grathwohl, H. B., Spitters, B. & Vezzosi, A. (2019). Guarded Cubical Type Theory. Journal of Automated Reasoning, 63(2), 211-253. https://doi.org/10.1007/s10817-018-9471-7, https://doi.org/10.1007/s10817-018-9471-7

Gratzer, D., Sterling, J. & Birkedal, L. (2019). Implementing a modal dependent type theory. Proceedings of the ACM on Programming Languages , 3(ICFP), 1-29. Article 107. https://doi.org/10.1145/3341711

Bizjak, A., Gratzer, D., Krebbers, R. & Birkedal, L. (2019). Iron: managing obligations in higher-order concurrent separation logic. Proceedings of the ACM on Programming Languages , 3(POPL), 1-30. Article 65. https://doi.org/10.1145/3290378

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

Timany, A. & Birkedal, L. (2019). Mechanized relational verification of concurrent programs with continuations. Proceedings of the ACM on Programming Languages , 3(ICFP), 1-28. Article 105. https://doi.org/10.1145/3341709

André, É., Bloemen, V., Petrucci, L. & Pol, J. V. D. (2019). Minimal-Time Synthesis for Parametric Timed Automata. In L. Zhang & T. Vojnar (Eds.), 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: 25th International Conference, TACAS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings (Vol. II, pp. 211-228). Springer. https://doi.org/10.1007/978-3-030-17465-1_12

Møller, A. & Torp, M. T. (2019). Model-based testing of breaking changes in Node.js libraries. In S. Apel, M. Dumas, A. Russo & D. Pfahl (Eds.), ESEC/FSE 2019 - Proceedings of the 2019 27th ACM Joint Meeting European Software Engineering Conference and Symposium on the Foundations of Software Engineering (pp. 409-419). Association for Computing Machinery. https://doi.org/10.1145/3338906.3338940

Bloemen, V., Duret-Lutz, A. & van de Pol, J. (2019). Model checking with generalized Rabin and Fin-less automata. International Journal on Software Tools for Technology Transfer, 21(3), 307-324. https://doi.org/10.1007/s10009-019-00508-4

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

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

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

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

Displaying results 251 to 300 out of 545

Revised 05.12.2025

Marianne Dammand Iversen