Marcel Moosbrugger
where else to find them
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
- Laura Kovács2×
- Ezio Bartoccionce
- Julian Müllneronce
all 4 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants f... | POPL 2024 | 2024-01-14 |
Proves that computing the strongest polynomial invariant for single‑path loops with polynomial assignments is Skolem-hard, and that point‑to‑point reachability… | ||
| This Is the Moment for Probabilistic Loops | OOPSLA 2022 | 2022-12-05 |
Static analysis derives exact higher moments for many probabilistic loops, producing closed‑form expressions and tail bounds automatically without templates or… | ||
| nothing matches | ||