Julian Müllner
where else to find them
what they talk about
where they keep going back
no series more than once — all 1 in the filters
on a stage with
- Laura Kovácsonce
- Marcel Moosbruggeronce
who talks about the same things
one talk is not yet a subject
| 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… | ||
| nothing matches | ||