On Refinement of Generic Software Components

This paper characterises refinement of state-based software components modelled as concrete coalgebras for some Set endofunctors. The resulting calculus is parametrized by a specification of the underlying behaviour model introduced as a strong monad. This provides a basis to reason about (and transform) state-based software designs