{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:58:05Z","timestamp":1743116285277,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642272684"},{"type":"electronic","value":"9783642272691"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-27269-1_20","type":"book-chapter","created":{"date-parts":[[2012,1,17]],"date-time":"2012-01-17T00:52:10Z","timestamp":1326761530000},"page":"300-303","source":"Crossref","is-referenced-by-count":3,"title":["Towards Linear Algebras of Components"],"prefix":"10.1007","author":[{"given":"Hugo Daniel","family":"Macedo","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 Nuno","family":"Oliveira","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MC.2010.22","volume":"43","author":"D.L. Parnas","year":"2010","unstructured":"Parnas, D.L.: Really rethinking \u2019formal methods\u2019. IEEE Computer\u00a043(1), 28\u201334 (2010)","journal-title":"IEEE Computer"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Distefano, S., Longo, F., Scarpa, M.: Availability assessment of ha standby redundant clusters. In: 29th IEEE Int. Symp. on Reliable Distributed Systems (2010)","DOI":"10.1109\/SRDS.2010.37"},{"key":"20_CR3","unstructured":"Sernadas, A., Ramos, J., Mateus, P.: Linear algebra techniques for deciding the correctness of probabilistic programs with bounded resources. Technical report, TU Lisbon, Short paper, LPAR, Doha, Qatar (November 22-27, 2008)"},{"key":"20_CR4","unstructured":"Macedo, H., Oliveira, J.: Can we teach computers to generate fast OLAP code? Technical note (May 2010), \n                  \n                    http:\/\/wiki.di.uminho.pt"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Trcka, N.: Strong, weak and branching bisimulation for transition systems and Markov reward chains: A unifying matrix approach. In: Andova, S.E. (ed.) Proc. 1st Workshop on Quantitative Formal Methods: Theory and Applications (December 2009)","DOI":"10.4204\/EPTCS.13.5"},{"key":"20_CR6","volume-title":"Regular Algebra and Finite Machines","author":"J. Conway","year":"1971","unstructured":"Conway, J.: Regular Algebra and Finite Machines. Chap.& Hall, London (1971)"},{"key":"20_CR7","unstructured":"Backhouse, R.: Mathematics of Program Construction, 608 pages. Univ. of Nottingham (2004) Draft of book in preparation"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF00370681","volume":"50","author":"R. Maddux","year":"1991","unstructured":"Maddux, R.: The origin of relation algebras in the development and axiomatization of the calculus of relations. Studia Logica\u00a050, 421\u2013455 (1991)","journal-title":"Studia Logica"},{"key":"20_CR9","series-title":"Mathematical Library","volume-title":"Categories, Allegories","author":"P. Freyd","year":"1990","unstructured":"Freyd, P., Scedrov, A.: Categories, Allegories. Mathematical Library, vol.\u00a039. North-Holland, Amsterdam (1990)"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF00122683","volume":"4","author":"S.L. Bloom","year":"1996","unstructured":"Bloom, S.L., Sabadini, N., Walters, R.F.C.: Matrices, machines and behaviors. Applied Categorical Structures\u00a04, 343\u2013360 (1996), doi:10.1007\/BF00122683","journal-title":"Applied Categorical Structures"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-13321-3_16","volume-title":"Mathematics of Program Construction","author":"H. Macedo","year":"2010","unstructured":"Macedo, H., Oliveira, J.: Matrices As Arrows! A Biproduct Approach to Typed Linear Algebra. In: Bolduc, C., Desharnais, J., Ktari, B. (eds.) MPC 2010. LNCS, vol.\u00a06120, pp. 271\u2013287. Springer, Heidelberg (2010)"},{"key":"20_CR12","volume-title":"Categories for the Working Mathematician (Graduate Texts in Mathematics)","author":"S. MacLane","year":"1998","unstructured":"MacLane, S.: Categories for the Working Mathematician (Graduate Texts in Mathematics). Springer, Heidelberg (September 1998)"},{"key":"20_CR13","volume-title":"Information and Computation","author":"F. Bonchi","year":"2010","unstructured":"Bonchi, F., Silva, A., Bonsangue, M., Rutten, J.: Quantitative Kleene coalgebras. In: Information and Computation. Academic Press, London (November 2010) ISSN: 0890-5401"}],"container-title":["Lecture Notes in Computer Science","Formal Aspects of Component Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27269-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T20:21:02Z","timestamp":1556137262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27269-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642272684","9783642272691"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27269-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}