Syntactic Partial Order Compression for Probabilistic Reachability
No abstract available.
Related papers
- Modeling Reachability Types with Logical Relations: Semantic Type Soundness, Termination, Effect Safety, and Equational Theory OOPSLA 2025
- On Model-Checking Higher-Order Effectful Programs POPL 2024
- Efficient Probabilistic Model Checking for Relational Reachability CAV 2025
- Probabilistic Total Store Ordering ESOP 2022
- Code Optimization for Code Compression CGO 2003
- Playing Games with Your PET: Extending the Partial Exploration Tool to Stochastic Games CAV 2024
- Model Checking Finite-Horizon Markov Chains with Probabilistic Inference CAV 2021
- Partial Order Aware Concurrency Sampling CAV 2018