Publications

Sort by: Date | Author | Title

Qian, Z., Kavvos, G. A. & Birkedal, L. (2020). Client-Server Sessions in Linear Logic. arxiv.org. https://arxiv.org/abs/2010.13926

Annenkov, D., Nielsen, J. B. & Spitters, B. (2020). ConCert: A Smart Contract Certification Framework in Coq. (pp. 215-228). arxiv.org. https://doi.org/10.1145/3372885.3373829

Annenkov, D., Botsch Nielsen, J. & Spitters, B. (2020). ConCert: A smart contract certification framework in Coq. In Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’20), January 20-21, 2020, New Orleans, LA, USA (pp. 215-228). Association for Computing Machinery. https://doi.org/10.1145/3372885.3373829

Nielsen, B. B., Torp, M. T. & Møller, A. (2020). Detecting Locations in JavaScript Programs Affected by Breaking Library Changes. Proceedings of the ACM on Programming Languages , 4(OOPSLA), Article 187. https://doi.org/10.1145/3428255

Schivo, S., Khurana, S., Govindaraj, K., Scholma, J., Kerkhofs, J., Zhong, L., Huang, X., van de Pol, J., Langerak, R., van Wijnen, A. J., Geris, L., Karperien, M. & Post, J. N. (2020). ECHO, the executable CHOndrocyte: A computational model to study articular chondrocytes in health and disease. Cellular Signalling, 68, Article 109471. https://doi.org/10.1016/j.cellsig.2019.109471

Birkedal, L. (2020). Editorial message. Proceedings of the ACM on Programming Languages , 4(POPL).

Møller, A. & Veileborg, O. H. (2020). Eliminating abstraction overhead of Java stream pipelines using ahead-of-time program optimization. Proceedings of the ACM on Programming Languages , 4(OOPSLA), Article 168. https://doi.org/10.1145/3428236

Staicu, C. A., Torp, M. T., Schafer, M., Møller, A. & Pradel, M. (2020). Extracting Taint Specifications for JavaScript Libraries. In ICSE '20: Proceedings of the ACM/IEEE 42nd International Conference on Software Engineering (pp. 198-209). Article 3380390 Association for Computing Machinery. https://doi.org/10.1145/3377811.3380390

Asadi, A., Chatterjee, K., Goharshady, A. K., Mohammadi, K. & Pavlogiannis, A. (2020). Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth. In D. Van Hung & O. Sokolsky (Eds.), Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Proceedings (pp. 253-270). Springer. https://doi.org/10.1007/978-3-030-59152-6_14

Pavlogiannis, A. (2020). Fast, Sound, and Effectively Complete Dynamic Race Prediction. Proceedings of the ACM on Programming Languages , 4(POPL), 1-29. Article 17. https://doi.org/10.1145/3371085

Madsen, M. & Lhoták, O. (2020). Fixpoints for the masses: programming with first-class Datalog constraints. In Proceedings of the ACM on Programming Languages (OOPSLA ed., Vol. 4). Association for Computing Machinery. https://doi.org/10.1145/3428193

Thomsen, S. E. & Spitters, B. (2020). Formalizing Nakamoto-Style Proof of Stake.

Stiévenart, Q. & Madsen, M. (2020). Fuzzing channel-based concurrency runtimes using types and effects. In Proceedings of the ACM on Programming Languages (OOPSLA ed., Vol. 4). Association for Computing Machinery. https://doi.org/10.1145/3428254

Hvass, B. S., Aranha, D. F. & Spitters, B. (2020). High-assurance field inversion for pairing-friendly primes. Abstract from The Coq Workshop 2020. https://coq-workshop.gitlab.io/2020/abstracts/Coq2020_04-02-primes.pdf

Hvass, B. S., Aranha, D. F. & Spitters, B. (2020). High-assurance field inversion for pairing-friendly primes. Abstract from 2nd Workshop on Formal Methods for Blockchains. https://fmbc.gitlab.io/2020/files/FMBC2020.pdf

Abel, A., Cockx, J., Devriese, D., Timany, A. & Wadler, P. (2020). Leibniz equality is isomorphic to Martin-Löf identity, parametrically. Journal of Functional Programming, 30, Article e17. https://doi.org/10.1017/S0956796820000155

Tkadlec, J., Pavlogiannis, A., Chatterjee, K. & Nowak, M. A. (2020). Limits on amplifiers of natural selection under death-Birth updating. PLoS Computational Biology, 16(1), Article e1007494. https://doi.org/10.1371/journal.pcbi.1007494

Birkedal, L., Clouston, R., Mannaa, B., Ejlers Møgelberg, R., Pitts, A. M. & Spitters, B. (2020). Modal dependent type theory and dependent right adjoints. Mathematical Structures in Computer Science, 30(2), 118-138. https://doi.org/10.1017/S0960129519000197

Rijke, E., Shulman, M. & Spitters, B. (2020). Modalities in homotopy type theory. Logical Methods in Computer Science, 16(1), 2:1-2:79. https://doi.org/10.23638/LMCS-16(1:2)2020

Gratzer, D., Kavvos, G. A., Nuyts, A. & Birkedal, L. (2020). Multimodal Dependent Type Theory. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2020 (pp. 492-506). Article 3394736 Association for Computing Machinery. https://doi.org/10.1145/3373718.3394736

Endo, A. T. & Møller, A. (2020). NodeRacer: Event Race Detection for Node.js Applications. In 2020 IEEE 13th International Conference on Software Testing, Verification and Validation, ICST 2020: Proceedings (pp. 120-130). Article 9159075 IEEE. https://doi.org/10.1109/ICST46399.2020.00022

Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R. & Pavlogiannis, A. (2020). Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis. 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. 112-140). Springer. https://doi.org/10.1007/978-3-030-44914-8_5

Madsen, M. & Pol, J. V. D. (2020). Polymorphic types and effects with Boolean unification. In Proceedings of the ACM on Programming Languages (OOPSLA ed., Vol. 4). Association for Computing Machinery. https://doi.org/10.1145/3428222

Pavlogiannis, A., Schaumberger, N., Schmid, U. & Chatterjee, K. (2020). Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 39(11), 3981-3992. Article 9211419. https://doi.org/10.1109/TCAD.2020.3012803

Bay, J. & Askarov, A. (2020). Reconciling progress-insensitive noninterference and declassification. In 2020 IEEE 33rd Computer Security Foundations Symposium (CSF) (pp. 95-106). IEEE. https://doi.org/10.1109/CSF49147.2020.00015

Frumin, D., Krebbers, R. & Birkedal, L. (2020). ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity. arxiv.org. https://arxiv.org/abs/2006.13635

Giarrusso, P. G., Stefanesco, L., Timany, A., Birkedal, L. & Krebbers, R. (2020). Scala step-by-step: Soundness for DOT with step-indexed logical relations in Iris. Proceedings of the ACM on Programming Languages , 4(ICFP), Article 114. https://doi.org/10.1145/3408996

Nielsen, J. B. & Spitters, B. (2020). Smart contract interactions in coq. In E. Sekerinski, N. Moreira, J. N. Oliveira, D. Ratiu, R. Guidotti, M. Farrell, M. Luckcuck, D. Marmsoler, J. Campos, T. Astarte, L. Gonnord, A. Cerone, L. Couto, B. Dongol, M. Kutrib, P. Monteiro & D. Delmas (Eds.), Formal Methods- FM 2019 International Workshops - Revised Selected Papers (pp. 380-391). Springer. https://doi.org/10.1007/978-3-030-54994-7_29

Garavel, H., ter Beek, M. H. & van de Pol, J. (2020). The 2020 Expert Survey on Formal Methods. In M. H. ter Beek & D. Nickovic (Eds.), Formal Methods for Industrial Critical Systems - 25th International Conference, FMICS 2020, Proceedings: FMICS 2020, Vienna, Austria, September 2-3, 2020, Proceedings (pp. 3-69). Springer. https://doi.org/10.1007/978-3-030-58298-2_1

Mathur, U., Pavlogiannis, A. & Viswanathan, M. (2020). The Complexity of Dynamic Data Race Prediction. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2020 (pp. 713–727). Article 3394783 Association for Computing Machinery. https://doi.org/10.1145/3373718.3394783

Pavlogiannis, A. (2020). The Fine-Grained Complexity of Andersen's Pointer Analysis. ArXiv. https://arxiv.org/abs/2006.01491

Jung, R., Lepigre, R., Parthasarathy, G., Rapoport, M., Timany, A., Dreyer, D. & Jacobs, B. (2020). The future is ours: prophecy variables in separation logic. Proceedings of the ACM on Programming Languages , 4(POPL), Article 45. https://doi.org/10.1145/3371113

Nielsen, B. B. & Møller, A. (2020). Value Partitioning: A Lightweight Approach to Relational Static Analysis for JavaScript. In 34th European Conference on Object-Oriented Programming, ECOOP 2020 Article 16 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ECOOP.2020.16

Penninckx, W., Timany, A. & Jacobs, B. (2019). Abstract I/O Specification. ArXiv. http://arxiv.org/abs/1901.10541v1

Gregersen, S. O., Thomsen, S. E. & Askarov, A. (2019). A Dependently Typed Library for Static Information-Flow Control in IDRIS. In F. Nielson & D. Sands (Eds.), Principles of Security and Trust: 8th International Conference, POST 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Proceedings (pp. 51-75). Springer. https://doi.org/10.1007/978-3-030-17138-4_3

van de Pol, J. (2019). Concurrent algorithms and data structures for model checking. In W. Fokkink & R. van Glabbeek (Eds.), 30th International Conference on Concurrency Theory, CONCUR 2019 Article 4 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CONCUR.2019.4

Van Der Berg, F. I. & Van De Pol, J. (2019). Concurrent chaining hash maps for software model checking. In C. Barrett & J. Yang (Eds.), Proceedings of the 19th Conference on Formal Methods in Computer-Aided Design, FMCAD 2019 (pp. 46-54). Article 8894279 IEEE. https://doi.org/10.23919/FMCAD.2019.8894279

Sterling, J., Angiuli, C. & Gratzer, D. (2019). Cubical syntax for reflection-free extensional equality. In H. Geuvers (Ed.), 4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019 Article 31 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.FSCD.2019.31

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

Displaying results 201 to 250 out of 533

Revised 05.12.2025

Marianne Dammand Iversen