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
AbstractAssertional s-rings are introduced to provide an algebraic setting in which the finite and i...
Algebras of imperative programming languages have been success-ful in reasoning about programs. In g...
Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and...
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...
AbstractRefinement algebras are abstract algebras for reasoning about programs in a total correctnes...
Refinement algebras are axiomatic algebras for reasoning about programs in a total-correctness frame...
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...
We identify a refinement algebra for reasoning about probabilistic program transformations in a tota...
AbstractKleene algebra with tests (KAT) has proved to be useful for reasoning about programs in a pa...
Abstract. We propose an abstract algebra for reasoning about probabilistic programs. In contrast to ...
AbstractThe main result of this article is that every demonic refinement algebra with enabledness an...
Abstract. Partial, total and general correctness and further models of sequential computations diffe...
Program algebras abstract the essential properties of programming languages in the form of algebraic...
AbstractAssertional s-rings are introduced to provide an algebraic setting in which the finite and i...
Algebras of imperative programming languages have been success-ful in reasoning about programs. In g...
Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and...
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...
AbstractRefinement algebras are abstract algebras for reasoning about programs in a total correctnes...
Refinement algebras are axiomatic algebras for reasoning about programs in a total-correctness frame...
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...
We identify a refinement algebra for reasoning about probabilistic program transformations in a tota...
AbstractKleene algebra with tests (KAT) has proved to be useful for reasoning about programs in a pa...
Abstract. We propose an abstract algebra for reasoning about probabilistic programs. In contrast to ...
AbstractThe main result of this article is that every demonic refinement algebra with enabledness an...
Abstract. Partial, total and general correctness and further models of sequential computations diffe...
Program algebras abstract the essential properties of programming languages in the form of algebraic...
AbstractAssertional s-rings are introduced to provide an algebraic setting in which the finite and i...
Algebras of imperative programming languages have been success-ful in reasoning about programs. In g...
Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and...
DOI
Add to ORKG