Umang Mathur
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
- OOPSLA2 editions2018–2025
all 5 in the filters
on a stage with
all 30 in the filters
who talks about the same things
- Andreas Pavlogiannis18 talks
- Mahesh Viswanathan7 talks
- Minjian Zhang3 talks
- Viktor Vafeiadis23 talks
- Jeehoon Kang14 talks
- Rupak Majumdar21 talks
| title | conference | date |
|---|---|---|
| State Space Estimation for DPOR-Based Model Checkers | PLDI 2026 | 2026-06-15 |
Proves counting Mazurkiewicz classes is #P-hard and inapproximable, then builds a polynomial‑time Monte Carlo estimator by turning an optimal stateless DPOR… | ||
| Fixed Parameter Tractable Linearizability Monitoring | PLDI 2026 | 2026-06-15 |
Claims that linearizability monitoring is fixed‑parameter tractable parameterized by number of processes k for stacks, queues, priority queues and maps, giving… | ||
| Counting and Sampling Traces in Regular Languages | POPL 2026 | 2026-01-11 |
Problem: count Mazurkiewicz traces of length n that intersect a regular language presented as an m‑state automaton; hardness: exact counting is #P‑hard already… | ||
| 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… | ||
| Efficient Decrease-And-Conquer Linearizability Monitoring | OOPSLA 2025 | 2025-10-16 |
Presents a decrease-and-conquer framework that reduces linearizability monitoring to finding linearizability-preserving values, proving polynomial-time… | ||
| Efficient Timestamping for Sampling-Based Race Detection | PLDI 2025 | 2025-06-16 |
Proposes a sampling-aware timestamp scheme that replaces full vector-clock updates with a freshness timestamp and an ordered vector clock data structure… | ||
| Program Skeletons for Automated Program Translation | PLDI 2025 | 2025-06-16 |
Proposes program skeletons that split a Python program into a mechanically converted skeleton and code fragments synthesized by LLMs, implements prototype SKEL… | ||
| The Decision Problem for Regular First Order Theories | POPL 2025 | 2025-01-19 |
Work shows decidability for satisfiability of regular sets of first‑order formulae hinges on concrete bounds and automata encodings: tree automata represent… | ||
| Formal Methods to Save the Earth | PROPL 2024 | 2024-01-20 |
Computes a deductive program logic called Power Logic with small-step operational semantics that separate instantaneous vs lasting energy and model a footprint… | ||
| Rooting for Efficiency: Mechanised Reasoning about Array-Based Trees in Separatio... | CPP 2024 | 2024-01-15 |
Provides a library of definitions, lemmas and proof rules that let one switch between array and tree views (mutually derivable) to localize updates, formalizes… | ||
| Predictive Monitoring against Pattern Regular Languages | POPL 2024 | 2024-01-14 |
Shows a conditional hardness result: predictive monitoring against regular languages requires at least O(n^α) lower bound time under fine-grained assumptions… | ||
| Coarser Equivalences for Causal Concurrency | POPL 2024 | 2024-01-14 |
Proves a linear space lower bound for deciding causal concurrency under the fullest reads‑from style relaxation, shows classic trace/commutativity lets the… | ||
| 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… | ||
| 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… | ||
| Dynamic Race Detection with O(1) Samples | POPL 2023 | 2023-01-15 |
Claims a randomized, one-sided property tester that samples O(1) samples (constant many events when thread and lock counts are fixed) and runs FastTrack on… | ||
| 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… | ||
| What happens-after the first race? enhancing the predictive power of dynamic race detection | OOPSLA 2018 | 2018-11-07 |
Proposes schedulable happens-before (SHB), a partial order that exactly characterizes which HB-unordered conflicting accesses are actually schedulable races… | ||
| nothing matches | ||