1. Ranking and Repulsing Supermartingales for Reachability in Randomized Programs.
- Author
-
TORU TAKISAKA, YUICHIRO OYABU, NATSUKI URABE, and ICHIRO HASUO
- Subjects
- *
MARTINGALES (Mathematics) , *SCIENTIFIC computing , *COMPUTER science , *PROBABILITY theory , *ALGORITHMS - Abstract
Computing reachability probabilities is a fundamental problem in the analysis of randomized programs. This article aims at a comprehensive and comparative account of various martingale-based methods for over- and under-approximating reachability probabilities. Based on the existingworks that stretch across different communities (formal verification, control theory, etc.), we offer a unifying account. In particular, we emphasize the role of order-theoretic fixed points--a classic topic in computer science--in the analysis of randomized programs. This leads us to two new martingale-based techniques, too. We also make an experimental comparison using our implementation of template-based synthesis algorithms for those martingales. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF