Simon Oddershede Gregersen
where else to find them
website:https://simongregersen.com
github:simongregersen
bluesky:simongregersen.com
bluesky:simongregersen.bsky.social
what they talk about
all 4 in the filters
where they keep going back
- POPL3 editions2021–2025
all 4 in the filters
on a stage with
all 12 in the filters
who talks about the same things
- Philipp G. Haselwarter6 talks
- Kwing Hei Li6 talks
- Alejandro Aguirre10 talks
- Joseph Tassarotti20 talks
- Lars Birkedal35 talks
- Amin Timany16 talks
| title | conference | date |
|---|---|---|
| Modular Verification of Differential Privacy in Probabilistic Higher-Order Separation(…) | PLDI 2026 | 2026-06-15 |
Claims a program logic that encodes privacy budget as resource inside a probabilistic higher-order separation logic, proves an adequacy theorem linking the… | ||
| Modular Reasoning about Error Bounds for Concurrent Probabilistic Programs | ICFP 2025 | 2025-10-12 |
Presents Coneris, the first higher-order concurrent separation logic that proves numeric error bounds for concurrent probabilistic programs and mechanizes all… | ||
| Approximate Relational Reasoning for Higher-Order Probabilistic Programs | POPL 2025 | 2025-01-19 |
Describes Approxis, a higher-order separation logic that treats error credits as first-class resources to prove approximate program refinements for an ML-like… | ||
| Tachis: Higher-Order Separation Logic with Credits for Expected Costs | OOPSLA 2024 | 2024-10-20 |
Tachis introduces probabilistic cost credits, a separation logic resource that preserves expectation across random branches and lets proofs allocate credits… | ||
| Asynchronous Probabilistic Couplings in Higher-Order Separation Logic | POPL 2024 | 2024-01-14 |
Provides a new higher-order relational separation logic called Clutch that proves contextual refinement for a language with impredicative polymorphism… | ||
| Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intension... | POPL 2024 | 2024-01-14 |
Introduces Trillium as a language-agnostic separation-logic framework that proves intensional refinements between program traces and labeled transition models… | ||
| Distributed Causal Memory for Higher-Order Distributed Separation Logic | POPL 2021 | 2021-01-17 |
Presents the first full specification and machine-checked verification of a causally-consistent distributed database implementation and client libraries… | ||
| Mechanized Logical Relations for Termination-Insensitive Noninterference | POPL 2021 | 2021-01-17 |
Paper proves that a rich information‑flow type system (recursive and existential types, System F impredicative polymorphism, label polymorphism, higher‑order… | ||
| nothing matches | ||