Probabilistic predicates generalize standard predicates over a state space; with probabilistic predicate transformers one thus reasons about imperative programs in terms of probabilistic pre- and postconditions. Probabilistic healthiness conditions generalize the standard ones, characterizing “real ” probabilistic programs, and are based on a connection with an underlying relational model for probabilistic execution; in both contexts demonic nondeterminism coexists with probabilistic choice. With the healthiness conditions, the associated weakest-precondition calculus seems suitable for exploring the rigorous derivation of small probabilistic programs
We study quantitative reasoning about probabilistic programs. In doing so, we investigate two main a...
Hoare logic can be used to verify properties of deterministic programs by deriving correctness formu...
AbstractIn this paper, we investigate the semantic intricacies of conditioning in probabilistic prog...
Probabilistic predicate transformers guarantee standard (ordinary) predicate transformers to incorpo...
Predicate transformers facilitate reasoning about imperative programs, including those exhibiting de...
Probabilistic predicate transformers provide a semantics for imperative programs containing both dem...
Probabilistic predicate transformers provide a semantics for imperative programs containing both dem...
We introduce a notion of strong monotonicity of probabilistic predicate transformers. This notion en...
grantor: University of TorontoThe incorporation of probability into several theories of p...
grantor: University of TorontoThe incorporation of probability into several theories of p...
We present an encoding of the semantics of the probabilistic guarded command language (pGCL) in the ...
. Action systems were originally proposed for the design of parallel and distributed systems in a st...
The behavior of a program can be modeled by describing how it transforms input states to output stat...
Probability, be it inherent or explicitly introduced, has become an important issue in the verificat...
In this paper, we investigate the semantic intricacies of conditioning in probabilistic programming,...
We study quantitative reasoning about probabilistic programs. In doing so, we investigate two main a...
Hoare logic can be used to verify properties of deterministic programs by deriving correctness formu...
AbstractIn this paper, we investigate the semantic intricacies of conditioning in probabilistic prog...
Probabilistic predicate transformers guarantee standard (ordinary) predicate transformers to incorpo...
Predicate transformers facilitate reasoning about imperative programs, including those exhibiting de...
Probabilistic predicate transformers provide a semantics for imperative programs containing both dem...
Probabilistic predicate transformers provide a semantics for imperative programs containing both dem...
We introduce a notion of strong monotonicity of probabilistic predicate transformers. This notion en...
grantor: University of TorontoThe incorporation of probability into several theories of p...
grantor: University of TorontoThe incorporation of probability into several theories of p...
We present an encoding of the semantics of the probabilistic guarded command language (pGCL) in the ...
. Action systems were originally proposed for the design of parallel and distributed systems in a st...
The behavior of a program can be modeled by describing how it transforms input states to output stat...
Probability, be it inherent or explicitly introduced, has become an important issue in the verificat...
In this paper, we investigate the semantic intricacies of conditioning in probabilistic programming,...
We study quantitative reasoning about probabilistic programs. In doing so, we investigate two main a...
Hoare logic can be used to verify properties of deterministic programs by deriving correctness formu...
AbstractIn this paper, we investigate the semantic intricacies of conditioning in probabilistic prog...