Reasoning about recursive probabilistic programs
This paper presents a wp--style calculus for obtaining expectations on the outcomes of
(mutually) recursive probabilistic programs. We provide several proof rules to derive one …
(mutually) recursive probabilistic programs. We provide several proof rules to derive one …
Advanced weakest precondition calculi for probabilistic programs
BL Kaminski - 2019 - discovery.ucl.ac.uk
Wir studieren die quantitative Analyse probabilistischer Programme. Dabei untersuchen wir
vornehmlich zwei Aspekte: Die Analysetechniken selbst, sowie die komplexitäts-bzw …
vornehmlich zwei Aspekte: Die Analysetechniken selbst, sowie die komplexitäts-bzw …
Conditioning in probabilistic programming
This article investigates the semantic intricacies of conditioning, a main feature in
probabilistic programming. Our study is based on an extension of the imperative …
probabilistic programming. Our study is based on an extension of the imperative …
Aiming low is harder: induction for lower bounds in probabilistic program verification
We present a new inductive rule for verifying lower bounds on expected values of random
variables after execution of probabilistic loops as well as on their expected runtimes. Our …
variables after execution of probabilistic loops as well as on their expected runtimes. Our …
Probabilistic guarded commands mechanized in HOL
The probabilistic guarded-command language (pGCL) contains both demonic and
probabilistic non-determinism, which makes it suitable for reasoning about distributed …
probabilistic non-determinism, which makes it suitable for reasoning about distributed …
PMAF: an algebraic framework for static analysis of probabilistic programs
D Wang, J Hoffmann, T Reps - ACM SIGPLAN Notices, 2018 - dl.acm.org
Automatically establishing that a probabilistic program satisfies some property ϕ is a
challenging problem. While a sampling-based approach—which involves running the …
challenging problem. While a sampling-based approach—which involves running the …
Mixed powerdomains for probability and nondeterminism
K Keimel, GD Plotkin - Logical Methods in Computer Science, 2017 - lmcs.episciences.org
We consider mixed powerdomains combining ordinary nondeterminism and probabilistic
nondeterminism. We characterise them as free algebras for suitable (in) equation-al …
nondeterminism. We characterise them as free algebras for suitable (in) equation-al …
Semantic domains for combining probability and non-determinism
We present domain-theoretic models that support both probabilistic and nondeterministic
choice. In [A. McIver and C. Morgan. Partial correctness for probablistic demonic programs …
choice. In [A. McIver and C. Morgan. Partial correctness for probablistic demonic programs …
Lower bounds for possibly divergent probabilistic programs
S Feng, M Chen, H Su, BL Kaminski… - Proceedings of the …, 2023 - dl.acm.org
We present a new proof rule for verifying lower bounds on quantities of probabilistic
programs. Our proof rule is not confined to almost-surely terminating programs--as is the …
programs. Our proof rule is not confined to almost-surely terminating programs--as is the …
Proof rules for the correctness of quantum programs
We apply the notion of quantum predicate proposed by D'Hondt and Panangaden to
analyze a simple language fragment which may describe the quantum part of a future …
analyze a simple language fragment which may describe the quantum part of a future …