Add to ORKGAbstract. We provide a HOL formalisation for analysing expected time bounds for probabilistic programs. Our formalisation is based on the quantitative program logic of Morgan et al. [20] and McIver’s extension of it [16] to include performancestyle operators. In addition we provide some novel results based on probabilistic data refinement which we use to improve the utility of the basic method. 1
The probabilistic guarded-command language pGCL [15] contains both demonic and probabilistic nondete...
International audienceWe consider the problem of expected cost analysis over non-deterministic proba...
AbstractExpectation-based probabilistic predicate transformers [15] provide a logic for probabilisti...
Abstract. We provide a HOL formalisation for analysing expected time bounds for probabilistic progra...
AbstractIn this paper we show how quantitative program logic (Morgan et al., ACM Trans. Programming ...
The work is supported by the EPSRC. Abstract. In this paper we show how quantitative program logic [...
Abstract. We present an approach to probabilistic analysis which is based on program semantics and e...
We present an approach to probabilistic analysis which is based on program semantics and exploits th...
We study quantitative reasoning about probabilistic programs. In doing so, we investigate two main a...
The rigorous application of static timing analysis requires a large and costly amount of detail know...
The aims of these lecture notes are two-fold: (i) we investigate the relation between the operationa...
Probabilistic analysis is a tool of fundamental importance to virtually all scientists and engineers...
We present a semantics-based technique for analysing probabilistic properties of imperative programs...
AbstractWe present a semantics-based technique for analysing probabilistic properties of imperative ...
Expectation-based probabilistic predicate transformers [15] provide a logic for probabilistic sequen...
The probabilistic guarded-command language pGCL [15] contains both demonic and probabilistic nondete...
International audienceWe consider the problem of expected cost analysis over non-deterministic proba...
AbstractExpectation-based probabilistic predicate transformers [15] provide a logic for probabilisti...
Abstract. We provide a HOL formalisation for analysing expected time bounds for probabilistic progra...
AbstractIn this paper we show how quantitative program logic (Morgan et al., ACM Trans. Programming ...
The work is supported by the EPSRC. Abstract. In this paper we show how quantitative program logic [...
Abstract. We present an approach to probabilistic analysis which is based on program semantics and e...
We present an approach to probabilistic analysis which is based on program semantics and exploits th...
We study quantitative reasoning about probabilistic programs. In doing so, we investigate two main a...
The rigorous application of static timing analysis requires a large and costly amount of detail know...
The aims of these lecture notes are two-fold: (i) we investigate the relation between the operationa...
Probabilistic analysis is a tool of fundamental importance to virtually all scientists and engineers...
We present a semantics-based technique for analysing probabilistic properties of imperative programs...
AbstractWe present a semantics-based technique for analysing probabilistic properties of imperative ...
Expectation-based probabilistic predicate transformers [15] provide a logic for probabilistic sequen...
The probabilistic guarded-command language pGCL [15] contains both demonic and probabilistic nondete...
International audienceWe consider the problem of expected cost analysis over non-deterministic proba...
AbstractExpectation-based probabilistic predicate transformers [15] provide a logic for probabilisti...