Automatic Verification of Probabilistic Free Choice
No abstract available.
Related papers
- Scalable verification of probabilistic networks PLDI 2019
- noDice: Inference for Discrete Probabilistic Programs with Nondeterminism and Conditioning OOPSLA 2026
- On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem POPL 1981
- Exact Bayesian Inference for Loopy Probabilistic Programs using Generating Functions OOPSLA 2024
- PRISM: A Tool for Automatic Verification of Probabilistic Systems TACAS 2006
- Deployable probabilistic programming Onward! 2019
- Programmatic Strategy Synthesis: Resolving Nondeterminism in Probabilistic Programs POPL 2024
- Tuning Random Generators: Property-Based Testing as Probabilistic Programming OOPSLA 2025