Systematic software development using VDM
Systematic software development using VDM
The Z notation: a reference manual
The Z notation: a reference manual
Coordination languages and their significance
Communications of the ACM
The RAISE specification language
The RAISE specification language
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Algebra of programming
Objects and classes, co-algebraically
Object orientation with parallelism and persistence
Component software: beyond object-oriented programming
Component software: beyond object-oriented programming
A formal model for componentware
Foundations of component-based systems
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Components as processes: an exercise in coalgebraic modeling
Fourth International Conference on Formal methods for open object-based distributed systems IV
Communication and Concurrency
Introduction to Functional Programming
Introduction to Functional Programming
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire
Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
Elements of a Relational Theory of Datatypes
Proceedings of the IFIP TC2/WG 2.1 State-of-the-Art Report on Formal Program Development
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Category Theory and Computer Science
Exercises in coalgebraic specification
Algebraic and coalgebraic methods in the mathematics of program construction
Mathematical Structures in Computer Science
Components as coalgebras: the refinement dimension
Theoretical Computer Science - Algebraic methodology and software technology
A type-level approach to component prototyping
International workshop on Synthesis and analysis of component connectors: in conjunction with the 6th ESEC/FSE joint meeting
| Hi-index | 0.00 |
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).