Publications

Sort by: Date | Author | Title

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 and Business Media Deutschland GmbH. 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

Spies, S., Gäher, L., Gratzer, D., Tassarotti, J., Krebbers, R., Dreyer, D. & Birkedal, L. (2021). Transfinite Iris: Resolving an existential dilemma of step-indexed separation logic. In S. N. Freund & E. Yahav (Eds.), PLDI 2021 - Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 80-95). Association for Computing Machinery. https://doi.org/10.1145/3453483.3454031

Hansen, S. T., Gomes, C., Palmieri, M., Thule, C., van de Pol, J. & Woodcock, J. (2021). Verification of Co-simulation Algorithms Subject to Algebraic Loops and Adaptive Steps. In A. L. Lafuente & A. Mavridou (Eds.), Formal Methods for Industrial Critical Systems (pp. 3-20). Springer. https://doi.org/10.1007/978-3-030-85248-1_1

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

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

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

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

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

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

Reinhard, T., Timany, A. & Jacobs, B. (2020). A Separation Logic to Verify Termination of Busy-Waiting for Abrupt Program Exit: Technical Report.

Reinhard, T., Timany, A. & Jacobs, B. (2020). A Separation Logic to Verify Termination of Busy-Waiting for Abrupt Program Exit.

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

Wimmer, S., Herbreteau, F. & van de Pol, J. (2020). Certifying Emptiness of Timed Büchi Automata. In N. Bertrand & N. Jansen (Eds.), Formal Modeling and Analysis of Timed Systems : 18th International Conference, FORMATS 2020 (pp. 58-75). Springer. https://doi.org/10.1007/978-3-030-57628-8_4

Displaying results 151 to 200 out of 533

Revised 05.12.2025

Marianne Dammand Iversen