A Work-Efficient Distributed Algorithm for Reachability Analysis
Abstract elided by the publisher.
Related papers
- Efficient algorithms for dynamic bidirected Dyck-reachability POPL 2022
- QSM-Cutoff: Systematic Derivation of Quantified Cutoff Formulas for Distributed Protocols CAV 2025
- Efficient subcubic alias analysis for C OOPSLA 2014
- Efficient Algorithms for pre* and post* on Interprocedural Parallel Flow Graphs POPL 2000
- Type-base flow analysis: from polymorphic subtyping to CFL-reachability POPL 2001
- Optimal Time-Bounded Reachability Analysis for Concurrent Systems TACAS 2019
- Context-Free Language Reachability via Efficient Relation Chaining OOPSLA 2026
- On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability POPL 2024