Krishna Shankaranarayanan
where else to find them
no profile links on file
what they talk about
where they keep going back
- PLDI Workshop Honoring Andreas Podelski2 editions2023–2025
on a stage with
all 10 in the filters
who talks about the same things
- Andreas Pavlogiannis18 talks
- Parosh Aziz Abdulla9 talks
- Umang Mathur20 talks
- V Krishna Nandivada8 talks
- Kartik Nagar6 talks
- Hünkar Can Tunç3 talks
| title | conference | date |
|---|---|---|
| Efficient Linearizability Monitoring | PLDI 2025 | 2025-06-16 |
Revisits monitoring linearizability for stacks queues and (multi)sets and gives concrete algorithms with proven complexities: stacks O(n^2), queues O(n log n)… | ||
| On-The-Fly Static Analysis via Dynamic Bidirected Dyck Reachability | POPL 2024 | 2024-01-14 |
Provides a dynamic algorithm for bidirected Dyck reachability with worst-case O(n·α(n)) per update (beating the prior O(n2) worst case), implements it, and… | ||
| Optimal Reads-From Consistency Checking for C11-Style Memory Models | PLDI 2023 | 2023-06-17 |
Characterizes reads-from consistency for C11 variants and gives concrete algorithms and hardness results: introduces a minimal coherence witness to avoid… | ||
| Verification of Concurrent Programs under Release-Acquire Concurrency | APLAS 2022 | 2022-12-05 |
Shows that reachability under release‑acquire is undecidable for finite‑state programs by a PCP reduction using four threads that guess and verify sequences… | ||
| nothing matches | ||