AbstractRefinement algebras are abstract algebras for reasoning about programs in a total correctness framework. We extend a reduct of von Wright’s demonic refinement algebra with two operators for modelling enabledness and termination of programs. We show how the operators can be used for expressing relations between programs and apply the algebra to reasoning about action systems
The term refinement algebra refers to a set of abstract algebras, similar to Kleene algebra with tes...
AbstractAssertional s-rings are introduced to provide an algebraic setting in which the finite and i...
The term refinement algebra refers to a set of abstract algebras, similar to Kleene algebra with tes...
AbstractRefinement algebras are abstract algebras for reasoning about programs in a total correctnes...
Refinement algebras are abstract algebras for reasoning about programs in a total correctness framew...
Refinement algebras are axiomatisations intended for reasoning about programs in a total correctness...
Refinement algebras are axiomatic algebras for reasoning about programs in a total-correctness frame...
AbstractKleene algebra with tests (KAT) has proved to be useful for reasoning about programs in a pa...
We identify a refinement algebra for reasoning about probabilistic program transformations in a tota...
We propose an abstract algebra for reasoning about probabilistic programs in a total-correctness fra...
Demonic refinement algebras are variants of Kleene algebras. Introduced by von Wright as a light-wei...
A dually nondeterministic refinement algebra with a negation operator is proposed. The algebra facil...
We introduce a calculus for reasoning about programs in total correctness which blends UTP designs w...
AbstractThe main result of this article is that every demonic refinement algebra with enabledness an...
AbstractA classical while-program normal-form theorem is derived in demonic refinement algebra. In c...
The term refinement algebra refers to a set of abstract algebras, similar to Kleene algebra with tes...
AbstractAssertional s-rings are introduced to provide an algebraic setting in which the finite and i...
The term refinement algebra refers to a set of abstract algebras, similar to Kleene algebra with tes...
AbstractRefinement algebras are abstract algebras for reasoning about programs in a total correctnes...
Refinement algebras are abstract algebras for reasoning about programs in a total correctness framew...
Refinement algebras are axiomatisations intended for reasoning about programs in a total correctness...
Refinement algebras are axiomatic algebras for reasoning about programs in a total-correctness frame...
AbstractKleene algebra with tests (KAT) has proved to be useful for reasoning about programs in a pa...
We identify a refinement algebra for reasoning about probabilistic program transformations in a tota...
We propose an abstract algebra for reasoning about probabilistic programs in a total-correctness fra...
Demonic refinement algebras are variants of Kleene algebras. Introduced by von Wright as a light-wei...
A dually nondeterministic refinement algebra with a negation operator is proposed. The algebra facil...
We introduce a calculus for reasoning about programs in total correctness which blends UTP designs w...
AbstractThe main result of this article is that every demonic refinement algebra with enabledness an...
AbstractA classical while-program normal-form theorem is derived in demonic refinement algebra. In c...
The term refinement algebra refers to a set of abstract algebras, similar to Kleene algebra with tes...
AbstractAssertional s-rings are introduced to provide an algebraic setting in which the finite and i...
The term refinement algebra refers to a set of abstract algebras, similar to Kleene algebra with tes...
DOI
Add to ORKG