Laura Kovács
where else to find them
no profile links on file
what they talk about
where they keep going back
- OOPSLA2 editions2022–2025
on a stage with
all 10 in the filters
who talks about the same things
- Sharon Shoham13 talks
- Oded Padon11 talks
- Deepak Garg18 talks
- Jon Howell8 talks
- Zachary Kincaid9 talks
- Gilles Barthe17 talks
| title | conference | date |
|---|---|---|
| Divide and Conquer: A Compositional Approach to Game-Theoretic Security | OOPSLA 2025 | 2025-10-16 |
Compositional pipeline reduces game-theoretic blockchain security checks to many small SMT queries instead of one huge one, encoding incentives in first-order… | ||
| 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… | ||
| Satisfiability Modulo Custom Theories in Z3 (Tool Paper) | VMCAI 2023 | 2023-01-15 |
Z3 adds user-propagators: an API to register ground terms and attach callbacks (fixed, equality, instantiate, final) written in C++/Python that can emit… | ||
| 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 | ||