Programming Research Group Probabilistic Predicate Transformers: Part 2 Probabilistic Predicate Transformers: Part 2
نویسنده
چکیده
Probabilistic predicate transformers guarantee standard (ordinary) predicate transformers to incorporate a notion of prob-abilistic choice in imperative programs. The basic theory of that, for nite state spaces, is set out in 5], together with a statements of their`healthiness conditions'. Here the earlier results are extended to innnite state spaces, and several more specialised topics are explored: the characterisation of standard and deterministic programs; and the structure of the extended space generated whenàngelic choice' is added to the system
منابع مشابه
Programming Research Group Proof Rules for Probablistic Loops
Probabilistic predicate transformers provide a semantics for imperative programs containing both demonic and probabilistic nondeterminism. Like the (standard) predicate transformers popularised by Dijkstra, they model programs as functions from nal results to the initial conditions su cient to achieve them. This paper presents practical proof rules, using the probabilistic transformers, for rea...
متن کاملA Recipe for State-and-Effect Triangles
In the semantics of programming languages one can view programs as state transformers, or as predicate transformers. Recently the author has introduced ‘stateand-effect’ triangles which capture this situation categorically, involving an adjunction between stateand predicate-transformers. The current paper exploits a classical result in category theory, part of Jon Beck’s monadicity theorem, to ...
متن کاملProof rules for probabilistic loops
Probabilistic predicate transformers provide a semantics for imperative programs containing both demonic and probabilistic nondeterminism. Like the (standard) predicate transformers popularised by Dijkstra, they model programs as functions from final results to the initial conditions sufficient to achieve them. This paper presents practical proof rules, using the probabilistic transformers, for...
متن کاملProbabilistic Imperative Programming: a Rigorous Approach
Recent work has extended Kozen's probabilistic semantics 8, 9] to include demonic nondeterminism both at the operational 5] and the logical level 12]. That makes it now possible in principle to treat probabilistic program development with the same standards of rigour that apply, when appropriate, to imperative programming 3]. In this report we treat several practical aspects of the new models, ...
متن کاملThe Choice-coordination Problem: Notes for a Correctness Proof
Rabin's Choice-coordination algorithm 5] allows a number of identical processes to agree on a choice between two alternatives while nevertheless executing asynchronously. The algorithm is analysed here with techniques based on prob-abilistic predicate transformers 3], in particular applying invariants and variants as set out in 2], and using a probabilistic temporal logic.
متن کامل