We are concerned with the average case runtime complexity analysis of a prototypical imperative language endowed with primitives for sampling and probabilistic choice. Taking inspiration from known approaches from to the modular resource analysis of non-probabilistic programs, we investigate how a modular runtime analysis is obtained for probabilistic programs.
@article{arxiv.1908.11343,
title = {Modular Runtime Complexity Analysis of Probabilistic While Programs},
author = {Martin Avanzini and Michael Schaper and Georg Moser},
journal= {arXiv preprint arXiv:1908.11343},
year = {2019}
}