A Kleene algebra with tests for union bound reasoning about probabilistic programs
Résumé
Kleene Algebra with Tests (KAT) provides a framework for algebraic equational reasoning about imperative programs. The recent variant Guarded KAT (GKAT) allows to reason on non-probabilistic properties of probabilistic programs. Here we introduce an extension of this framework called approximate GKAT (aGKAT), which equips GKAT with a partially ordered monoid (real numbers) enabling to express satisfaction of (deterministic) properties except with a probability up to a certain bound. This allows to represent in equational reasoning ` a la KAT’ proofs of probabilistic programs based on the union bound, a technique from basic probability theory. We show how a propositional variant of approximate Hoare Logic (aHL), a program logic for union bound, can be soundly encoded in our system aGKAT. We then illustrate the use of aGKAT with an example of accuracy analysis from the field of differential privacy.
Mots clés
- Kleene algebras with tests
- Kleene algebras with tests Hoare logic equational reasoning probabilistic programs union bound formal verification
- Theory of computation → Hoare logic
- Hoare logic
- equational reasoning
- probabilistic programs
- union bound
- formal verification
- Theory of computation → Algebraic semantics
- Theory of computation → Pre- and post-conditions
- Theory of computation → Logic and verification
Domaines
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|---|
| Licence |