Refinement 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
Can the semantics of a program be represented as a single formula? We show that one formula is insuf...
Algebras of imperative programming languages have been success-ful in reasoning about programs. In g...
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 axiomatisations intended for reasoning about programs in a total correctness...
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 identify a refinement algebra for reasoning about probabilistic program transformations in a tota...
We introduce a calculus for reasoning about programs in total correctness which blends UTP designs w...
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 ...
Abstract. Partial, total and general correctness and further models of sequential computations diffe...
AbstractThe main result of this article is that every demonic refinement algebra with enabledness an...
Program algebras abstract the essential properties of programming languages in the form of algebraic...
The term refinement algebra refers to a set of abstract algebras, similar to Kleene algebra with tes...
Can the semantics of a program be represented as a single formula? We show that one formula is insuf...
Algebras of imperative programming languages have been success-ful in reasoning about programs. In g...
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 axiomatisations intended for reasoning about programs in a total correctness...
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 identify a refinement algebra for reasoning about probabilistic program transformations in a tota...
We introduce a calculus for reasoning about programs in total correctness which blends UTP designs w...
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 ...
Abstract. Partial, total and general correctness and further models of sequential computations diffe...
AbstractThe main result of this article is that every demonic refinement algebra with enabledness an...
Program algebras abstract the essential properties of programming languages in the form of algebraic...
The term refinement algebra refers to a set of abstract algebras, similar to Kleene algebra with tes...
Can the semantics of a program be represented as a single formula? We show that one formula is insuf...
Algebras of imperative programming languages have been success-ful in reasoning about programs. In g...
The term refinement algebra refers to a set of abstract algebras, similar to Kleene algebra with tes...
DOI
Add to ORKG