Probabilistic Rely-guarantee Calculus release_boxc7vsutrdydfyfaw6ow6225a

by Annabelle McIver and Tahiry Rabehaja and Georg Struth

Released as a article .

2015  

Abstract

Jones' rely-guarantee calculus for shared variable concurrency is extended to include probabilistic behaviours. We use an algebraic approach which combines and adapts probabilistic Kleene algebras with concurrent Kleene algebra. Soundness of the algebra is shown relative to a general probabilistic event structure semantics. The main contribution of this paper is a collection of rely-guarantee rules built on top of that semantics. In particular, we show how to obtain bounds on probabilities by deriving rely-guarantee rules within the true-concurrent denotational semantics. The use of these rules is illustrated by a detailed verification of a simple probabilistic concurrent program: a faulty Eratosthenes sieve.
In text/plain format

Archived Files and Locations

application/pdf  588.4 kB
file_hm2mct56c5hybbw6tsoaojeswq
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2015-06-02
Version   v3
Language   en ?
arXiv  1409.0582v3
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 8de046f3-f1f3-4b35-9abf-e07ace46686d
API URL: JSON