Subcubic algorithms for recursive state machines
From MaRDI portal
Publication:3189835
DOI10.1145/1328438.1328460zbMath1295.68142OpenAlexW2024779397MaRDI QIDQ3189835
Publication date: 12 September 2014
Published in: Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1328438.1328460
interprocedural analysistransitive closurecontext-free languagespushdown systemsrecursive state machinesCFL-reachabilitycubic bottleneck
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Formal languages and automata (68Q45)
Related Items (4)
Pushdown reachability with constant treewidth ⋮ Faster Algorithms for Weighted Recursive State Machines ⋮ Tight bounds for reachability problems on one-counter and pushdown systems ⋮ The Complexity of Andersen’s Analysis in Practice
This page was built for publication: Subcubic algorithms for recursive state machines
