Prakash Saivasan
where else to find them
no profile links on file
what they talk about
where they keep going back
- POPL2 editions2021–2026
on a stage with
all 8 in the filters
who talks about the same things
- K. Narayan Kumar2 talks
- Mohamed Faouzi Atig5 talks
- Ahmed Bouajjani3 talks
- Parosh Aziz Abdulla9 talks
- Ramanathan S. Thinniyam5 talks
- Georg Zetzsche6 talks
| title | conference | date |
|---|---|---|
| Parametrised Verification of Intel-x86 Programs | POPL 2026 | 2026-01-11 |
Proves that k‑alternation bounded reachability for Intel eTSO is decidable even when the number of identical threads is unbounded, overcoming the need to refer… | ||
| 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… | ||
| Deciding Reachability under Persistent x86-TSO | POPL 2021 | 2021-01-17 |
Shows that reachability for the persistent x86-TSO (Px86) model is decidable reachability by giving a new semantics equivalent to Raad et al.’s Px86 that is a… | ||
| nothing matches | ||