Lars Birkedal

6.3k total citations
163 papers, 2.8k citations indexed

About

Lars Birkedal is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Lars Birkedal has authored 163 papers receiving a total of 2.8k indexed citations (citations by other indexed papers that have themselves been cited), including 139 papers in Artificial Intelligence, 79 papers in Computational Theory and Mathematics and 56 papers in Computer Networks and Communications. Recurrent topics in Lars Birkedal's work include Logic, programming, and type systems (125 papers), Formal Methods in Verification (65 papers) and Logic, Reasoning, and Knowledge (60 papers). Lars Birkedal is often cited by papers focused on Logic, programming, and type systems (125 papers), Formal Methods in Verification (65 papers) and Logic, Reasoning, and Knowledge (60 papers). Lars Birkedal collaborates with scholars based in Denmark, United States and Germany. Lars Birkedal's co-authors include Derek Dreyer, Robbert Krebbers, Mads Tofte, Greg Morrisett, Aleksandar Nanevski, Ralf Jung, Amin Timany, Aaron Turon, Kristian Støvring and Rasmus Ejlers Møgelberg and has published in prestigious journals such as Journal of the ACM, Theoretical Computer Science and ACM SIGPLAN Notices.

In The Last Decade

Lars Birkedal

156 papers receiving 2.7k citations

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author Last Decade Papers Cites
Lars Birkedal 2.5k 1.3k 1.1k 621 199 163 2.8k
Peter W. O’Hearn 2.5k 1.0× 1.5k 1.1× 995 0.9× 555 0.9× 587 2.9× 79 3.1k
Derek Dreyer 2.3k 0.9× 1.1k 0.8× 1.1k 1.0× 763 1.2× 291 1.5× 113 2.7k
Olivier Danvy 3.0k 1.2× 1.8k 1.3× 403 0.4× 802 1.3× 379 1.9× 195 3.2k
Georges Gonthier 959 0.4× 996 0.7× 585 0.6× 875 1.4× 251 1.3× 27 2.0k
Gérard Huet 2.2k 0.9× 1.5k 1.1× 347 0.3× 223 0.4× 253 1.3× 45 2.4k
Davide Sangiorgi 2.1k 0.8× 1.5k 1.1× 846 0.8× 114 0.2× 88 0.4× 83 2.5k
Glynn Winskel 1.5k 0.6× 1.7k 1.3× 604 0.6× 163 0.3× 232 1.2× 119 2.4k
Eugenio Moggi 1.6k 0.6× 940 0.7× 233 0.2× 235 0.4× 109 0.5× 39 1.7k
Gilles Barthe 1.8k 0.7× 563 0.4× 440 0.4× 318 0.5× 140 0.7× 148 2.0k
Jan Willem Klop 2.2k 0.9× 2.1k 1.5× 375 0.4× 245 0.4× 335 1.7× 111 2.8k

Countries citing papers authored by Lars Birkedal

Since Specialization
Citations

This map shows the geographic impact of Lars Birkedal's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Lars Birkedal with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Lars Birkedal more than expected).

Fields of papers citing papers by Lars Birkedal

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Lars Birkedal. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Lars Birkedal. The network helps show where Lars Birkedal may publish in the future.

Co-authorship network of co-authors of Lars Birkedal

This figure shows the co-authorship network connecting the top 25 collaborators of Lars Birkedal. A scholar is included among the top collaborators of Lars Birkedal based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Lars Birkedal. Lars Birkedal is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Timany, Amin, et al.. (2025). Reasoning about Weak Isolation Levels in Separation Logic. Proceedings of the ACM on Programming Languages. 9(ICFP). 306–340.
2.
Møgelberg, Rasmus Ejlers, et al.. (2025). Modelling Recursion and Probabilistic Choice in Guarded Type Theory. Proceedings of the ACM on Programming Languages. 9(POPL). 1417–1445. 1 indexed citations
3.
Timany, Amin, Robbert Krebbers, Derek Dreyer, & Lars Birkedal. (2024). A Logical Approach to Type Soundness. Journal of the ACM. 71(6). 1–75. 13 indexed citations
4.
Timany, Amin, et al.. (2024). Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement. Proceedings of the ACM on Programming Languages. 8(POPL). 241–272. 5 indexed citations
5.
Timany, Amin, et al.. (2024). Modular Denotational Semantics for Effects with Guarded Interaction Trees. Proceedings of the ACM on Programming Languages. 8(POPL). 332–361. 7 indexed citations
6.
Timany, Amin, et al.. (2024). The Logical Essence of Well-Bracketed Control Flow. Proceedings of the ACM on Programming Languages. 8(POPL). 575–603. 1 indexed citations
7.
Pichon-Pharabod, Jean, et al.. (2023). Iris-Wasm: Robust and Modular Verification of WebAssembly Programs. Proceedings of the ACM on Programming Languages. 7(PLDI). 1096–1120. 11 indexed citations
8.
Pereira, Mário, et al.. (2023). Verifying Reliable Network Components in a Distributed Separation Logic with Dependent Separation Protocols. Proceedings of the ACM on Programming Languages. 7(ICFP). 847–877. 6 indexed citations
9.
Birkedal, Lars, et al.. (2023). Melocoton: A Program Logic for Verified Interoperability Between OCaml and C. Proceedings of the ACM on Programming Languages. 7(OOPSLA2). 716–744. 8 indexed citations
10.
Pichon-Pharabod, Jean, et al.. (2023). VMSL: A Separation Logic for Mechanised Robust Safety of Virtual Machines Communicating above FF-A. Proceedings of the ACM on Programming Languages. 7(PLDI). 1438–1462. 2 indexed citations
11.
Birkedal, Lars, et al.. (2022). A Stratified Approach to Löb Induction. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
12.
Tassarotti, Joseph, et al.. (2022). Later credits: resourceful reasoning for the later modality. Proceedings of the ACM on Programming Languages. 6(ICFP). 283–311. 15 indexed citations
13.
Birkedal, Lars, et al.. (2021). Multimodal Dependent Type Theory. Bristol Research (University of Bristol). 15 indexed citations
14.
Timany, Amin, et al.. (2021). Mechanized logical relations for termination-insensitive noninterference. Proceedings of the ACM on Programming Languages. 5(POPL). 1–29. 7 indexed citations
15.
Timany, Amin, et al.. (2021). Distributed causal memory: modular specification and verification in higher-order distributed separation logic. Proceedings of the ACM on Programming Languages. 5(POPL). 1–29. 9 indexed citations
16.
Timany, Amin, et al.. (2021). Efficient and provable local capability revocation using uninitialized capabilities. Proceedings of the ACM on Programming Languages. 5(POPL). 1–30. 20 indexed citations
17.
Timany, Amin & Lars Birkedal. (2021). Reasoning about monotonicity in separation logic. Scopus (Elsevier). 91–104. 8 indexed citations
18.
Bizjak, Aleš & Lars Birkedal. (2018). A model of guarded recursion via generalised equilogical spaces. Theoretical Computer Science. 722. 1–18. 1 indexed citations
19.
Dinsdale-Young, Thomas, et al.. (2017). Caper: automatic verification for fine-grained concurrency. Spiral (Imperial College London). 4 indexed citations
20.
Schwinghammer, Jan, Lars Birkedal, Bernhard Reus, & Hongseok Yang. (2011). Nested Hoare Triples and Frame Rules for Higher-order Store. Logical Methods in Computer Science. Volume 7, Issue 3. 8 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026