Georg Zetzsche
where else to find them
what they talk about
where they keep going back
- POPL5 editions2021–2026
on a stage with
all 10 in the filters
who talks about the same things
- Pascal Baumann4 talks
- Ramanathan S. Thinniyam5 talks
- Moses Ganardi2 talks
- Rupak Majumdar21 talks
- Benjamin Lucien Kaminski14 talks
- Michael Sammler16 talks
| title | conference | date |
|---|---|---|
| Bounded Treewidth, Multiple Context-Free Grammars, and Downward Closures | POPL 2026 | 2026-01-11 |
Proves that the word languages of MSO-definable bounded-stw = multiple context-free languages by translating bounded-treewidth run graphs to tree automata and… | ||
| Ramsey Quantifiers in Linear Arithmetics | POPL 2024 | 2024-01-14 |
Proves an elimination procedure for Ramsey quantifiers over Linear Integer, Real, and mixed arithmetic (LIA, LRA, LIRA) that, for existential input formulas… | ||
| Reachability in Continuous Pushdown VASS | POPL 2024 | 2024-01-14 |
Proves reachability and even coverability for pushdown VASS with continuous semantics (counters are rationals scaled by any factor in (0,1]) is… | ||
| Context-Bounded Verification of Context-Free Specifications | POPL 2023 | 2023-01-15 |
Shows that context-bounded refinement where the implementation is a multistack pushdown automaton and the specification is a Dyck or input‑deterministic… | ||
| Context-Bounded Verification of Thread Pools | POPL 2022 | 2022-01-16 |
The work proves safety for thread-pooled Boolean programs with per-task context bound k and pool size n (both given in binary) is EXPSPACE-complete, while… | ||
| Context-Bounded Verification of Liveness for Multithreaded Shared-Memory Programs | POPL 2021 | 2021-01-17 |
Shows that K‑context‑bounded fair termination for recursive multithreaded shared‑memory programs is decidable by reducing to reachability in Petri nets… | ||
| nothing matches | ||