On refinement of generic state-based software components

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3116, Issue , 2004, Pages 506-520

  Meng, Sun ^a   Barbosa, Luís S ^b  

^a PEKING UNIVERSITY   (China)

^b UNIVERSITY OF MINHO   (Portugal)

Author keywords

Coalgebraic models; Components; Refinement

Indexed keywords

SOFTWARE ENGINEERING;

BEHAVIOUR MODELS; COALGEBRAIC MODELS; COALGEBRAS; COMPONENTS; ENDOFUNCTORS; REFINEMENT; STATE-BASED SOFTWARE;

SOFTWARE DESIGN;

EID: 35048846030     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27815-3_38     Document Type: Article

References (17)

1. R. Allen and D. Garlan. A formal basis for architectural connection. ACM TOSEM, 6(3):213-249, 1997.
2. L. S. Barbosa. Towards a Calculus of State-based Software Components. Journal of Universal Computer Science, 9(8):891-909, August 2003.
3. L. S. Barbosa and J. N. Oliveira. State-based components made generic. In H. P. Gumm, editor, CMCS'03, Elect. Notes in Theor. Gomp. Sci., volume 82.1, 2003.
4. R. Bird and O. Moor. The Algebra of Programming. Series in Computer Science. Prentice-Hall International, 1997.
5. P. Degano, R. Gorrieri, and G. Rosolini. A categorical view of process refinement. In J. de Bakker, G. Rozenberg, and J. Rutten, editors, Proc. REX Workshop on Semantics, pages 138-154. Springer Lect. Notes Comp. Sci. (666), 1992.
6. J. Derrick and E. Boiten. Calculating upward and downward simulations of state-based specifications. Information and Software Technology, 41:917-923, July 1999.
7. M. Fokkinga and R. Eshuis. Comparing refinements for failure and bisimulation semantics. Technical report, Faculty of Computing Science, Enschede, 2000.
8. C. A. R. Hoare. Proof of correctness of data representations. Acta Informatica, 1:271-281, 1972.
9. B. Jacobs and J. Hughes. Simulations in coalgebra. In H. P. Gumm, editor, CMCS'03, Elect. Notes in Theor. Comp. Sci., volume 82.1, Warsaw, April 2003.
10. C. B. Jones. Systematic Software Development Using VDM. Series in Computer Science. Prentice-Hall International, 1986.
11. B. Liskov. Data abstraction and hierarchy. SIGPLAN Notices, 23(3), 1988.
12. S. Meng and B. Aichernig. Towards a Coalgebraic Semantics of UML: Class Diagrams and Use Cases. Technical Report 272, UNU/IIST, January 2003.
13. E. Poll. A coalgebraic semantics of subtyping. Theorectical Informatica and Apllications, 35(1):61-82, 2001.
14. J. Rutten. Universal coalgebra: A theory of systems. Theor. Comp. Sci., 249(1):3-80, 2000. (Revised version of CWI Techn. Rep. CS-R9652, 1996).
15. C. Szyperski. Component Software, Beyond Object-Oriented Programming. Addison-Wesley, 1998.
16. P. Wadler and K. Weihe. Component-based programming under different paradigms. Technical report, Dagstuhl Seminar 99081, February 1999.
17. J. Woodcock and J. Davies. Using Z: Specification, Refinement and Proof. PrenticeHall International, 1996.