Binary Reachability Analysis of Discrete Pushdown Timed Automata
Abstract elided by the publisher.
Related papers
- Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks CAV 2001
- Revisiting Underapproximate Reachability for Multipushdown Systems TACAS 2020
- Fast Zone-Based Algorithms for Reachability in Pushdown Timed Automata CAV 2021
- Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration TACAS 2023
- ML, Visibly Pushdown Class Memory Automata, and Extended Branching Vector Addition Systems with States TOPLAS 2019
- POPACheck: A Model Checker for Probabilistic Pushdown Automata CAV 2025
- Reachability in Continuous Pushdown VASS POPL 2024
- Static Analysis of Multithreaded Recursive Programs Communicating via Rendez-Vous APLAS 2017