On the semantics of componentware: A coalgebraic persecutive

Mathematical Frameworks For Component Software: Models For Analysis And Synthesis

Volumn , Issue , 2006, Pages 69-117

  Barbosa, Luís S ^a   Meng, Sun ^b   Aichernig, Bernhard K ^c   Rodrigues, Nuno ^a  

^a UNIVERSITY OF MINHO   (Portugal)

^b PEKING UNIVERSITY   (China)

^c UNITED NATIONS UNIVERSITY   (Macao)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 80053035729     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/9789812772831_0003     Document Type: Chapter

References (90)

1. J. R. Abrial. The B Book: Assigning Programs to Meanings. Cambridge University Press, 1996.
2. P. Aczel and N. Mendler. A final coalgebra theorem. In D. Pitt, D. Rydeheard, P. Dybjer, A. Pitts, and A. Poigne, editors, Proc. Category Theory and Computer Science, pages 357-365. Springer Lect. Notes Comp. Sci. (389), 1988.
3. F. Arbab. Abstract behaviour types: a foundation model for components and their composition. In F. S. de Boer, M. Bonsangue, S. Graf, and W.-P. de Roever, editors, Proc. First International Symposium on Formal Methods for Components and Objects (FMCO’02), pages 33-70. Springer Lect. Notes Comp. Sci. (2852), 2003.
4. R. Backhouse. An exploration of the Bird-Meertens formalism. CS 8810, Groningen University, 1988.
5. R. C. Backhouse, P. Jansson, J. Jeuring, and L. Meertens. Generic programming: An introduction. In S. D. Swierstra, P. R. Henriques, and J. N. Oliveira, editors, Third International Summer School on Advanced Functional Programming, Braga, pages 28-115. Springer Lect. Notes Comp. Sci. (1608), September 1998.
6. L. S. Barbosa. Components as processes: An exercise in coalgebraic modeling. In S. F. Smith and C. L. Talcott, editors, FMOODS’2000 - Formal Methods for Open Object-Oriented Distributed Systems, pages 397-417. Kluwer Academic Publishers, September 2000.
7. L. S. Barbosa. Components as Coalgebras. PhD thesis, DI, Universidade do Minho, 2001.
8. L. S. Barbosa. Process calculi d la Bird-Meertens. In CMCS’01, Elect. Notes in Theor. Comp. Sci., volume 44.4, pages 47-66, Genova, April 2001. Elsevier.
9. L. S. Barbosa. Towards a Calculus of State-based Software Components. Journal of Universal Computer Science, 9(8):891-909, August 2003.
10. L. S. Barbosa and J. N. Oliveira. Coinductive interpreters for process calculi. In Proc. of FLOPS’02, pages 183-197, Aizu, Japan, September 2002. Springer Lect. Notes Comp. Sci. (2441).
11. L. S. Barbosa and J. N. Oliveira. State-based components made generic. In H. Peter Gumm, editor, CMCS’03, Elect. Notes in Theor. Comp. Sci., volume 82.1. Elsevier, 2003.
12. M. A. Barbosa and L. S. Barbosa. Specifying software connectors. In K. Araki and Z. Liu, editors, 1st International Colloquium on Theorectical Aspects of Computing (ICTAC’04), pages 53-68, Guiyang, China, September 2004. Springer Lect. Notes Comp. Sci. (3407).
13. J. Benabou. Introduction to bicategories. Springer Lect. Notes Maths. (47), pages 1-77, 1967.
14. J. van Benthem. Modal Correspondence Theory. Ph.D. thesis, University of Amsterdam, 1976.
15. K. Bergner, A. Rausch, M. Sihling, A. Vilbig, and M. Broy. A Formal Model for Componentware. In Gary T. Leavens and Murali Sitaraman, editors, Foundations of Component-Based Systems, pages 189-210. Cambridge University Press, 2000.
16. R. Bird and O. Moor. The Algebra of Programming. Series in Computer Science. Prentice-Hall International, 1997.
17. G. Booch, J. Rumbaugh, and I. Jacobson. The Unified Modeling Language User Guide. Addison Wesley, 1999.
18. M. Broy. Semantics of finite and infinite networks of communicating agents. Distributed Computing, 2(1):13-31, 1987.
19. M. Broy and K. Stolen. Specification and Development of Interactive Systems: FOCUS on Streams, Interfaces, and Refinement. Springer, 2001.
20. J. Fitzgerald and P. G. Larsen. Modelling Systems: Pratical Tools and Techniques in Software Development. Cambridge University Press, 1998.
21. D. Gelernter and N. Carrier. Coordination languages and their significance. Communication of the ACM, 2(35):97-107, February 1992.
22. J. Goguen, J. Thatcher, E. Wagner, and J. Wright. Initial algebra semantics and continuous algebras. Jour, of the ACM, 24(1):68-95, January 1977.
23. R. Grimes. Profissional DCOM Programming. Wrox Press, 1997.
24. H. P. Gumm and T. Schroeder. Covarieties and complete covarieties. In B. Jacobs, L. Moss, H. Reichel, and J. Rutten, editors, CMCS’98, Elect. Notes in Theor. Comp. Sci., volume 11. Elsevier, March 1998.
25. H. Peter Gumm. Elements of the general theory of coalgebras. Technical report, Lecture Notes for LUTACS’99, South Africa, 1999.
26. J. He, Z. Liu, and Li X. Component-based software engineering. In Pro. ICTAC’2005, Lecture Notes in Computer Science 3722. Springer, 2005.
27. U. Hensel and H. Reichel. Defining equations in terminal coalgebras. In E. Astesiano, G. Reggio, and A. Tarlecki, editors, Recent Trends in Data Type Specification, pages 307-318. Springer Lect. Notes Comp. Sci. (906), 1995.
28. B. Jacobs. Mongruences and cofree coalgebras. In V.S. Alagar and M. Nivat, editors, Algebraic Methodology and Software Technology (AMAST), pages 245-260. Springer Lect. Notes Comp. Sci. (936), 1995.
29. B. Jacobs. Object-oriented hybrid systems of coalgebras plus monoid actions. In M. Wirsing and M. Nivat, editors, Algebraic Methodology and Software Technology (AMAST), pages 520-535. Springer Lect. Notes Comp. Sci. (1101), 1996.
30. B. Jacobs. Objects and classes, co-algebraically. In C. Lengauer B. Freitag, C.B. Jones and H.-J. Schek, editors, Object-Orientation with Parallelism and Persistence, pages 83-103. Kluwer Academic Publishers, 1996.
31. B. Jacobs. Objects and classes, co-algebraically. In B. Freitag and C.B. Jones, C. Lengauer and H.-J. Schek, editor, Object-Orientation with Parallelism and Persistence, pages 83-103. Kluwer, 1996.
32. B. Jacobs. Behaviour-refinement of coalgebraic specifications with coinductive correctness proofs. In TAPSOFT’97: Theory and Practice of Software Development, pages 787-802. Springer Lect. Notes Comp. Sci. (1214), 1997.
33. B. Jacobs. Exercises in coalgebraic specification. In R. Backhouse, R. Crole, and J. Gibbons, editors, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, pages 237-280. Springer Lect. Notes Comp. Sci. (2297), 2002.
34. B. Jacobs and J. Rutten. A tutorial on (co)algebras and (co)induction. EATCS Bulletin, 62:222-159, 1997.
35. I. Jacobson. Object oriented development in an industrial environment. In Norman K. Meyrowitz, editor, Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA’87), October 4-8, 1987, Orlando, Florida, volume 22 of SIGPLAN Notices, pages 183-191, 1987.
36. Cliff B. Jones. Systematic Software Development Using VDM. Series in Computer Science. Prentice-Hall International, 1986.
37. P. Katis. Categories and Bicategories of Processes. PhD thesis, University of Sydney, 1996.
38. P. Katis, N. Sabadini, and R. F. C. Walters. Bicategories of processes. Journal of Pure and Applied Algebra, 115(2):141-178, 1997.
39. P. Katis, N. Sabadini, and R. F. C. Walters. On the algebra of systems with feedback and boundary. Rendiconti del Circolo Matematico di Palermo, II(63):123-156, 2000.
40. G. M. Kelly. Basic Concepts of Enriched Category Theory, volume 64 of London Mathematical Society Lecture Notes Series. Cambridge University Press, 1982.
41. A. Kock. Strong functors and monoidal monads. Archiv fur Mathematik, 23:113-120, 1972.
42. S. Krstic, J. Launchbury, and D. Pavlovic. Categories of processes enriched in final coalgebras. In Proceedings of FOSSACS, pages 303-317. Springer Lect. Notes Comp. Sci. (2030), 2001.
43. A. Kurz. Specifying coalgebras with modal logic. In B. Jacobs, L. Moss, H. Reichel, and J. Rutten, editors, CMCS’98, Elect. Notes in Theor. Comp. Sci., volume 11. Elsevier, March 1998.
44. A. Kurz. Coalgebras and modal logic. Technical report, Lecture Notes for ESSLLII’ 2001, Helsinki, 2001.
45. A. Kurz. Logics for Coalgebras and Applications to Computer Science. Ph.D. Thesis, Fakultat fur Mathematik, Ludwig-Maximilians Univ., Muenchen, 2001.
46. A. Kurz and D. Pattinson. Coalgebras and modal logic for parameterised endofunctors. Technical report, CWI Technical Report, SEN-R0040, 2000.
47. Diego Latella, Istvan Majzik, and Mieke Massink. Towards a formal operational semantics of UML statechart diagrams. In Proc. FMOODS’99. Kluwer, 1999.
48. M. Lenisa. Themes in Final Semantics. PhD thesis, Universita de Pisa-Udine, 1998.
49. Z. Liu, J. He, and Li X. Contract-oriented development of component software. Technical Report 285, United Nations University, International Institute for Software Technology (UNU-IIST), 2003.
50. K.-P. Lohr. Towards automatic mediation between heterogeneous software components. Electr. Notes in Theor. Comp. Sci., Elsevier, 65(4), 2002.
51. S. Mac Lane. Categories for the Working Mathematician. Springer Verlag, 1971.
52. V. Matena and B Stearns. Applying Entreprise JavaBeans: Component-Based Development for the J2EE Platform. Addison-Wesley, 2000.
53. G. H. Mealy. A method for synthesizing sequential circuits. Bell Systems Techn. Jour., 34(5): 1045-1079, 1955.
54. E. Meijer, M. Fokkinga, and R. Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In J. Hughes, editor, Proceedings of the 1991 ACM Conference on Functional Programming Languages and Computer Architecture, pages 124-144. Springer Lect. Notes Comp. Sci. (523), 1991.
55. R. Milner. Communication and Concurrency. Series in Computer Science. Prentice-Hall International, 1989.
56. L. Monteiro. Observation systems. In H. Reichel, editor, CMCS’OO - Workshop on Coalgebraic Methods in Computer Science. ENTCS, volume 33, Elsevier, 2000.
57. E. F. Moore. Gedanken experiments on sequential machines. In Automata Studies, pages 129-153. Princeton University Press, 1966.
58. L. Moss. Coalgebraic logic. Ann. Pure & Appl. Logic, 1999.
59. O. Nierstrasz and F. Achermann. A calculus for modeling software components. In F. S. de Boer, M. Bonsangue, S. Graf, and W.-P. de Roever, editors, Proc. First International Symposium on Formal Methods for Components and Objects (FMCO '02), pages 339-360. Springer Lect. Notes Comp. Sci. (2852), 2003.
60. S. Oaks and H. Wong. Jini in a Nutshell. O’Reilly and Associates, 2000.
61. J. N. Oliveira. The Formal Semantics of Deterministic Dataflow Programs. PhD thesis, Department of Computer Science, University of Manchester, February 1984.
62. J. N. Oliveira. Formal Software Development. Lecture Notes for the MSc in Computer Science, Minho University, 1992.
63. OMG. OMG Unified Modeling Language Specification, Version 1.4, 2001.
64. G. Papadopoulos and F. Arbab. Coordination models and languages. In Advances in Computers - The Engineering of Large Systems, volume 46, pages 329-400. 1998.
65. D. Park. Concurrency and automata on infinite sequences. In Proceedings of the 5th Gl-Conference on Theoretical Computer Science, volume 104 of Lect. Notes Comp. Sci., pages 167-183. Springer-Verlag, 1981.
66. J. Power and H. Watanabe. An axiomatics for categories of coalgebras. In B. Jacobs, L. Moss, H. Reichel, and J. Rutten, editors, CMCS’98, Elect. Notes in Theor. Comp. Sci., volume 11. Elsevier, March 1998.
67. H. Reichel. An approach to object semantics based on terminal co-algebras. Math. Struct, in Comp. Sci., 5:129-152, 1995.
68. N. Rodrigues. Formal methods laboratory: the component repository specification. Technical report, Univ. Minho, DI, 2003.
69. N. Rodrigues and L. S. Barbosa. On the specification of a component repository. In Hung Dang Van and Zhiming Liu, editors, Proc. of FACS’03, (‘Formal Approaches to Component Software, ), pages 47-62, Pisa, Spetember 2003.
70. J. Rothe, B. Jacobs, and H. Tews. The coalgebraic class specification language CCSL. Jour, of Universal Computer Science, 7(2), 2001.
71. J. Rumbaugh, I. Jacobson, and G. Booch. The Unified Modeling Language Reference Manual. Addison-Wesley, 1997.
72. J. Rutten. A calculus of transition systems (towards universal co-algebra). In A. Ponse, M. de Rijke, and Y. Venema, editors, Modal Logic and Process Algebra, A Bisimulation Perspective, CSLI Lecture Notes (53), pages 231-256. CSLI Publications, Stanford, 1995.
73. J. Rutten. Universal coalgebra: A theory of systems. Technical report, CWI, Amsterdam, 1996.
74. J. Rutten. Automata and coinduction (an exercise in coalgebra). In Proc. CONCUR’ 98, pages 194-218. Springer Lect. Notes Comp. Sci. (1466), 1998.
75. 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).
76. J.-G. Schneider and O. Nierstrasz. Components, scripts, glue. In L. Barroca, J. Hall, and P. Hall, editors, Software Architectures - Advances and Applications, pages 13-25. Springer-Verlag, 1999.
77. K. Segerberg. An essay in classical modal logic. Technical Report 13, University of Uppsala, Filosofiska Studier, 1971.
78. R. Siegel. CORBA: Fundamentals and Programming. John Wiley & Sons Inc, 1997.
79. J. M. Spivey. The Z Notation: A Reference Manual (2nd ed). Series in Computer Science. Prentice-Hall International, 1992.
80. M. Sun and B. K. Aichernig. Component-based coalgebraic specification and verification in RSL. Technical Report 267, UNU/IIST, October 2002.
81. M. Sun and B. K. Aichernig. A coalgebraic calculus for component based systems. In Hung Dang Van and Zhiming Liu, editors, Proc. of FACS’03, (‘Formal Approaches to Component Software, ), pages 27-46, Pisa, Spetember 2003.
82. M. Sun and B. K. Aichernig. Towards a Coalgebraic Semantics of UML: Class Diagrams and Use Cases. Technical Report 272, UNU/IIST, January 2003.
83. M. Sun, B. K. Aichernig, L. S. Barbosa, and Z. Naixiao. A coalgebraic semantic framework for component based development in UML. In L. Birkedal, editor, Proc. Int. Conf. on Category Theory and Computer Science (CTCS’04), volume 122, pages 229-245. Elect. Notes in Theor. Comp. Sci., Elsevier, 2005.
84. M. Sun and L. S. Barbosa. On refinement of generic software components. In C. Rettray, S. Maharaj, and C. Shankland, editors, 10th Int. Conf. Algebraic Methods and Software Technology (AMAST), pages 506-520, Stirling, 2004. Springer Lect. Notes Comp. Sci. (3116).
85. M. Sun, Z. Naixiao, and L. S. Barbosa. On semantics and refinement of UML statecharts:A coalgebraic view. In J. Cuellar and Z. Liu, editors, Proc. of 2nd IEEE Int. Conf. on Software Engineering and Formal Methods, pages 164-173, Beijing, China, September 2004. IEEE Computer Society Press.
86. C. Szyperski. Component Software, Beyond Object-Oriented Programming. Addison-Wesley, 1998.
87. The RAISE Language Group. The RAISE Specification Language. Prentice Hall International, 1992.
88. D. Turi and J. Rutten. On the foundations of final coalgebra semantics: non-wellfounded sets, partial orders, metric spaces. Math. Struct, in Corap. Sci., 8(5):481-540, 1998.
89. P. Wadler and K. Weihe. Component-based programming under different paradigms. Technical report, Dagstuhl Seminar 99081, February 1999.
90. U. Wolter. A coalgebraic introduction to CSP. In CMCS’99, Elect. Notes in Theor. Comp. Sci., volume 19. Elsevier, 1999.