Categories for software engineering

Categories for Software Engineering

Volumn , Issue , 2005, Pages 1-250

  Fiadeiro, José Luiz ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892283615     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/b138249     Document Type: Book

References (112)

1. J. Adaáek, H. Herrlich, G. Strecker (1990) Abstract and Concrete Categories. Wiley Interscience, New York
2. R. Allen, D. Garlan (1997) A formal basis for architectural connectors. ACM TOSEM 6(3):2l 3-249
3. F. Arbab (1998) What do you mean, coordination? In: Bulletin of the Dutch Association for Theoretical Computer Science (NVTI), March 1998
4. M. Arbib, E. Manes (1975) Arrows, Structures and Functors: The Categorical Imperative. Academic Press, New York
5. M. Arrais, J. L. Fiadeiro (1996) Unifying theories in different institutions. In: M. Haveraaen, O. Owe, O.-J. Dahl (eds) Recent Trends in Data Type Specification. LNCS, vol 1130. Springer, Berlin Heidelberg New York, pp 81-101
6. A. Asperti, G. Longo (1991) Categories, Types and Structures: An Introduction to Category Theory for the Working Computer Scientist. MIT Press, Cambridge, MA
7. E. Astesiano, M. Broy, G. Reggio (1999) Algebraic specification of concurrent systems. In: [8]
8. E. Astesiano, B. Krieg-Briickner, H.-J. Kreowski (eds) (1999) IF IP WG 1.3 Book on Algebraic Foundations of System Specification. Springer, Berlin Heidelberg New York
9. R. J. Back (1990) Refinement calculus II: parallel and reactive programs. In: J. deBakker, W. deRoever, G. Rozenberg (eds) Stepwise Refinement of Distributed Systems. LNCS, vol 430. Springer, Berlin Heidelberg New York, pp 67-93
10. R. J. Back, K. Sere (1996) Superposition refinement of reactive systems. Formal Aspects of Computing 8(3):324-346
11. J. P. Banâtre, D. Le Metayer (1993) Programming by multiset transformation. Communications ACM 1 6 vi (1):55-77
12. M. Barr, C. Wells (1990) Category Theory for Computing Science. Prentice Hall, London
13. H. Barringer (1987) The use of temporal logic in the compositional specification of concurrent systems. In: A. Galton (ed) Temporal Logics and Their Applications. Academic Press, New York
14. L. Bass, P. Clements, R. Kasman (1998) Software Architecture in Practice. Addison-Wesley, Reading, MA
15. M. Bednarczyk (1988) Categories of Asynchronous Transition Systems. PhD Thesis, University of Sussex
16. G. Berry, G. Boudol (1992) The chemical abstract machine. Theoretical Computer Science 96:217-248
17. R. Burstall, J. Goguen (1977) Putting theories together to make specifications. In: R. Reddy (ed) Proc. Fifth International Joint Conference on Artificial Intelligence, August 1977, Cambridge, MA, pp 1045-1058
18. R. Burstall, J. Goguen (1980) The semantics of CLEAR, a specification language. In: Proc. Advanced Course on Abstract Software Specification. LNCS, vol 86. Springer, Berlin Heidelberg New York, pp 292-332
19. K. Chandy, J. Misra (1988) Parallel Program Design - A Foundation. Addison-Wesley, Reading, MA
20. J. F. Costa, A. Sernadas, C. Sernadas (1993) Data encapsulation and modularity: three views of inheritance. In: A. Borzyszkowski, S. Sokolowski (eds) Mathematical Foundations of Computer Science. LNCS, vol 711. Springer, Berlin Heidelberg New York, pp 382-391
21. J. F. Costa, A. Sernadas, C. Sernadas, H.-D. Ehrich (1992) Object interaction. In: Mathematical Foundations of Computer Science. LNCS, vol 629. Springer, Berlin Heidelberg New York, pp 200-208
22. R. Crole (1993) Categories for Types. Cambridge University Press, Cambridge
23. E. Dijkstra (1976) A Discipline of Programming. Prentice Hall, London
24. H.-D. Ehrich, J. Goguen, A. Sernadas (1991) A categorial theory of objects as observed processes. In: J. deBakker, W. deRoever, G. Rozenberg (eds) Foundations of Object-Oriented Languages. LNCS, vol 489. Springer, Berlin Heidelberg New York, pp 203-228
25. H.-D. Ehrich, A. Sernadas, C. Sernadas (1989) Objects, object types and object identity. In: H. Ehrig et al. (eds) Categorical Methods in Computer Science with Aspects from Topology. LNCS, vol 393. Springer, Berlin Heidelberg New York, pp 142-156
26. H. Ehrig, M. Große-Rhode, U. Wolter (1998) Applications of category theory to the area of algebraic specification in computer science. Applied Categorical Structures 6:1-35
27. H. Ehrig, K.-D. Kiermeier, H.-J. Kreowski, W. Kuhnel (1974) Universal Theory of Automata: A Categorical Approach. B. G. Teubner, Stuttgart
28. H. Ehrig, B. Mahr (1985) Fundamentals of Algebraic Specification 1: Equations and Initial Semantics. EATCS Monographs on Theoretical Computer Science, vol 6. Springer, Berlin Heidelberg New York
29. H. Ehrig, B. Mahr (1990) Fundamentals of Algebraic Specification 2: Module Specifications and Constraints. EATCS Monographs on Theoretical Computer Science, vol 21. Springer, Berlin Heidelberg New York
30. E. Emerson, E. Clarke (1982) Using branching time logic to synthesize synchronisation skeletons. Science of Computer Programming 2:241-266
31. J. L. Fiadeiro (1996) On the emergence of properties in component-based systems. In: M. Wirsing, M. Nivat (eds) Algebraic Methodology and Software Technology. LNCS, vol 1101. Springer, Berlin Heidelberg New York, pp 421-443
32. J. L. Fiadeiro, J. F. Costa (1996) Mirror, mirror in my hand: a duality between specifications and models of process behaviour. Mathematical Structures in Computer Science 6:353-373
33. J. L. Fiadeiro, J. F. Costa (1995) Institutions for behaviour specification. In: E. Astesiano, G. Reggio, A. Tarlecki (eds) Recent Trends in Data Type Specification. LNCS, vol 906. Springer, Berlin Heidelberg New York, pp 273-289
34. J. L. Fiadeiro, A. Lopes (1997) Semantics of architectural connectors. In: M. Bidoit, M. Dauchet (eds) Theory and Practice of Software Development. LNCS, vol 1214. Springer, Berlin Heidelberg New York, pp 505-519
35. J. L. Fiadeiro, A. Lopes (1999) Algebraic semantics of coordination, or what is in a signature? In: A. Haeberer (ed) Algebraic Methodology and Software Technology. LNCS, vol 1548. Springer, Berlin Heidelberg New York, pp 293-307
36. J. L. Fiadeiro, A. Lopes, T. Maibaum (1997) Synthesising interconnections. In: R. Bird, L. Meertens (eds) Algorithmic Languages and Calculi. Chapman Hall, London, pp 240-264
37. J. L. Fiadeiro, A. Lopes, M. Wermelinger (2003) A mathematical semantics for architectural connectors. In: R. Backhouse, J. Gibbons (eds) Generic Programming. LNCS, vol 2793. Springer, Berlin Heidelberg New York, pp 90-234
38. J. L. Fiadeiro, T. Maibaum (1991) Describing, structuring, and implementing objects. In: J. deBakker, W. deRoever, G. Rozenberg (eds) Foundations of Object-Oriented Languages. LNCS, vol 489. Springer, Berlin Heidelberg New York, pp 274-310
39. J. L. Fiadeiro, T. Maibaum (1992) Temporal theories as modularisation units for concurrent system specification. Formal Aspects of Computing 4(3):239-272
40. J. L. Fiadeiro, T. Maibaum (1995) Verifying for reuse: foundations of object-oriented system verification. In: C. Hankin, I. Makie, R. Nagarajan (eds) Theory and Formal Methods. World Scientific Publishing Company, Singapore, pp 235-257
41. J. L. Fiadeiro, T. Maibaum (1995) Interconnecting formalisms: supporting modularity, reuse and incrementality. In: G. E. Kaiser (ed) ACM S1GSOFT Software Engineering Notes 20(4):72-80
42. J. L. Fiadeiro, T. Maibaum (1996) A mathematical toolbox for the software architect. In: Proc. 8th Int. Workshop on Software Specification and Design. IEEE Computer Society Press, Silver Spring, MD, pp 46-55
43. J. L. Fiadeiro, T. Maibaum (1996) Design structures for object-based systems. In: S. Goldsack, S. Kent (eds) Formal Methods and Object Technology. Springer, Berlin Heidelberg New York, pp 183-204
44. J. L. Fiadeiro, T. Maibaum (1997) Categorical semantics of parallel program design. Science of Computer Programming 28 (2-3):111-138
45. J. L. Fiadeiro, A. Sernadas (1988) Structuring theories on consequence. In: D. Sannella, A. Tarlecki (eds) Recent Trends in Data Type Specification. LNCS, vol 332. Springer, Berlin Heidelberg New York, pp 44-72
46. J. L. Fiadeiro, A. Sernadas, C. Sernadas (1988) Knowledge bases as structured theories. In: K. Nori, S. Kumar (eds) Foundations of Software Technology and Theoretical Computer Science. LNCS, vol 338. Springer, Berlin Heidelberg New York, pp 469-486
47. P. Fingar (2000) Component-based frameworks for e-commerce. Communications ACM 43(10):61-66
48. N. Francez, I. Forman (1996) Interacting Processes. Addison-Wesley, Reading, MA
49. P. Freyd, A. Scedrov (1990) Categories, Allegories. North-Holland, Amsterdam
50. D. Garlan, D. Perry (1994) Software architecture: practice, potential, and pitfalls. In: Proc. 16th International Conference on Software Engineering. IEEE Computer Society Press, Silver Spring, MD, pp 363-364
51. D. Gelernter, N. Carriero (1992) Coordination languages and their significance. Communications ACM 35(2):97-107
52. J. Goguen (1971) Mathematical representation of hierarchically organised systems. In: E. Attinger (ed) Global Systems Dynamics. Krüger, New York, pp 112-128
53. J. Goguen (1973) Categorical foundations for general systems theory. In: F. Pichler, R. Trappl (eds) Advances in Cybernetics and Systems Research. Transcripta Books, New York, pp 121-130
54. J. Goguen (1975) Objects. International Journal of General Systems l (4):237-243
55. J. Goguen (1986) Reusing and interconnecting software components. IEEE Computer 19(2):16-28
56. J. Goguen (1989) Principles of parametrised programming. In: T. J. Biggerstaff, A. J. Perlis (eds) Software Reusability. Addison-Wesley, Reading, MA, pp 159-225
57. J. Goguen (1991) A categorical manifesto. Mathematical Structures in Computer Science l (1):49-67
58. J. Goguen (1991) Sheaf semantics of concurrent interacting objects. Mathematical Structures in Computer Science 1(2):159-191
59. J. Goguen (1996) Parametrised programming and software architecture. In: Proc. 4th International Conference on Software Reuse. IEEE Computer Society Press, Silver Spring, MD, pp 2-11
60. J. Goguen, R. Burstall (1984) Some fundamental algebraic tools for the semantics of computation, part 1: comma categories, colimits, signatures and theories. Theoretical Computer Science 31(2):175-209
61. J. Goguen, R. Burstall (1984) Some fundamental algebraic tools for the semantics of computation, part 2: signed and abstract theories. Theoretical Computer Science 31(3):263-295
62. J. Goguen, R. Burstall (1992) Institutions: abstract model theory for specification and programming. Journal ACM 39(1):95-146
63. J. Goguen, R. Burstall (1986) A study in the foundations of programming methodology: specfications, institutions, charters and parchments. In: D. Pitt et al. (eds) Category Theory and Computer Programming. LNCS, vol 240. Springer, Berlin Heidelberg New York, pp 313-333
64. J. Goguen, S. Ginali (1978) A categorical approach to general systems theory. In: G. Klir (ed) Applied General Systems Research. Plenum, New York, pp 257-270
65. J. Goguen, J. Thatcher, E. Wagner (1978) An initial algebra approach to the specification, correctness and implementation of abstract data types. In: R. Yeh (ed) Current Trends in Programming Methodology IV. Prentice Hall, London, pp 80-149
66. J. Goguen, J. Thatcher E. Wagner, J. Wright (1973) wA junction between computer science and category theory I: basic concepts and examples. Technical report, IBM Watson Research Center, Yorktown Heights NY, Report RC 4526 (part 1) and 5908 (part 2)
67. R. Goldblatt (1987) Logics of Time and Computation. CSLI, Stanford
68. R. Goldblatt (1989) Topoi: The Categorial Analysis of Logic. North-Holland, Amsterdam
69. C. A. R. Hoare (1985) Communicating Sequential Processes. Prentice Hall, London
70. B. Jacobs (2001) Categorical Logic and Type Theory. Elsevier, Amsterdam
71. S. Johnson (2001) Emergence: The Connected Lives of Ants, Brains, Cities and Software. Penguin, London
72. S. Katz (1993) A superimposition control construct for distributed systems. ACMTOPLAS 15(2):337-35
73. W. Kent (1993) Participants and performers: a basis for classifying object models. In: Proc. OOPSLA 1993 Workshop on Specification of Behavioral Semantics in Object-Oriented Information Modeling
74. J. Lambek, P. Scott (1986) Introduction to Higher-Order Categorical Logic. Cambridge University Press, Cambridge
75. F. W. Lawvere, S. H. Schanuel (1997) Conceptual Mathematics - A First Introduction to Categories. Cambridge University Press, Cambridge
76. J. Loeckx, H.-D. Ehrich, M. Wolf (1996) Specification of Abstract Data Types. Wiley, New York
77. A. Lopes, J. L. Fiadeiro (1999) Using explicit state to describe architectures. In: E. Astesiano (ed) Fundamental Approaches to Software Engineering. LNCS, vol 1577. Springer, Berlin Heidelberg New York, pp 144-160
78. A. Lopes, J. L. Fiadeiro (2004) Superposition: composition vs refinement of non-deterministic action-based systems. Formal Aspects of Computing 16(1):5-18
79. A. Lopes, M. Wermelinger, J. L. Fiadeiro (2003) Higher-order architectural connectors. ACM TOSEM 12(1):64-104
80. S. MacLane (1971) Categories for the Working Mathematician. Springer, Berlin Heidelberg New York
81. J. Magee, J. Kramer, M. Sloman (1989) Constructing distributed systems in Conic. IEEE TOSE 15(6):663-675
82. T. Maibaum, P. Veloso, M. Sadler (1985) A theory of abstract data types for program development: bridging the gap? In: H. Ehrig et al. (eds) Formal Methods and Software Development. LNCS, vol 186. Springer, Berlin Heidelberg New York, pp 214-230
83. Z. Manna, P. Wolper (1984) Synthesis of communicating processes from temporal logic specifications. In: ACM TOPLAS 6(1):68-93
84. N. Mehta, N. Medvidovic, S. Phadke (2000) Towards a taxonomy of software connectors. In: Proc. 22nd International Conference on Software Engineering. IEEE Computer Society Press, Silver Spring, MD, pp 178-187
85. J. Meseguer (1989) General logics. In: H.-D. Ebbinghaus et al. (eds) Logic Colloquium 87. North-Holland, Amsterdam, pp 275-329
86. B. Meyer (1992) Object-Oriented Software Construction. Addison-Wesley, Reading, MA
87. M. Moriconi, X. Qian (1994) Correctness and composition of software architectures. ACM SIGSOFT Software Engineering Notes 19(5):164-174
88. D. Perry, A. Wolf (1992) Foundations for the study of software architectures. ACM SIGSOFT Software Engineering Notes 17(4):40-52
89. B. Pierce (1991) Basic Category Theory for Computer Scientists. MIT Press, Cambridge, MA
90. D. Pitt, S. Abramsky, A. Poigné, D. Rydeheard (eds) (1985) Category Theory and Computer Programming. LNCS, vol 240. Springer, Berlin Heidelberg New York
91. A. Poigne (1992) Basic category theory. In: Handbook of Logic in Computer Science, vol 1. Oxford University Press, pp 413-640
92. H. Reichel (1987) Initial Computability, Algebraic Specifications, and Partial Algebras. Oxford University Press
93. G.-C. Roman, P. J. McCann, J. Y. Plun (1997) Mobile UNITY: reasoning and specification in mobile computing. ACM TOSEM 6(3):250-282
94. R. Rosen (2000) Life Itself. Columbia University Press, New York
95. D. Sannella, A. Tarlecki (1988) Building specifications in an arbitrary institution. Information and Control 76:165-210
96. D. Sannella, S. Sokolowski, A. Tarlecki (1992) Toward formal development of programs from algebraic specifications: parameterisation revisited. Acta Informatica 29:689-736
97. V. Sassone, M. Nielsen, G. Winskel (1996) Models for concurrency: towards a classification. Theoretical Computer Science 170:277-296
98. M. Shaw (1996) Procedure calls are the assembly language of software interconnection: connectors deserve first-class status. In: D. A. Lamb (ed) Studies of Software Design. LNCS, vol 1078. Springer, Berlin Heidelberg New York, pp 17-32
99. M. Shaw, D. Garlan (1996) Software Architecture: Perspectives on an Emerging Discipline. Prentice Hall, London
100. D. Smith (1993) Constructing specification morphisms. Journal of Symbolic Computation 15 (5-6):571-606
101. Y. Srinivas, R. Jüllig (1995) Specware™: formal support for composing software. In: B. Möller (ed) Mathematics of Program Construction. LNCS, vol 947. Springer, Berlin Heidelberg New York, pp 399-422
102. A. Tarlecki, R. Burstall, J. Goguen (1991) Some fundamental algebraic tools for the semantics of computation, part 3: indexed categories. Theoretical Computer Science 91:239-264
103. P. Veloso, T. Maibaum, M. Sadler (1985) Program development and theory manipulation. Proc. Third Int. Workshop on Software Specification and Design. IEEE Computer Society Press, Silver Spring, MD, pp 228-232
104. P. Veloso, T. Maibaum (1995) On the modularisation theorem for logical specifications. Information Processing Letters 53:287-293
105. R. Walters (1991) Categories and Computer Science. Cambridge Computer Science Texts
106. G. Winskel (1984) Synchronization trees. Theoretical Computer Science 34:33-82
107. G. Winskel (1985) Categories of models for concurrency. In: S. D. Brookes et al. (eds) Seminar on Concurrency. LNCS, vol 197. Springer, Berlin Heidelberg New York, pp 246-267
108. G. Winskel (1987) Petri nets, algebras, morphisms and compositionality. In: Information and Computation 72:197-238
109. G. Winskel, M. Nielsen (1995) Models for concurrency. In: S. Abramsky, D. Gabbay, T. Maibaum (eds) Handbook of Logic in Computer Science, vol 4, Oxford University Press, pp 1-148
110. P. Wolper (1989) On the relation of programs and computations to models of temporal logic. In: B. Banieqbal, H. Barringer, A. Pnueli (eds) Temporal Logic in Specification. LNCS, vol 398. Springer, Berlin Heidelberg New York, pp 75-123
111. P. Zave (1993) Feature interactions and formal specifications in telecommunications. IEEE Computer XXVI (8):20-30
112. P. Zave, M. Jackson (1993) Conjunction as composition. ACM TOSEM 2(4):371-411