A Type System for Reachability and Acyclicity
No abstract available.
Related papers
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints TACAS 2020
- Fast Computation of Conditional Probabilities in MDPs and Markov Chain Families CAV 2026
- DAG inlining: a decision procedure for reachability-modulo-theories in hierarchical programs PLDI 2015
- Local Model-Checking of Modal Mu-Calculus on Acyclic Labeled Transition Systems TACAS 2002
- Modular verification of heap reachability properties in separation logic OOPSLA 2019
- Maximizing the Conditional Expected Reward for Reaching the Goal TACAS 2017
- Transforming Acyclic Programs TOPLAS 1994
- Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic ESOP 2017