Beating Rytter's Bound: All-Pairs CFL Reachability in O(n3( n)2/( n)2) Time
Rupak Majumdar
Abstract
Context-free reachability and 2NPDA recognition are fundamental problems in program analysis and language theory. Despite years of effort, the best algorithms for these problems run in time O(n3/ n) on a word RAM model; they are based on an observation of Rytter in 1985 for 2NPDA which was adapted for CFL reachability by Chaudhuri in 2008. No better algorithm has been designed since. We give the first improvement to Rytter's algorithm. For both all-pairs context-free reachability and 2NPDA recognition, we show a deterministic algorithm running in O(n3( n)2/( n)2) time and O(n2+ε) words of space for every fixed 0<ε<1 on a word RAM. Our improvement is based on a new data structure that reports set differences using batched maintenance of exact intersection counts, allowing saturation to skip regions that contain no new reachability information.
Create a lesson
Related papers
You Have Mail: Set-Theoretic Types for Actors
Giuseppe Castagna, Luca Padovani, Daniele Varacca et al.
Sightline: Calibrated Data-Flow Summaries for LLM-Integrated Applications
Zihao Xu, Yuekang Li, Ruitao Feng et al.
Tenon: A Unified Programming Framework for Retargetable PIM Compilation
Niansong Zhang, Shiran Guo, Zhiru Zhang
Mode Inference for Substructural Adjoint Types
Sophia Roshal, Frank Pfenning
A Principled Approach to Concurrency, Nondeterminism, and Asynchrony in Choreographies
Xueying Qin, Marco Peressotti, Fabrizio Montesi
Validating Concurrent Correctness Witnesses with Ghosts by Thread-Modular Abstract Interpretation
Michael Schwarz, Zhendong Ang, Umang Mathur