Georg Moser
where else to find them
no profile links on file
what they talk about
where they keep going back
- OOPSLA2 editions2020–2024
on a stage with
all 6 in the filters
who talks about the same things
- Martin Avanzini4 talks
- Michael Schaper2 talks
- Benjamin Gregoire6 talks
- Gabriele Vanoni7 talks
- Gilles Barthe17 talks
- Benjamin Lucien Kaminski14 talks
| title | conference | date |
|---|---|---|
| Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security(…) | OOPSLA 2024 | 2024-10-20 |
Proposes a EHL + pRHL hopping rule that reduces expectation-based proof goals to related programs, implements it inside EasyCrypt integration, and proves… | ||
| Semantic foundations of potential-synthesis for expected amortised-cost analysis | HOPE 2023 | 2023-09-04 |
Ongoing work builds a semantic stack that synthesises potential functions for randomized data structures and guarantees amortised-cost bounds correct by… | ||
| Automated Expected Value Analysis of Recursive Programs | PLDI 2023 | 2023-06-17 |
Defines infer[.], a term representation that translates weakest pre-expectation semantics for recursive, imperative probabilistic programs into first-order… | ||
| A Modular Cost Analysis for Probabilistic Programs | OOPSLA 2020 | 2020-11-15 |
Presents a modular method that derives symbolic upper bounds on expected resource cost for probabilistic imperative programs by combining the ERT-calculus with… | ||
| nothing matches | ||