Publications

Sort by: Date | Author | Title

Kjelstrom, A. H. & Pavlogiannis, A. (2022). The Decidability and Complexity of Interleaved Bidirected Dyck Reachability. Proceedings of the ACM on Programming Languages , 6(POPL), Article 12. https://doi.org/10.1145/3498673

Madsen, M. (2022). The Principles of the Flix Programming Language. In Onward! 2022 - Proceedings of the 2022 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software, co-located with SPLASH 2022 (pp. 112-127). Association for Computing Machinery. https://doi.org/10.1145/3563835.3567661

Aagaard, F. L., Kristensen, M., Gratzer, D. & Birkedal, L. (2022). Unifying Cubical and Multimodal Type Theory. Abstract from 28th International Conference on Types for Proofs and Programs, Nantes, France. https://types22.inria.fr/files/2022/06/TYPES_2022_paper_35.pdf

Hansen, S. T., Thule, C., Gomes, C., van de Pol, J., Palmieri, M., Inci, E. O., Madsen, F., Alfonso, J., Castellanos, J. Á. & Rodriguez, J. M. (2022). Verification and synthesis of co-simulation algorithms subject to algebraic loops and adaptive steps. International Journal on Software Tools for Technology Transfer, 24(6), 999-1024. https://doi.org/10.1007/s10009-022-00686-8

Møller, A. & Sridharan, M. (Eds.) (2021). 35th European Conference on Object-Oriented Programming, ECOOP 2021, July 11-17, 2021, Aarhus, Denmark (Virtual Conference). In A. Møller & M. Sridharan (Eds.), 35th European Conference on Object-Oriented Programming (ECOOP 2021) (pp. vii-ix). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ECOOP.2021.0

André, É., Marinho, D. & Pol, J. V. D. (2021). A Benchmarks Library for Extended Parametric Timed Automata. In F. Loulergue & F. Wotawa (Eds.), Tests and Proofs - 15th International Conference, TAP 2021, Held as Part of STAF 2021, Proceedings: 15th International Conference, TAP 2021, Held as Part of STAF 2021, Virtual Event, June 21–22, 2021, Proceedings (pp. 39-50). Springer. https://doi.org/10.1007/978-3-030-79379-1_3

Sølvsten, S., van de Pol, J., Jakobsen, A. B., Rysgaard, C. M., Carstensen, E. F. & Thomasen, M. W. B. (2021). Adiar: An I/O-efficient implementation of Decision Diagrams. Software, GitHub. https://doi.org/10.5281/zenodo.4718218

Gleirscher, M., Pol, J. V. D. & Woodcock, J. (2021). A Manifesto for Applicable Formal Methods. (pp. 1-17). https://arxiv.org/abs/2112.12758

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

Georges, A. L., Guéneau, A., Van Strydonck, T., Timany, A., Trieu, A., Devriese, D. & Birkedal, L. (2021). Cap’ ou pas cap’ ? Preuve de programmes pour une machine à capacités en présence de code inconnu. 157-173. Paper presented at 32emes Journees Francophones des Langages Applicatifs, JFLA 2021 - 32nd French-Speaking Conference on Applicative Languages, JFLA 2021, Virtual, Online.

Georges, A. L., Guéneau, A., Van Strydonck, T., Timany, A., Trieu, A., Devriese, D. & Birkedal, L. (2021). Cap’ ou pas cap’ ?: Preuve de programmes pour une machine à capacités en présence de code inconnu. In Journées Francophones des Langages Applicatifs 2021 Institut de Recherche en Informatique Fondamentale. https://researchportal.vub.be/en/publications/cap-ou-pas-cap-preuve-de-programmes-pour-une-machine-%C3%A0-capacit%C3%A9s-

Shaik, I. & Pol, J. V. D. (2021). Classical Planning as QBF without Grounding (extended version). (pp. 1-17). https://arxiv.org/abs/2106.10138

Qian, Z., Kavvos, G. A. & Birkedal, L. (2021). Client-server sessions in linear logic. Proceedings of the ACM on Programming Languages , 5(ICFP), Article 62. https://doi.org/10.1145/3473567

Frumin, D., Krebbers, R. & Birkedal, L. (2021). Compositional non-interference for fine-grained concurrent programs. In 2021 IEEE Symposium on Security and Privacy (SP) (pp. 1416-1433). IEEE. https://doi.org/10.1109/SP40001.2021.00003

Vindum, S. F. & Birkedal, L. (2021). Contextual refinement of the Michael-Scott queue (proof pearl). In C. Hriţcu & A. Popescu (Eds.), CPP 2021: Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs (pp. 76-90). Association for Computing Machinery. https://doi.org/10.1145/3437992.3439930

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

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

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

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

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

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

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

Thomsen, S. E. & Spitters, B. (2021). Formalizing Nakamoto-Style Proof of Stake. In Proceedings - 2021 IEEE 34th Computer Security Foundations Symposium, CSF 2021 IEEE. https://doi.org/10.1109/CSF51468.2021.00042

Sidorenco, N., Oechsner, S. & Spitters, B. (2021). Formal security analysis of MPC-in-the-head zero-knowledge protocols. In Proceedings - 2021 IEEE 34th Computer Security Foundations Symposium, CSF 2021 (pp. 607-620). IEEE. https://doi.org/10.1109/CSF51468.2021.00050

Jacobs, K., Timany, A. & Devriese, D. (2021). Fully abstract from static to gradual. Proceedings of the ACM on Programming Languages , 5(POPL), Article 7. https://doi.org/10.1145/3434288

André, É., Arias, J., Petrucci, L. & Pol, J. V. D. (2021). Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata. In J. F. Groote & K. G. Larsen (Eds.), Tools and Algorithms for the Construction and Analysis of Systems - 27th International Conference, TACAS 2021 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021: 27th International Conference, TACAS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings, Part I (pp. 311-329). Springer. https://doi.org/10.1007/978-3-030-72016-2_17

Gregersen, S. O., Bay, J., Timany, A. & Birkedal, L. (2021). Mechanized logical relations for termination-insensitive noninterference. Proceedings of the ACM on Programming Languages , 5(POPL), Article 10. https://doi.org/10.1145/3434291

Nielsen, B. B., Torp, M. T. & Møller, A. (2021). Modular call graph construction for security scanning of Node.js applications. In C. Cadar & X. Zhang (Eds.), ISSTA 2021 - Proceedings of the 30th ACM SIGSOFT International Symposium on Software Testing and Analysis (pp. 29-41). Association for Computing Machinery. https://doi.org/10.1145/3460319.3464836

Gratzer, D., Kavvos, G. A., Nuyts, A. & Birkedal, L. (2021). Multimodal Dependent Type Theory. Logical Methods in Computer Science, 17(3), Article 11. https://doi.org/10.46298/lmcs-17(3:11)2021

Ahmadpanah, M. M., Askarov, A. & Sabelfeld, A. (2021). Nontransitive policies transpiled. In 2021 IEEE European Symposium on Security and Privacy (EuroS&P) (pp. 543-561). IEEE. https://doi.org/10.1109/EuroSP51992.2021.00043

van de Pol, J. & Petrucci, L. (2021). On Completeness of Liveness Synthesis for Parametric Timed Automata (Extended Abstract). In M. Roggenbach (Ed.), Recent Trends in Algebraic Development Techniques - 25th International Workshop, WADT 2020, Revised Selected Papers (pp. 3-10). Springer Science+Business Media. https://doi.org/10.1007/978-3-030-73785-6_1

Mathur, U., Pavlogiannis, A. & Viswanathan, M. (2021). Optimal Prediction of Synchronization-Preserving Races. Proceedings of the ACM on Programming Languages , 5(POPL), Article 36. https://doi.org/10.1145/3434317

Gleirscher, M., Pol, J. V. D. & Woodcock, J. (Eds.) (2021). Proceedings First Workshop on Applicable Formal Methods. Electronic Proceedings in Theoretical Computer Science https://doi.org/10.4204/EPTCS.349

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

Timany, A. & Birkedal, L. (2021). Reasoning about monotonicity in separation logic. In Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’21) (pp. 91-104). Association for Computing Machinery. https://doi.org/10.1145/3437992.3439931

Madsen, M. & Van De Pol, J. (2021). Relational nullable types with Boolean unification. Proceedings of the ACM on Programming Languages , 5(OOPSLA), 1-28. Article 110. https://doi.org/10.1145/3485487

Frumin, D., Krebbers, R. & Birkedal, L. (2021). ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity. Logical Methods in Computer Science, 17(3), Article 9. https://doi.org/10.46298/lmcs-17(3:9)2021

Nielsen, B. B., Torp, M. T. & Møller, A. (2021). Semantic Patches for Adaptation of JavaScript Programs to Evolving Libraries. In Proceedings - 2021 IEEE/ACM 43rd International Conference on Software Engineering, ICSE 2021 (pp. 74-85). IEEE. https://doi.org/10.1109/ICSE43902.2021.00020

Abate, C., Haselwarter, P. G., Rivas, E., Muylder, A. V., Winterhalter, T., Hritcu, C., Maillard, K. & Spitters, B. (2021). SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq. (pp. 397). Cryptology ePrint Archive. https://eprint.iacr.org/2021/397

Abate, C., Haselwarter, P. G., Rivas, E., Muylder, A. V., Winterhalter, T., Hriţcu, C., Maillard, K. & Spitters, B. (2021). SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq. In Proceedings - 2021 IEEE 34th Computer Security Foundations Symposium, CSF 2021 IEEE. https://doi.org/10.1109/CSF51468.2021.00048

Agarwal, P., Chatterjee, K., Pathak, S., Pavlogiannis, A. & Toman, V. (2021). Stateless Model Checking Under a Reads-Value-From Equivalence. In A. Silva, K. Rustan & M. Leino (Eds.), Computer Aided Verification - 33rd International Conference, CAV 2021, Proceedings: Proceedings (Vol. 1, pp. 341-366). Springer. https://doi.org/10.1007/978-3-030-81685-8_16

Skorstensgaard, L., Devriese, D. & Birkedal, L. (2021). StkTokens: Enforcing well-bracketed control flow and stack encapsulation using linear capabilities. Journal of Functional Programming, 31, Article e9. https://doi.org/10.1017/S095679682100006X

Hansen, S. T., Gomes, C., Larsen, P. G. & Van De Pol, J. (2021). Synthesizing Co-Simulation Algorithms with Step Negotiation and Algebraic Loop Handling. In C. R. Martin, M. J. Blas & A. I. Psijas (Eds.), 2021 Annual Modeling and Simulation Conference (ANNSIM) (pp. 62-73). IEEE. https://doi.org/10.23919/ANNSIM52504.2021.9552073

Bidlingmaier, M. E., Faissole, F. & Spitters, B. (2021). Synthetic topology in Homotopy Type Theory for probabilistic programming. Mathematical Structures in Computer Science, 31(10), 1301-1329. https://doi.org/10.1017/S0960129521000165

Mathiasen, A. A. & Pavlogiannis, A. (2021). The Fine-Grained and Parallel Complexity of Andersen’s Pointer Analysis. Proceedings of the ACM on Programming Languages , 5(POPL), Article 34. https://doi.org/10.1145/3434315

Birkedal, L., Dinsdale-Young, T., Guéneau, A., Jaber, G., Svendsen, K. & Tzevelekos, N. (2021). Theorems for free from separation logic specifications. Proceedings of the ACM on Programming Languages , 5(ICFP), Article 81. https://doi.org/10.1145/3473586

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

Hansen, J. C., Kjelstrøm, A. H. & Pavlogiannis, A. (2021). Tight bounds for reachability problems on one-counter and pushdown systems. Information Processing Letters, 171, Article 106135. https://doi.org/10.1016/j.ipl.2021.106135

Blaabjerg, J. F. & Askarov, A. (2021). Towards Language-Based Mitigation of Traffic Analysis Attacks. Paper presented at 34th IEEE Computer Security Foundations Symposium, Online, United States. https://doi.org/10.1109/CSF51468.2021.00030

Displaying results 151 to 200 out of 545

Revised 05.12.2025

Marianne Dammand Iversen