Rupak Majumdar
where else to find them
what they talk about
all 7 in the filters
where they keep going back
- POPL6 editions2021–2026
- OOPSLA3 editions2020–2025
- PLDI Workshop Honoring Andreas Podelski3 editions2022–2026
on a stage with
all 28 in the filters
who talks about the same things
- Constantin Enea14 talks
- V.R. Sathiyanarayana3 talks
- Krishnendu Chatterjee11 talks
- Benjamin Lucien Kaminski14 talks
- Joost-Pieter Katoen14 talks
- Michalis Kokologiannakis12 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… | ||
| Verifying Almost-Sure Termination for Randomized Distributed Algorithms | POPL 2026 | 2026-01-11 |
Presents a sound proof rule that combines martingale-based arguments with reasoning about weak fairness and produces SMT-based proofs for almost-sure… | ||
| Model-guided Fuzzing of Distributed Systems | OOPSLA 2025 | 2025-10-16 |
An implementation of a fuzzer for TLA+ models drives scheduler-controlled seed schedules into real systems, maps runtime events to model actions, and uses TLA+… | ||
| Sound and Complete Proof Rules for Probabilistic Termination | POPL 2025 | 2025-01-19 |
Presents sound and relatively complete proof rules for qualitative and quantitative termination of imperative programs with discrete probabilistic choice and… | ||
| Model Checking Distributed Protocols in Must | OOPSLA 2024 | 2024-10-20 |
Must is a bounded model checker that verifies real distributed implementations by instrumenting a mainstream language (example: Rust) with a tiny concurrency… | ||
| Reward Augmentation in Reinforcement Learning for Testing Distributed Systems | OOPSLA 2024 | 2024-10-20 |
Paper proposes using reinforcement learning to bias randomized testing of real consensus implementations, implemented in Go, by adding a decaying exploration… | ||
| Model Checking Distributed Software Systems | PLDI 2024 Workshop Honoring Andreas Podelski | 2024-06-25 |
An implementation-level model checker called Must embeds a small message-passing DSL in Rust and exhaustively explores nonisomorphic execution graphs with… | ||
| Positive Almost-Sure Termination – Complexity and Proof Rules | POPL 2024 | 2024-01-14 |
Shows that Positive Almost-Sure Termination (PAST) for an imperative language with rational variables, bounded nondeterministic choice and discrete… | ||
| Reachability in Continuous Pushdown VASS | POPL 2024 | 2024-01-14 |
Proves reachability and even coverability for pushdown VASS with continuous semantics (counters are rationals scaled by any factor in (0,1]) is… | ||
| Context-Bounded Verification of Context-Free Specifications | POPL 2023 | 2023-01-15 |
Shows that context-bounded refinement where the implementation is a multistack pushdown automaton and the specification is a Dyck or input‑deterministic… | ||
| Business Meeting - PLDI 2022 | PLDI 2022 | 2022-06-13 |
PLDI 2022 reports concrete process changes: a single flat PC of 120 with four area chairs, no full PC meeting, and asynchronous discussion; paper assignment… | ||
| Context-Bounded Verification of Thread Pools | POPL 2022 | 2022-01-16 |
The work proves safety for thread-pooled Boolean programs with per-task context bound k and pool size n (both given in binary) is EXPSPACE-complete, while… | ||
| Subcubic Certificates for CFL Reachability | POPL 2022 | 2022-01-16 |
Claims existence of O(n^2) certificates for both yes and no instances of Dyck-2/CFL reachability, where positive certificates use grammar-based compression of… | ||
| Numbers, Logic, and Decidability for Cyber-Physical Systems | POPL 2021 | 2021-01-17 |
Encoding bounded-time reachability for linear ODEs into the first-order theory of the reals reduces the verification problem to satisfiability in a logic with… | ||
| Context-Bounded Verification of Liveness for Multithreaded Shared-Memory Programs | POPL 2021 | 2021-01-17 |
Shows that K‑context‑bounded fair termination for recursive multithreaded shared‑memory programs is decidable by reducing to reachability in Petri nets… | ||
| Testing Consensus Implementations using Communication Closure | OOPSLA 2020 | 2020-11-15 |
Presents a randomized tester that exploits communication closure to sample k-periodic uniform lossy synchronous executions instead of all asynchronous… | ||
| Interactive Synthesis of Temporal Specifications from Examples and Natural Language | OOPSLA 2020 | 2020-11-15 |
LTLTalk synthesizes co-safe LTL specifications from one natural-language command plus a single demonstration by encoding structure and semantics as an SMT… | ||
| Multiparty Motion Coordination: From Choreographies to Robotics Programs | OOPSLA 2020 | 2020-11-15 |
Combines multiparty session types with assume‑guarantee reasoning to avoid exponential state blowup and statically verify choreographies of robots; a Python… | ||
| nothing matches | ||