On-the-Fly Reachability and Cycle Detection for Recursive State Machines
No abstract available.
Related papers
- Analysis of recursive state machines TOPLAS 2005
- Iterative-Epoch Online Cycle Elimination for Context-Free Language Reachability OOPSLA 2024
- Complete the Cycle: Reachability Types with Expressive Cyclic References OOPSLA 2025
- Subcubic algorithms for recursive state machines POPL 2008
- An efficient on-the-fly cycle collection TOPLAS 2007
- An Efficient On-the-Fly Cycle Collection CC 2005
- Faster Algorithms for Weighted Recursive State Machines ESOP 2017
- Recursive State Machine Guided Graph Folding for Context-Free Language Reachability PLDI 2023