{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:24:43Z","timestamp":1725549883343},"publisher-location":"Berlin, Heidelberg","reference-count":49,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291312"},{"type":"electronic","value":"9783540319399"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561163_2","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T10:54:31Z","timestamp":1127818471000},"page":"23-48","source":"Crossref","is-referenced-by-count":1,"title":["A Perspective on Component Refinement"],"prefix":"10.1007","author":[{"given":"Lu\u00eds S.","family":"Barbosa","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624162","volume-title":"The B Book: Assigning Programs to Meanings","author":"J.R. Abrial","year":"1996","unstructured":"Abrial, J.R.: The B Book: Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BFb0018361","volume-title":"Category Theory and Computer Science","author":"P. Aczel","year":"1989","unstructured":"Aczel, P., Mendler, N.: A final coalgebra theorem. In: Dybjer, P., Pitts, A.M., Pitt, D.H., Poign\u00e9, A., Rydeheard, D.E. (eds.) Category Theory and Computer Science. LNCS, vol.\u00a0389, pp. 357\u2013365. Springer, Heidelberg (1989)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-39656-7_2","volume-title":"Formal Methods for Components and Objects","author":"F. Arbab","year":"2003","unstructured":"Arbab, F.: Abstract behaviour types: a foundation model for components and their composition. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2002. LNCS, vol.\u00a02852, pp. 33\u201370. Springer, Heidelberg (2003)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/3-540-57499-9_15","volume-title":"Formal Program Development","author":"R.C. Backhouse","year":"1993","unstructured":"Backhouse, R.C., Hoogendijk, P.F.: Elements of a relational theory of datatypes. In: M\u00f6ller, B., Schuman, S., Partsch, H. (eds.) Formal Program Development. LNCS, vol.\u00a0755, pp. 7\u201342. Springer, Heidelberg (1993)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/10704973_2","volume-title":"Advanced Functional Programming","author":"R.C. Backhouse","year":"1999","unstructured":"Backhouse, R.C., Jansson, P., Jeuring, J., Meertens, L.: Generic programming: An introduction. In: Swierstra, S.D., Oliveira, J.N. (eds.) AFP 1998. LNCS, vol.\u00a01608, pp. 28\u2013115. Springer, Heidelberg (1999)"},{"key":"2_CR6","first-page":"397","volume-title":"FMOODS 2000 - Formal Methods for Open Object-Oriented Distributed Systems","author":"L.S. Barbosa","year":"2000","unstructured":"Barbosa, L.S.: Components as processes: An exercise in coalgebraic modeling. In: Smith, S.F., Talcott, C.L. (eds.) FMOODS 2000 - Formal Methods for Open Object-Oriented Distributed Systems, pp. 397\u2013417. Kluwer Academic Publishers, Dordrecht (2000)"},{"issue":"8","key":"2_CR7","first-page":"891","volume":"9","author":"L.S. Barbosa","year":"2003","unstructured":"Barbosa, L.S.: Towards a Calculus of State-based Software Components. Journal of Universal Computer Science\u00a09(8), 891\u2013909 (2003)","journal-title":"Journal of Universal Computer Science"},{"key":"2_CR8","series-title":"Elect. Notes in Theor. Comp. Sci","volume-title":"CMCS 2003","author":"L.S. Barbosa","year":"2003","unstructured":"Barbosa, L.S., Oliveira, J.N.: State-based components made generic. In: Peter Gumm, H. (ed.) CMCS 2003. Elect. Notes in Theor. Comp. Sci, vol.\u00a082(1). Elsevier, Amsterdam (2003)"},{"key":"2_CR9","series-title":"Series on Component-Based Development","volume-title":"Mathematical Frameworks for Component Software: Models for Analysis and Synthesis","author":"L.S. Barbosa","year":"2005","unstructured":"Barbosa, L.S., Sun, M., Aichernig, B.K., Rodrigues, N.: On the semantics of componentware: a coalgebraic perspective. In: He, J., Liu, Z. (eds.) Mathematical Frameworks for Component Software: Models for Analysis and Synthesis. Series on Component-Based Development. World Scientific, Singapore (2005)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-31862-0_6","volume-title":"Theoretical Aspects of Computing - ICTAC 2004","author":"M.A. Barbosa","year":"2005","unstructured":"Barbosa, M.A., Barbosa, L.S.: Specifying software connectors. In: Liu, Z., Araki, K. (eds.) ICTAC 2004. LNCS, vol.\u00a03407, pp. 52\u201367. Springer, Heidelberg (2005)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0074299","volume":"47","author":"J. Benabou","year":"1967","unstructured":"Benabou, J.: Introduction to bicategories. Springer Lect. Notes Maths.\u00a0(47), 1\u201377 (1967)","journal-title":"Springer Lect. Notes Maths."},{"key":"2_CR12","unstructured":"van Benthem, J.: Modal Correspondence Theory. Ph.D. thesis, University of Amsterdam (1976)"},{"key":"2_CR13","first-page":"189","volume-title":"Foundations of Component-Based Systems","author":"K. Bergner","year":"2000","unstructured":"Bergner, K., Rausch, A., Sihling, M., Vilbig, A., Broy, M.: A Formal Model for Componentware. In: Leavens, G.T., Sitaraman, M. (eds.) Foundations of Component-Based Systems, pp. 189\u2013210. Cambridge University Press, Cambridge (2000)"},{"key":"2_CR14","series-title":"Series in Computer Science","volume-title":"Functional Programming Using Haskell","author":"R. Bird","year":"1998","unstructured":"Bird, R.: Functional Programming Using Haskell. Series in Computer Science. Prentice-Hall International, Englewood Cliffs (1998)"},{"key":"2_CR15","series-title":"Series in Computer Science","volume-title":"The Algebra of Programming","author":"R. Bird","year":"1997","unstructured":"Bird, R., Moor, O.: The Algebra of Programming. Series in Computer Science. Prentice-Hall International, Englewood Cliffs (1997)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Broy, M.: Semantics of finite and infinite networks of communicating agents. Distributed Computing\u00a0(2) (1987)","DOI":"10.1007\/BF01786252"},{"issue":"35","key":"2_CR17","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/129630.129635","volume":"2","author":"D. Gelernter","year":"1992","unstructured":"Gelernter, D., Carrier, N.: Coordination languages and their significance. Communication of the ACM\u00a02(35), 97\u2013107 (1992)","journal-title":"Communication of the ACM"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF00289507","volume":"1","author":"C.A.R. Hoare","year":"1972","unstructured":"Hoare, C.A.R.: Proof of correctness of data representations. Acta Informatica\u00a01, 271\u2013281 (1972)","journal-title":"Acta Informatica"},{"key":"2_CR19","unstructured":"Hoogendijk, P.F.: A generic theory of datatypes. Ph.D. thesis, Department of Computing Science, Eindhoven University of Technology (1996)"},{"key":"2_CR20","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/978-1-4613-1437-0_5","volume-title":"Object-Orientation with Parallelism and Persistence","author":"B. Jacobs","year":"1996","unstructured":"Jacobs, B.: Objects and classes, co-algebraically. In: Lengauer, C., Freitag, B., Jones, C.B., Schek, H.-J. (eds.) Object-Orientation with Parallelism and Persistence, pp. 83\u2013103. Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Jacobs, B., Hughes, J.: Simulations in coalgebra. In: Peter Gumm, H. (ed.) CMCS 2003, Warsaw. Elect. Notes in Theor. Comp. Sci, vol.\u00a082(1) (April 2003)","DOI":"10.1016\/S1571-0661(04)80636-4"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-47797-7_7","volume-title":"Algebraic and Coalgebraic Methods in the Mathematics of Program Construction","author":"B. Jacobs","year":"2002","unstructured":"Jacobs, B.: Exercises in coalgebraic specification. In: Blackhouse, R., Crole, R.L., Gibbons, J. (eds.) Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. LNCS, vol.\u00a02297, pp. 237\u2013280. Springer, Heidelberg (2002)"},{"key":"2_CR23","series-title":"Series in Computer Science","volume-title":"Systematic Software Development Using Vdm","author":"C.B. Jones","year":"1986","unstructured":"Jones, C.B.: Systematic Software Development Using Vdm. Series in Computer Science. Prentice-Hall International, Englewood Cliffs (1986)"},{"issue":"2","key":"2_CR24","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0022-4049(96)00012-6","volume":"115","author":"P. Katis","year":"1997","unstructured":"Katis, P., Sabadini, N., Walters, R.F.C.: Bicategories of processes. Journal of Pure and Applied Algebra\u00a0115(2), 141\u2013178 (1997)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"2_CR25","unstructured":"Katis, P., Sabadini, N., Walters, R.F.C.: On the algebra of systems with feedback and boundary. Rendiconti del Circolo Matematico di Palermo\u00a0II(63), 123\u2013156 (2000)"},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01304852","volume":"23","author":"A. Kock","year":"1972","unstructured":"Kock, A.: Strong functors and monoidal monads. Archiv f\u00fcr Mathematik\u00a023, 113\u2013120 (1972)","journal-title":"Archiv f\u00fcr Mathematik"},{"issue":"5","key":"2_CR27","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1002\/j.1538-7305.1955.tb03788.x","volume":"34","author":"G.H. Mealy","year":"1955","unstructured":"Mealy, G.H.: A method for synthesizing sequential circuits. Bell Systems Techn. Jour.\u00a034(5), 1045\u20131079 (1955)","journal-title":"Bell Systems Techn. Jour."},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/3540543961_7","volume-title":"Functional Programming Languages and Computer Architecture","author":"E. Meijer","year":"1991","unstructured":"Meijer, E., Fokkinga, M., Paterson, R.: Functional programming with bananas, lenses, envelopes and barbed wire. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol.\u00a0523, pp. 124\u2013144. Springer, Heidelberg (1991)"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-27815-3_38","volume-title":"Algebraic Methodology and Software Technology","author":"S. Meng","year":"2004","unstructured":"Meng, S., Barbosa, L.S.: On refinement of generic software components. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol.\u00a03116, pp. 506\u2013520. Springer, Heidelberg (2004); Best Student Co-authored paper Award"},{"key":"2_CR30","unstructured":"Meng, S., Barbosa, L.S.: Components as coalgebras: The refinement dimension. Theor. Comp. Sci. (2005) (accepted for publication)"},{"key":"2_CR31","series-title":"Series in Computer Science","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Series in Computer Science. Prentice-Hall International, Englewood Cliffs (1989)"},{"key":"2_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-540-39656-7_14","volume-title":"Formal Methods for Components and Objects","author":"O. Nierstrasz","year":"2003","unstructured":"Nierstrasz, O., Achermann, F.: A calculus for modeling software components. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2002. LNCS, vol.\u00a02852, pp. 339\u2013360. Springer, Heidelberg (2003)"},{"key":"2_CR33","volume-title":"Jini in a Nutshell","author":"S. Oaks","year":"2000","unstructured":"Oaks, S., Wong, H.: Jini in a Nutshell. O\u2019Reilly and Associates, Sebastopol (2000)"},{"issue":"1","key":"2_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01888215","volume":"2","author":"J.N. Oliveira","year":"1990","unstructured":"Oliveira, J.N.: A reification calculus for model-oriented software specification. Formal Aspects of Computing\u00a02(1), 1\u201323 (1990)","journal-title":"Formal Aspects of Computing"},{"key":"2_CR35","first-page":"140","volume-title":"Proc. of the BCS FACS 5th Refinement Workshop, Theory and Practice of Formal Software Development, London, UK","author":"J.N. Oliveira","year":"1992","unstructured":"Oliveira, J.N.: Software reification using the Sets calculus. In: Proc. of the BCS FACS 5th Refinement Workshop, Theory and Practice of Formal Software Development, London, UK, January 8-10, pp. 140\u2013171. Springer, Heidelberg (1992)"},{"key":"2_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-540-27764-4_18","volume-title":"Mathematics of Program Construction","author":"J.N. Oliveira","year":"2004","unstructured":"Oliveira, J.N., Rodrigues, C.J.: Transposing relations: From maybe functions to hash tables. In: Kozen, D. (ed.) MPC 2004. LNCS, vol.\u00a03125, pp. 334\u2013356. Springer, Heidelberg (2004)"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Papadopoulos, G., Arbab, F.: Coordination models and languages. In: Advances in Computers \u2014 The Engineering of Large Systems, vol.\u00a046, pp. 329\u2013400 (1998)","DOI":"10.1016\/S0065-2458(08)60208-9"},{"key":"2_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 561\u2013572. Springer, Heidelberg (1981)"},{"issue":"1","key":"2_CR39","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1051\/ita:2001109","volume":"35","author":"E. Poll","year":"2001","unstructured":"Poll, E.: A coalgebraic semantics of subtyping. Theorectical Informatica and Apllications\u00a035(1), 61\u201382 (2001)","journal-title":"Theorectical Informatica and Apllications"},{"key":"2_CR40","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1017\/S0960129500000694","volume":"5","author":"H. Reichel","year":"1995","unstructured":"Reichel, H.: An approach to object semantics based on terminal co-algebras. Math. Struct. in Comp. Sci.\u00a05, 129\u2013152 (1995)","journal-title":"Math. Struct. in Comp. Sci."},{"key":"2_CR41","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511663079","volume-title":"Data Refinement: Model-Oriented Proof Methods and their Comparison","author":"W.-P. Roever de","year":"1998","unstructured":"de Roever, W.-P., Engelhardt, K.: Data Refinement: Model-Oriented Proof Methods and their Comparison, vol.\u00a047. Cambridge University Press, Cambridge (1998)"},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"Rutten, J.: Universal coalgebra: A theory of systems. Theor. Comp. Sci., 249(1), 3\u201380 (Revised version of CWI Techn. Rep. CS-R9652 (2000)","DOI":"10.1016\/S0304-3975(00)00056-6"},{"key":"2_CR43","first-page":"13","volume-title":"Software Architectures - Advances and Applications","author":"J.-G. Schneider","year":"1999","unstructured":"Schneider, J.-G., Nierstrasz, O.: Components, scripts, glue. In: Barroca, L., Hall, J., Hall, P. (eds.) Software Architectures - Advances and Applications, pp. 13\u201325. Springer, Heidelberg (1999)"},{"key":"2_CR44","unstructured":"Segerberg, K.: An essay in classical modal logic. Filosofiska Studier\u00a0(13) (1971)"},{"key":"2_CR45","series-title":"Series in Computer Science","volume-title":"The Z Notation: A Reference Manual","author":"J.M. Spivey","year":"1992","unstructured":"Spivey, J.M.: The Z Notation: A Reference Manual, 2nd edn. Series in Computer Science. Prentice Hall International, Englewood Cliffs (1992)","edition":"2"},{"key":"2_CR46","volume-title":"Component Software, Beyond Object-Oriented Programming","author":"C. Szyperski","year":"1998","unstructured":"Szyperski, C.: Component Software, Beyond Object-Oriented Programming. Addison-Wesley, Reading (1998)"},{"key":"2_CR47","unstructured":"The RAISE Language Group. In: The RAISE Specification Language. Prentice Hall International, Englewood Cliffs (1992)"},{"issue":"5","key":"2_CR48","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1017\/S0960129598002588","volume":"8","author":"D. Turi","year":"1998","unstructured":"Turi, D., Rutten, J.: On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces. Math. Struct. in Comp. Sci.\u00a08(5), 481\u2013540 (1998)","journal-title":"Math. Struct. in Comp. Sci."},{"key":"2_CR49","unstructured":"Wadler, P., Weihe, K.: Component-based programming under different paradigms. Technical report, Dagstuhl Seminar 99081 (February 1999)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Components and Objects"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561163_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T19:14:32Z","timestamp":1586459672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561163_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291312","9783540319399"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/11561163_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}