Probabilistic Output Analyses for Deterministic Programs — Reusing Existing Non-probabilistic Analyses

Maja Hanne Kirkeby
(Computer Science, Roskilde University, Denmark)

We consider reusing established non-probabilistic output analyses (either forward or backwards) that yield over-approximations of a program's pre-image or image relation, e.g., interval analyses. We assume a probability measure over the program input and present two techniques (one for forward and one for backward analyses) that both derive upper and lower probability bounds for the output events. We demonstrate the most involved technique, namely the forward technique, for two examples and compare their results to a cutting-edge probabilistic output analysis.

In Alessandro Aldini and Herbert Wiklicky: Proceedings 16th Workshop on Quantitative Aspects of Programming Languages and Systems (QAPL 2019), Prague, Czech Republic, 7th April 2019, Electronic Proceedings in Theoretical Computer Science 312, pp. 43–57.
Published: 20th January 2020.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: