A Reduction Theorem for Randomized Distributed Algorithms Under Weak Adversaries
Abstract elided by the publisher.
Related papers
- Provably Good Randomized Strategies for Data Placement in Distributed Key-Value Stores PPoPP 2023
- A Program Logic for Concurrent Randomized Programs in the Oblivious Adversary Model ESOP 2025
- Verifying Almost-Sure Termination for Randomized Distributed Algorithms POPL 2026
- Trace aware random testing for distributed systems OOPSLA 2019
- A Demonic Outcome Logic for Randomized Nondeterminism POPL 2025
- Feature-Guided Black-Box Safety Testing of Deep Neural Networks TACAS 2018
- An Assertion-Based Program Logic for Probabilistic Programs ESOP 2018
- Checking Robustness Between Weak Transactional Consistency Models ESOP 2021