In the refinement calculus, program statements are modelled as predicate transformers. A product operator for predicate transformers was introduced by...
We introduce a concept of behavioural implementation for algebraic specifications which is based on an indistinguishability relation (called behaviour...
This paper refers to the Collatz conjecture. The origin and the formalization of the Collatz problem are presented in the first section, named "Introd...
In this paper, formal relationships between classes of objects based on semantic data models (i.e. conceptual classes) and classes of objects based on...
Using predicate transformers as a basis, we give semantics and refinement rules for mixed specifications that allow UNITY style specifications to be w...
