Efficient Analysis of Probabilistic Programs with an Unbounded Counter
Abstract elided by the publisher.
Related papers
- A model counter for constraints over unbounded strings PLDI 2014
- Engineering an Efficient Probabilistic Exact Model Counter CAV 2025
- On the Almost-Sure Termination of Probabilistic Counter Programs CAV 2025
- Cost analysis of nondeterministic probabilistic programs PLDI 2019
- Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata CAV 2013
- Counters in Kappa: Semantics, Simulation, and Static Analysis ESOP 2019
- Does a Program Yield the Right Distribution? - Verifying Probabilistic Programs via Generating Functions CAV 2022
- Probabilistic Concurrent Reasoning in Outcome Logic: Independence, Conditioning, and Invariants POPL 2026