Verifying Sampling Algorithms via Distributional Invariants
By: Kevin Batz , Joost-Pieter Katoen , Tobias Winkler and more
Potential Business Impact:
Proves computer programs that use randomness work right.
This paper develops a verification framework aimed at establishing the correctness of discrete sampling algorithms. We do so by considering probabilistic programs as distribution transformers. Inspired by recent work on distributional verification of Markov models, we introduce the notion of (inductive) distributional loop invariants for discrete probabilistic programs. These invariants are embedded in a Hoare-like verification framework that includes proof rules for total and partial correctness. To illustrate the applicability of our framework, we prove the correctness of two discrete sampling algorithms: the Fast Dice Roller and the Fast Loaded Dice Roller.
Similar Papers
Instance Dependent Testing of Samplers using Interval Conditioning
Data Structures and Algorithms
Tests AI samplers much faster, even for infinite data.
Approximate Algorithms for Verifying Differential Privacy with Gaussian Distributions
Cryptography and Security
Checks if private data stays secret.
Interactive Proofs For Distribution Testing With Conditional Oracles
Computational Complexity
Tests computer data faster by letting it ask smarter questions.