Components as coalgebras: the refinement dimension
From MaRDI portal
Publication:820141
DOI10.1016/j.tcs.2005.09.072zbMath1086.68031OpenAlexW1971702393MaRDI QIDQ820141
Publication date: 6 April 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1822/33818
Abstract data types; algebraic specification (68Q65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Transposing partial components--an exercise on coalgebraic refinement, A coalgebraic perspective on logical interpretations, A coalgebraic approach to non-determinism: applications to multilattices, A calculus for generic, QoS-aware component composition, A Single Complete Relational Rule for Coalgebraic Refinement, A formal abstract framework for modelling and testing complex software systems, Pre-Galois Connection on Coalgebras for Generic Component Refinement
Uses Software
Cites Work
- The existence of refinement mappings
- Formal program development. IFIP TC2/WG 2.1 State-of-the-Art report
- Universal coalgebra: A theory of systems
- Proof of correctness of data representations
- A Coalgebraic Semantics of Subtyping
- The B-Book
- Data Refinement
- Mathematics of Program Construction
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item