Predicate calculus and program semantics
Predicate calculus and program semantics
Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Discipline of Programming
From Kleene Algebra to Refinement Algebra
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Cost Analysis of Games, Using Program Logic
APSEC '01 Proceedings of the Eighth Asia-Pacific on Software Engineering Conference
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
ACM Transactions on Computational Logic (TOCL)
Refinement Algebra for Probabilistic Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Algebraic reasoning for probabilistic action systems and while-loops
Acta Informatica
Reactive probabilistic programs and refinement algebra
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
On two dually nondeterministic refinement algebras
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Refinement algebra with operators for enabledness and termination
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
| Hi-index | 0.00 |
The term refinement algebra refers to a set of abstract algebras, similar to Kleene algebra with tests, that are suitable for reasoning about programs in a total-correctness framework. Abstract algebraic reasoning also works well when probabilistic programs are concerned, and a general refinement algebra that is suitable for such programs has been defined previously. That refinement algebra does notcontain features that are specific to probabilistic programs. For instance, it does not include a probabilistic choice operator, or probabilisticassertions and guards (tests), which may be used to represent correctness properties for probabilistic programs. In this paper we investigate how these features may be included in a refinement algebra. That is, we propose a new refinement algebra in which probabilistic choice, and probabilistic guards and assertions may be expressed. Two operators for modelling probabilistic enabledness and termination are also introduced.