Affiliation:
1. Pennsylvania State University, University Park, PA
Abstract
We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in slightly subcubic time. All that is necessary for the new bound is a simple adaptation of a known technique. We also show that a better algorithm exists if the input machine does not have infinite recursive loops.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference26 articles.
1. Model checking of hierarchical state machines
2. Analysis of recursive state machines
3. On economical construction of the transitive closure of an oriented graph;Arlazarov V. L.;Soviet Mathematics Doklady,1970
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability;Proceedings of the ACM on Programming Languages;2024-01-05
2. Recursive State Machine Guided Graph Folding for Context-Free Language Reachability;Proceedings of the ACM on Programming Languages;2023-06-06
3. Taming transitive redundancy for context-free language reachability;Proceedings of the ACM on Programming Languages;2022-10-31
4. CFL/Dyck Reachability;ACM SIGLOG News;2022-10
5. The Complexity of Bidirected Reachability in Valence Systems;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02