A generalization of Dijkstra's calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Duality in specification languages: a lattice-theoretical approach
Acta Informatica
Data refinement of predicate transformers
Theoretical Computer Science
Adding fair choice to Dijkstra's calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of the ACM (JACM)
Automata and Computability
A Discipline of Programming
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
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)
Refinement algebra with operators for enabledness and termination
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Refinement Algebra for Probabilistic Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic Choice in Refinement Algebra
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Enabledness and termination in refinement algebra
Science of Computer Programming
A sketch of a dynamic epistemic semiring
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
On the structure of demonic refinement algebras with enabledness and termination
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
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
| Hi-index | 0.00 |
A dually nondeterministic refinement algebra with a negation operator is proposed. The algebra facilitates reasoning about total-correctness preserving program transformations and nondeterministic programs. The negation operator is used to express enabledness and termination operators through a useful explicit definition. As a small application, a property of action systems is proved employing the algebra. A dually nondeterministic refinement algebra without the negation operator is also discussed.