Add to ORKGRefinement algebras are axiomatisations intended for reasoning about programs in a total correctness framework. We reduce von Wright’s demonic refinement algebra to only allow strong iteration and introduce two operators for modelling enabledness and termination of programs, respectively. We show how the operators can be used for expressing properties between programs and apply the algebra to reasoning about action systems
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...
To help make refinement more usable in practice we introduce a general, flexible model of refinement...
Refinement algebras are abstract algebras for reasoning about programs in a total correctness framew...
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...
We identify a refinement algebra for reasoning about probabilistic program transformations in a tota...
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...
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...
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...
Can the semantics of a program be represented as a single formula? We show that one formula is insuf...
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...
To help make refinement more usable in practice we introduce a general, flexible model of refinement...
Refinement algebras are abstract algebras for reasoning about programs in a total correctness framew...
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...
We identify a refinement algebra for reasoning about probabilistic program transformations in a tota...
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...
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...
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...
Can the semantics of a program be represented as a single formula? We show that one formula is insuf...
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...
To help make refinement more usable in practice we introduce a general, flexible model of refinement...