Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
436774 | Theoretical Computer Science | 2006 | 19 Pages |
Abstract
This paper characterises refinement of state-based software components modelled as pointed coalgebras for some Set endofunctors. The proposed characterisation is parametric on 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. In particular, it is shown how refinement can be applied to the development of the inequational subset of a calculus of generic software components.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics