Randomized Algorithms for Program Analysis and Verification
No abstract available.
Related papers
- Ranking and Repulsing Supermartingales for Reachability in Randomized Programs TOPLAS 2021
- Model Checking Indistinguishability of Randomized Security Protocols CAV 2018
- Precise interprocedural analysis using random interpretation POPL 2005
- Measurement-Based Verification of Quantum Markov Chains CAV 2024
- A Program Logic for Concurrent Randomized Programs in the Oblivious Adversary Model ESOP 2025
- Verifying Almost-Sure Termination for Randomized Distributed Algorithms POPL 2026
- Discovering affine equalities using random interpretation POPL 2003
- A Calculus for Amortized Expected Runtimes POPL 2023