Systematic software development using VDM
Systematic software development using VDM
Keynote address - data abstraction and hierarchy
OOPSLA '87 Addendum to the proceedings on Object-oriented programming systems, languages and applications (Addendum)
The existence of refinement mappings
Theoretical Computer Science
The Z notation: a reference manual
The Z notation: a reference manual
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Algebra of programming
Component software: beyond object-oriented programming
Component software: beyond object-oriented programming
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Using relational and behavioural semantics in the verification of object models
Fourth International Conference on Formal methods for open object-based distributed systems IV
Refinement in Z and object-Z: foundations and advanced applications
Refinement in Z and object-Z: foundations and advanced applications
Communication and Concurrency
Elements of a Relational Theory of Datatypes
Proceedings of the IFIP TC2/WG 2.1 State-of-the-Art Report on Formal Program Development
Class Refinement and Interface Refinement in Object-Oriented Programs
FME '97 Proceedings of the 4th International Symposium of Formal Methods Europe on Industrial Applications and Strengthened Foundations of Formal Methods
Data Refinement: Model-Oriented Proof Methods and their Comparison
Data Refinement: Model-Oriented Proof Methods and their Comparison
A Coalgebraic Semantic Framework for Component-based Development in UML
Electronic Notes in Theoretical Computer Science (ENTCS)
Transposing partial components: an exercise on coalgebraic refinement
Theoretical Computer Science - Components and objects
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
Pre-Galois Connection on Coalgebras for Generic Component Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
A Single Complete Relational Rule for Coalgebraic Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
A coalgebraic approach to non-determinism: Applications to multilattices
Information Sciences: an International Journal
Testing of abstract components
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
SHACC: a functional prototyper for a component calculus
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
A perspective on component refinement
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
A formal abstract framework for modelling and testing complex software systems
Theoretical Computer Science
Software components as invariant-typed arrows
SBLP'12 Proceedings of the 16th Brazilian conference on Programming Languages
A Coalgebraic Perspective on Logical Interpretations
Studia Logica
| Hi-index | 0.00 |
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.