We give finite axiomatizations for the varieties generated by representable domain--range algebras when the semigroup operation is interpreted as angelic or demonic composition, respectively
AbstractRefinement algebras are abstract algebras for reasoning about programs in a total correctnes...
AbstractWe propose a new and uniform abstract relational approach to demonic nondeterminism and robu...
We propose Kleene algebra with domain (KAD), an extension of Kleene algebra by simple equational axi...
We give finite axiomatizations for the varieties generated by representable domain-range algebras wh...
Relational semigroups with domain and range are a useful tool for modelling nondeterministic program...
Demonic composition, demonic refinement and demonic union are alternatives to the usual “angelic” co...
Demonic composition ∗ is an associative operation on binary relations, and demonic refinement ⊑ is a...
The motivation for using demonic calculus for binary relations stems from the behaviour of demonic t...
Relation algebra and its reducts provide us with a strong tool for reasoning about nondeterministic ...
AbstractThe family of domain algebras provide an elegant formal system for automated reasoning about...
We give complete, finite quasiequational axiomatisations for algebras of unary partial functions und...
A study of the classes of finite relations as enriched strict monoidal categories is presented in [C...
We give an algebraic model of (H3) designs of Hoare's and He's Unifying Theories of Programming. It ...
This extended abstract first presents a new category theoretic approach to equationally axiomatizabl...
The family of domain algebras provide an elegant formal system for automated reasoning about program...
AbstractRefinement algebras are abstract algebras for reasoning about programs in a total correctnes...
AbstractWe propose a new and uniform abstract relational approach to demonic nondeterminism and robu...
We propose Kleene algebra with domain (KAD), an extension of Kleene algebra by simple equational axi...
We give finite axiomatizations for the varieties generated by representable domain-range algebras wh...
Relational semigroups with domain and range are a useful tool for modelling nondeterministic program...
Demonic composition, demonic refinement and demonic union are alternatives to the usual “angelic” co...
Demonic composition ∗ is an associative operation on binary relations, and demonic refinement ⊑ is a...
The motivation for using demonic calculus for binary relations stems from the behaviour of demonic t...
Relation algebra and its reducts provide us with a strong tool for reasoning about nondeterministic ...
AbstractThe family of domain algebras provide an elegant formal system for automated reasoning about...
We give complete, finite quasiequational axiomatisations for algebras of unary partial functions und...
A study of the classes of finite relations as enriched strict monoidal categories is presented in [C...
We give an algebraic model of (H3) designs of Hoare's and He's Unifying Theories of Programming. It ...
This extended abstract first presents a new category theoretic approach to equationally axiomatizabl...
The family of domain algebras provide an elegant formal system for automated reasoning about program...
AbstractRefinement algebras are abstract algebras for reasoning about programs in a total correctnes...
AbstractWe propose a new and uniform abstract relational approach to demonic nondeterminism and robu...
We propose Kleene algebra with domain (KAD), an extension of Kleene algebra by simple equational axi...
DOI
Add to ORKG