Systematic software development using VDM (2nd ed.)
Systematic software development using VDM (2nd ed.)
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
Object-oriented software construction (2nd ed.)
Object-oriented software construction (2nd ed.)
Modelling systems: practical tools and techniques in software development
Modelling systems: practical tools and techniques in software development
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
Introduction to Functional Programming
Introduction to Functional Programming
Elements of a Relational Theory of Datatypes
Proceedings of the IFIP TC2/WG 2.1 State-of-the-Art Report on Formal Program Development
Validated Designs For Object-oriented Systems
Validated Designs For Object-oriented Systems
Components as coalgebras: the refinement dimension
Theoretical Computer Science - Algebraic methodology and software technology
Pointfree factorization of operation refinement
FM'06 Proceedings of the 14th international conference on Formal Methods
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)
SHACC: a functional prototyper for a component calculus
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Software components as invariant-typed arrows
SBLP'12 Proceedings of the 16th Brazilian conference on Programming Languages
Hi-index | 0.00 |
A partial component is a process which fails or dies at some stage, thus exhibiting a finite, more ephemeral behaviour man expected. Partiality--which is the rule rather than exception in formal modelling--can be treated mathematically via totalization techniques. In the case of partial functions, totalization involves error values and exceptions.In the context of a coalgebraic approach to component semantics, this paper argues that the behavioural counterpart to such functional techniques should extend behaviour with try-again cycles preventing from component collapse, thus extending totalization or transposition from the algebraic to the coalgebraic context.We show that a refinement relationship holds between original and totalized components which is reasoned about in a coalgebraic approach to component refinement expressed in the pointfree binary relation calculus.As part of the pragmatic aims of this research, we also address the factorization of every such totalized coalgebra into two coalgebraic components--the original one and an added front-end--which cooperate in a client-server style.