ACM Transactions on Programming Languages and Systems (TOPLAS)
From Kleene Algebra to Refinement Algebra
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Decentralization of process nets with centralized control
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
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)
Reasoning algebraically about probabilistic loops
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Using probabilistic kleene algebra for protocol verification
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
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
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
Probabilistic Choice in Refinement Algebra
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Domain Axioms for a Family of Near-Semirings
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Enabledness and termination in refinement algebra
Science of Computer Programming
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
| Hi-index | 0.00 |
We propose an abstract refinement algebra for reasoning about probabilistic programs in a total-correctness setting. The algebra is equipped with operators that determine whether a program is enabled, has certain failure or does not have certain failure, respectively. As an application, refinement rules for probabilistic action systems are derived in the algebra.