Scholar
Simon Oddershede Gregersen
Google Scholar ID: I-ltakEAAAAJ
Postdoctoral fellow, New York University
Citations & Impact
Citations
194
H-index
7
i10-index
7
Publications
13
Co-authors
0
Resume (English only)
Academic Achievements
- Modular Reasoning about Error Bounds for Concurrent Probabilistic Programs, ICFP 2025
- Logical Relations for Formally Verified Authenticated Data Structures, CCS 2025
- Approximate Relational Reasoning for Higher-Order Probabilistic Programs, POPL 2025
- Tachis: Higher-Order Separation Logic with Credits for Expected Costs, OOPSLA 2024
- Almost-Sure Termination by Guarded Refinement, ICFP 2024
- Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs, ICFP 2024 (Recipient of the ICFP 2024 Distinguished Paper Award)
- Asynchronous Probabilistic Couplings in Higher-Order Separation Logic, POPL 2024
- Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement, POPL 2024
- Mechanized Logical Relations for Termination-Insensitive Noninterference, POPL 2021
Research Experience
- Currently a postdoctoral fellow at the Courant Institute of New York University, working with Joseph Tassarotti. Joining CISPA as tenure-track faculty in January 2026.
Education
- PhD from Aarhus University in 2023, supervised by Amin Timany and Lars Birkedal.
Background
- Research interests: programming languages and program verification. Develop and apply new techniques that make it feasible or easier to build formally verified software systems. Current work focuses on the correctness and security of distributed and randomized systems using techniques such as program logics, separation logic, logical relations, type systems, semantics, and interactive theorem provers.
Miscellany
- Contact: s.gregersen@nyu.edu; CV (October 2025); Currently supported by a fellowship from the Carlsberg Foundation (CF23-0791).
Co-authors