Andreas Pavlogiannis
where else to find them
no profile links on file
what they talk about
all 6 in the filters
where they keep going back
- POPL5 editions2021–2026
- PLDI Workshop Honoring Andreas Podelski3 editions2023–2026
all 4 in the filters
on a stage with
all 20 in the filters
who talks about the same things
- Umang Mathur20 talks
- Krishnendu Chatterjee11 talks
- Viktor Vafeiadis23 talks
- Mahesh Viswanathan7 talks
- Michalis Kokologiannakis12 talks
- Krishna Shankaranarayanan4 talks
| title | conference | date |
|---|---|---|
| Fast Atomicity Monitoring | PLDI 2026 | 2026-06-15 |
Presents AtomSanitizer, an algorithm for conflict serializability that reduces worst-case time to O(nk^2) by tracking approximate latest-remote and… | ||
| The Complexity of Testing Message-Passing Concurrency | POPL 2026 | 2026-01-11 |
Characterizes channel-consistency as a parameterized complexity landscape: consistency checking is NP-hard even for single-valued or capacity‑one channels, and… | ||
| AWDIT: An Optimal Weak Database Isolation Tester | PLDI 2025 | 2025-06-16 |
AWDIT implemented in Rust tests Read Committed, Read Atomic, and Causal Consistency with proven bounds O(n^{3/2}) for RC/RA, O(n·k) for CC, runs on histories… | ||
| Program Analysis via Multiple Context Free Language Reachability | POPL 2025 | 2025-01-19 |
Introduces MCFL reachability as a tunable, decidable underapproximation for interleaved Dyck (context-sensitive) reachability, implements an algorithm with… | ||
| A Better Approximation for Interleaved Dyck Reachability | SOAP 2024 | 2024-06-25 |
Proposes a concrete overapproximation that extends mutual refinement by adding refined CFLs (grammars that encode parity and endpoint constraints) and an… | ||
| How Hard is Weak-Memory Testing? | POPL 2024 | 2024-01-14 |
Paper proves that consistency testing for many weak-memory models is NP-complete even with bounded threads, memory locations, and values, ruling out… | ||
| 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… | ||
| Sound Dynamic Deadlock Prediction in Linear Time | PLDI 2023 | 2023-06-17 |
Introduces a new class called sync-preserving deadlocks and two algorithms SPDOffline and SPDOnline that detect only those deadlocks but do so with overall… | ||
| 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… | ||
| The Decidability and Complexity of Interleaved Bidirected Dyck Reachability | POPL 2022 | 2022-01-16 |
Proves D1⟂D1 reachability runs in O(n^3 α(n)) time, improving on the prior O(n^7) bound; shows Dk⟂D1 reachability is decidable and its linearly bounded variant… | ||
| 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})… | ||
| Optimal Prediction of Synchronization-Preserving Races | POPL 2021 | 2021-01-17 |
Paper gives a sound and complete algorithm SyncP that predicts synchronization-preserving races and runs in Õ(N) time and space on a trace of length N, with a… | ||
| The Fine-Grained and Parallel Complexity of Andersen's Pointer Analysis | POPL 2021 | 2021-01-17 |
Establishes an O(n^3) optimal algorithm for Andersen-style inclusion-based pointer analysis and a matching Ω(n^3) lower bound for even on-demand queries via a… | ||
| nothing matches | ||