Krishnendu Chatterjee
where else to find them
no profile links on file
what they talk about
where they keep going back
- PLDI Workshop Honoring Andreas Podelski2 editions2024–2026
- OOPSLA2 editions2021–2024
on a stage with
all 9 in the filters
who talks about the same things
- Đorđe Žikelić3 talks
- Andreas Pavlogiannis18 talks
- Rupak Majumdar21 talks
- Joseph Tassarotti20 talks
- Joost-Pieter Katoen14 talks
- Benjamin Lucien Kaminski14 talks
| title | conference | date |
|---|---|---|
| SuperDP: Differential Privacy Refutation via Supermartingales | PLDI 2026 | 2026-06-15 |
Method claims automated, sound refutation of ε‑DP by searching for a pair of inputs and a nonnegative output function whose expectations violate the ε bound… | ||
| Quantitative Bounds on Resource Usage of Probabilistic Programs | OOPSLA 2024 | 2024-10-20 |
Extends cost supermartingales to yield sound expectation bounds for programs with positive and negative costs and unbounded updates provided a lower bounded… | ||
| Equivalence and Similarity Refutation for Probabilistic Programs | PLDI 2024 | 2024-06-24 |
Searches for a concrete output function f and automated certificates—an upper expectation supermartingale for one program and a lower expectation submartingale… | ||
| The Reads-From Equivalence for the TSO and PSO Memory Models | OOPSLA 2021 | 2021-10-17 |
Presents algorithms that decide reads-from (RF) consistency for TSO and PSO with explicit complexity: n^{k+1} bound for TSO and n^{k+1}·min(n^{k^2},2^{k·d})… | ||
| nothing matches | ||