P^5 : Planner-less Proofs of Probabilistic Parameterized Protocols
Abstract elided by the publisher.
Related papers
- Probabilistic Bisimulation for Parameterized Systems - (with Applications to Verifying Anonymous Protocols) CAV 2019
- GenSQL: A Probabilistic Programming System for Querying Generative Models of Database Tables PLDI 2024
- Fair Termination for Parameterized Probabilistic Concurrent Systems TACAS 2017
- Mechanizing the CMP Abstraction for Parameterized Verification OOPSLA 2024
- Trace abstraction modulo probability POPL 2019
- Verifying Almost-Sure Termination for Randomized Distributed Algorithms POPL 2026
- Automatic Verification of Parameterized Cache Coherence Protocols CAV 2000
- Automated Inductive Verification of Parameterized Protocols CAV 2001