Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and infinite iteration. We show that these independently introduced kinds of algebras can actually be defined in terms of each other. By defining modal operators on the underlying weak semiring, that result directly gives a demonic refinement algebra of commands. This yields models in which extensionality does not hold. Since in predicate-transformer models extensionality always holds, this means that the axioms of demonic refinement algebra do not characterise predicate-transformer models uniquely. The omega and the demonic refinement algebra of commands both utilise the convergence operator that is analogous to the halting predicate of modal μ...
We give finite axiomatizations for the varieties generated by representable domain--range algebras w...
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of compos...
This article studies the transfinite propositional provability logics GLP(A) and their corresponding...
Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and...
Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and...
AbstractThe main result of this article is that every demonic refinement algebra with enabledness an...
Five algebraic notions of termination are formalised, analysed and compared: well-foundedness or Noe...
We give an algebraic model of (H3) designs of Hoare's and He's Unifying Theories of Programming. It ...
Refinement algebras are axiomatisations intended for reasoning about programs in a total correctness...
Refinement algebras are abstract algebras for reasoning about programs in a total correctness framew...
AbstractKleene modules and modal Kleene algebras are applied to automatically verify refinement laws...
AbstractRefinement algebras are abstract algebras for reasoning about programs in a total correctnes...
AbstractTwo notions of nontermination are studied and compared in the setting of idempotent semiring...
Refinement algebras are axiomatic algebras for reasoning about programs in a total-correctness frame...
We present the complete lattice of demonic languages and its interpretation in refinement proofs. In...
We give finite axiomatizations for the varieties generated by representable domain--range algebras w...
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of compos...
This article studies the transfinite propositional provability logics GLP(A) and their corresponding...
Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and...
Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and...
AbstractThe main result of this article is that every demonic refinement algebra with enabledness an...
Five algebraic notions of termination are formalised, analysed and compared: well-foundedness or Noe...
We give an algebraic model of (H3) designs of Hoare's and He's Unifying Theories of Programming. It ...
Refinement algebras are axiomatisations intended for reasoning about programs in a total correctness...
Refinement algebras are abstract algebras for reasoning about programs in a total correctness framew...
AbstractKleene modules and modal Kleene algebras are applied to automatically verify refinement laws...
AbstractRefinement algebras are abstract algebras for reasoning about programs in a total correctnes...
AbstractTwo notions of nontermination are studied and compared in the setting of idempotent semiring...
Refinement algebras are axiomatic algebras for reasoning about programs in a total-correctness frame...
We present the complete lattice of demonic languages and its interpretation in refinement proofs. In...
We give finite axiomatizations for the varieties generated by representable domain--range algebras w...
We propose a relaxation of Kleene algebra by giving up strictness and right-distributivity of compos...
This article studies the transfinite propositional provability logics GLP(A) and their corresponding...