2005
DOI: 10.1007/11561163_2
|View full text |Cite
|
Sign up to set email alerts
|

A Perspective on Component Refinement

Abstract: Abstract. This paper provides an overview of an approach to coalgebraic modelling and refinement of state-based software components, summing up some basic results and introducing a discussion on the interplay between behavioural and classical data refinement. The approach builds on coalgebra theory as a suitable tool to capture observational semantics and to base an abstract characterisation of possible behaviour models for components (from partiality to different degrees of non-determinism).

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2007
2007
2007
2007

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 38 publications
(59 reference statements)
0
3
0
Order By: Relevance
“…a value which acts as an initial state for the underlying transition system. 4 Recall conditional construction (p → f, g), whose meaning is if p then f else g. * is the only habitant of the 1 datatype.…”
Section: Component Specificationsmentioning
confidence: 99%
See 2 more Smart Citations
“…a value which acts as an initial state for the underlying transition system. 4 Recall conditional construction (p → f, g), whose meaning is if p then f else g. * is the only habitant of the 1 datatype.…”
Section: Component Specificationsmentioning
confidence: 99%
“…The reader is referred elsewhere [3,4] for the formal definition of these combinators as well as the various laws they obey.…”
Section: An Algebra Of Componentsmentioning
confidence: 99%
See 1 more Smart Citation