On Hoare logic and Kleene algebra with tests
ACM Transactions on Computational Logic (TOCL)
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
ACM Transactions on Computational Logic (TOCL)
Science of Computer Programming
Refinement Algebra for Probabilistic Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
A non-probabilistic relational model of probabilistic Kleene algebras
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
Refinement algebra with operators for enabledness and termination
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Domain and Antidomain Semigroups
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Partial, total and general correctness
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Internal axioms for domain semirings
Science of Computer Programming
Unifying recursion in partial, total and general correctness
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
| Hi-index | 0.00 |
Axioms for domain operations in several variants of Kleene algebras and their semiring reducts are presented. They provide abstract enabledness conditions for algebras designed for the verification and refinement of action systems, probabilistic protocols, basic processes and games. The axiomatisations are simpler, more uniform and more flexible than previous attempts; they are especially suited for automated deduction. This is further demonstrated through the automated verification of some classical refinement laws for action systems.