Mar 28, 2008 · The aim of this paper is to extend the probabilistic choice in probabilistic programs to sub-probabilistic choice, i.e., of the form (p)P ...

Abstract The aim of this paper is to extend the probabil- istic choice in probabilistic programs to sub-probabilistic choice, i.e., of the form pš ŽPj qš ŽQ ...

This paper presents two equivalent semantics for a sub-probabilistic while-programming language. One of these interprets programs as sub-probabilistic ...

Mar 5, 2008 · The aim of this paper is to extend the probabilistic choice in probabilistic programs to sub-probabilistic choice, i.e., of the form.

To support both probabilistic choice and nondeterministic choice, the semantics is given over control-flow hyper-graphs. The semantics follows an algebraic ...

Abstract. For a simple probabilistic language we present a semantics based on linear operators on infinite dimensional Hilbert spaces. We show.

The aim of this paper is to extend the probabilistic choice in probabilistic programs to sub-probabilistic choice, ie, of the form (p)P ⋈(q)Q where p + q ⩽ 1.

Beyond a semantics, we offer relational reasoning principles for probabilistic programs making nested queries. We construct a step-indexed, biorthogonal logical ...

We develop a denotational semantics for low-level probabilistic programs with unstructured control-flow, general recursion, and nondeterminism.

Probabilistic programs are sequential programs with the ability to draw values at random from probability distributions. Probabilistic programs are not new ...