Parosh Aziz Abdulla
where else to find them
no profile links on file
what they talk about
all 6 in the filters
where they keep going back
- POPL3 editions2021–2026
- PLDI Workshop Honoring Andreas Podelski2 editions2023–2025
all 5 in the filters
on a stage with
all 28 in the filters
who talks about the same things
- Ahmed Bouajjani3 talks
- Prakash Saivasan3 talks
- Mohamed Faouzi Atig5 talks
- K. Narayan Kumar2 talks
- Azalea Raad27 talks
- Viktor Vafeiadis23 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… | ||
| Parameterized Verification of Quantum Circuits | POPL 2026 | 2026-01-11 |
Presents a fully automatic framework that verifies relational properties of size‑parameterized quantum programs by modeling infinite families of quantum states… | ||
| 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)… | ||
| An Automata-based Framework for Quantum Circuit Verification | PLanQC 2025 | 2025-01-25 |
Framework encodes sets of quantum basis trees as tree automata (BDD-like tries) and implements gate updates symbolically — X swaps left/right branches, S… | ||
| Verifying Quantum Circuits with Level-Synchronized Tree Automata | POPL 2025 | 2025-01-19 |
Introduces level-synchronized tree automata that label transitions with joint choices to synchronize different tree branches, enabling a symbolic encoding of… | ||
| Boosting Constrained Horn Solving by Unsat Core Learning | VMCAI 2024 | 2024-01-15 |
Built a relational hyper‑graph neural network called R-HyGNN and a framework MUSHyperNet that predicts Minimal Unsatisfiable Subsets (MUSes) of Constrained… | ||
| 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… | ||
| Solving Not-Substring with Flat Abstraction | APLAS 2021 | 2021-10-17 |
Proposes a concrete CEGAR-based method using flat abstraction that encodes non-substring into linear integer (Presburger) constraints and implements it in a… | ||
| 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 | ||