ML and Extended Branching VASS
No abstract available.
Related papers
- Reachability in Continuous Pushdown VASS POPL 2024
- An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract) CAV 1994
- ML, Visibly Pushdown Class Memory Automata, and Extended Branching Vector Addition Systems with States TOPLAS 2019
- A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis CAV 2014
- Context-bounded verification of liveness properties for multithreaded shared-memory programs POPL 2021
- Data flow fusion with series expressions in Haskell Haskell 2013
- Modalities for Model Checking: Branching Time Strikes Back POPL 1985
- Branching Bisimulation Learning CAV 2025