A logical approach to discrete math
A logical approach to discrete math
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)
An axiomatic basis for computer programming
Communications of the ACM
A Discipline of Programming
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
Reasoning About Interactive Systems
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Implementing Angelic Nondeterminism
APSEC '03 Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
ACM Transactions on Computational Logic (TOCL)
Automated Reasoning in Kleene Algebra
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Enabledness and termination in refinement algebra
Science of Computer Programming
Automated verification of refinement laws
Annals of Mathematics and Artificial Intelligence
A sketch of a dynamic epistemic semiring
Information and Computation
Omega algebra, demonic refinement algebra and commands
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
| Hi-index | 0.00 |
This paper presents an abstract-algebraic formulation of action facilitating reasoning about two opposing agents. Two dual nondeterministic choice operators are formulated abstract-algebraically: angelic (or user) choice and demonic (or system) choice. Iteration operators are also defined. As an application, Hoare-style correctness rules are established by means of the algebra. A negation operator is also discussed.