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

January 20, 2020 Β· Declared Dead Β· πŸ› QAPL

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Maja Hanne Kirkeby arXiv ID 2001.06943 Category cs.PL: Programming Languages Citations 1 Venue QAPL Last Checked 4 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Programming Languages

Died the same way β€” πŸ‘» Ghosted