AbstractThis 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
AbstractThe technique of Galois connections has been applied successfully in many areas of computer ...
AbstractThe technique of Galois connections has been applied successfully in many areas of computer ...
AbstractThis paper introduces a generic semantic framework for component-based development, expresse...
This paper characterizes refinement of state-based software components modeled as pointed coalgebras...
10th International Conference, AMAST 2004, Stirling, Scotland, UK, July 12-16, 2004. ProceedingsThis...
This paper characterises refinement of state-based software components modelled as pointed coalgebra...
AbstractThis paper characterises refinement of state-based software components modelled as pointed c...
This paper introduces a calculus of state-based software components modelled as concrete coalgebras...
This paper characterizes refinement of state-based software components modelled as pointed coalgebra...
10th International Conference, AMAST 2004, Stirling, Scotland, UK, July 12-16, 2004. ProceedingsThis...
This paper characterises refinement of state-based software components modelled as concrete coalgebr...
Genericity is a topic which is not sufficiently developed in state-based systems modelling, mainly d...
IFIP TC6/WG6.1. Fourth International Conference on Formal Methods for Open Object-Based Distributed ...
This paper introduces a calculus of state-based software components modelled as concrete coalgebras ...
Often referred to as ‘the mathematics of dynamical, state-based systems’, Coalgebra claims to provid...
AbstractThe technique of Galois connections has been applied successfully in many areas of computer ...
AbstractThe technique of Galois connections has been applied successfully in many areas of computer ...
AbstractThis paper introduces a generic semantic framework for component-based development, expresse...
This paper characterizes refinement of state-based software components modeled as pointed coalgebras...
10th International Conference, AMAST 2004, Stirling, Scotland, UK, July 12-16, 2004. ProceedingsThis...
This paper characterises refinement of state-based software components modelled as pointed coalgebra...
AbstractThis paper characterises refinement of state-based software components modelled as pointed c...
This paper introduces a calculus of state-based software components modelled as concrete coalgebras...
This paper characterizes refinement of state-based software components modelled as pointed coalgebra...
10th International Conference, AMAST 2004, Stirling, Scotland, UK, July 12-16, 2004. ProceedingsThis...
This paper characterises refinement of state-based software components modelled as concrete coalgebr...
Genericity is a topic which is not sufficiently developed in state-based systems modelling, mainly d...
IFIP TC6/WG6.1. Fourth International Conference on Formal Methods for Open Object-Based Distributed ...
This paper introduces a calculus of state-based software components modelled as concrete coalgebras ...
Often referred to as ‘the mathematics of dynamical, state-based systems’, Coalgebra claims to provid...
AbstractThe technique of Galois connections has been applied successfully in many areas of computer ...
AbstractThe technique of Galois connections has been applied successfully in many areas of computer ...
AbstractThis paper introduces a generic semantic framework for component-based development, expresse...