{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:30:52Z","timestamp":1725831052052},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319247038"},{"type":"electronic","value":"9783319247045"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-24704-5_13","type":"book-chapter","created":{"date-parts":[[2015,9,24]],"date-time":"2015-09-24T01:31:29Z","timestamp":1443058289000},"page":"209-224","source":"Crossref","is-referenced-by-count":0,"title":["Encoding and Decoding in Refinement Algebra"],"prefix":"10.1007","author":[{"given":"Kim","family":"Solin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,8]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-319-06410-9_6","volume-title":"FM 2014: Formal Methods","author":"A. Armstrong","year":"2014","unstructured":"Armstrong, A., Gomes, V.B.F., Struth, G.: Algebraic principles for rely-guarantee style concurrency verification tools. In: Jones, C., Pihlajasaari, P., Sun, J. (eds.) FM 2014. LNCS, vol.\u00a08442, pp. 78\u201393. Springer, Heidelberg (2014)"},{"key":"13_CR2","unstructured":"Armstrong, A., Gomes, V.B.F., Struth, G.: Kleene algebra with tests and demonic refinement algebras. Archive of Formal Proofs (2014)"},{"issue":"4","key":"13_CR3","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1145\/48022.48023","volume":"10","author":"R.-J. Back","year":"1988","unstructured":"Back, R.-J., Kurki-Suonio, R.: Distributed cooperation with action systems. ACM Trans. Program. Lang. Syst.\u00a010(4), 513\u2013554 (1988)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"5","key":"13_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s001650070008","volume":"12","author":"R.-J. Back","year":"2000","unstructured":"Back, R.-J., von Wright, J.: Encoding, decoding and data refinement. Formal Asp. Comput.\u00a012(5), 313\u2013349 (2000)","journal-title":"Formal Asp. Comput."},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/10722010_4","volume-title":"Mathematics of Program Construction","author":"E. Cohen","year":"2000","unstructured":"Cohen, E.: Separation and reduction. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol.\u00a01837, pp. 45\u201359. Springer, Heidelberg (2000)"},{"issue":"4","key":"13_CR6","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/1183278.1183285","volume":"7","author":"J. Desharnais","year":"2006","unstructured":"Desharnais, J., M\u00f6ller, B., Struth, G.: Kleene algebra with domain. ACM Trans. Comput. Log.\u00a07(4), 798\u2013833 (2006)","journal-title":"ACM Trans. Comput. Log."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.scico.2013.08.008","volume":"85","author":"W. Guttmann","year":"2014","unstructured":"Guttmann, W.: Algebras for correctness of sequential computations. Sci. Comput. Program.\u00a085, 224\u2013240 (2014)","journal-title":"Sci. Comput. Program."},{"key":"13_CR8","unstructured":"Hayes, I.J.: Generalised rely-guarantee concurrency: An algebraic foundation. Unpublished manuscript, The University of Queensland (February 2015)"},{"issue":"6","key":"13_CR9","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.jlap.2011.04.005","volume":"80","author":"T. Hoare","year":"2011","unstructured":"Hoare, T., M\u00f6ller, B., Struth, G., Wehrman, I.: Concurrent Kleene algebra and its foundations. J. Log. Algebr. Program.\u00a080(6), 266\u2013296 (2011)","journal-title":"J. Log. Algebr. Program."},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10270-009-0127-2","volume":"10","author":"P. H\u00f6fner","year":"2011","unstructured":"H\u00f6fner, P., Kh\u00e9dri, R., M\u00f6ller, B.: An algebra of product families. Software and System Modeling\u00a010(2), 161\u2013182 (2011)","journal-title":"Software and System Modeling"},{"key":"13_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-73595-3_19","volume-title":"Automated Deduction \u2013 CADE-21","author":"P. H\u00f6fner","year":"2007","unstructured":"H\u00f6fner, P., Struth, G.: Automated reasoning in Kleene algebra. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol.\u00a04603, pp. 279\u2013294. Springer, Heidelberg (2007)"},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/256167.256195","volume":"19","author":"D. Kozen","year":"1997","unstructured":"Kozen, D.: Kleene algebra with tests. ACM Trans. Program. Lang. Syst.\u00a019(3), 427\u2013443 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.jlap.2007.10.005","volume":"76","author":"A. McIver","year":"2008","unstructured":"McIver, A., Gonzalia, C., Cohen, E., Morgan, C.C.: Using probabilistic Kleene algebra pKA for protocol verification. J. Log. Algebr. Program.\u00a076(1), 90\u2013111 (2008)","journal-title":"J. Log. Algebr. Program."},{"issue":"2","key":"13_CR14","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1017\/S0960129513000625","volume":"25","author":"A. McIver","year":"2015","unstructured":"McIver, A., Meinicke, L., Morgan, C.: Hidden-Markov program algebra with iteration. Mathematical Structures in Computer Science\u00a025(2), 320\u2013360 (2015)","journal-title":"Mathematical Structures in Computer Science"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-540-70594-9_14","volume-title":"Mathematics of Program Construction","author":"L. Meinicke","year":"2008","unstructured":"Meinicke, L., Hayes, I.: Probabilistic choice in refinement algebra. In: Audebaud, P., Paulin-Mohring, C. (eds.) MPC 2008. LNCS, vol.\u00a05133, pp. 243\u2013267. Springer, Heidelberg (2008)"},{"issue":"1","key":"13_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00165-009-0111-1","volume":"22","author":"L. Meinicke","year":"2010","unstructured":"Meinicke, L., Solin, K.: Refinement algebra for probabilistic programs. Formal Asp. Comput.\u00a022(1), 3\u201331 (2010)","journal-title":"Formal Asp. Comput."},{"issue":"4","key":"13_CR17","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/69558.69559","volume":"11","author":"G. Nelson","year":"1989","unstructured":"Nelson, G.: A generalization of Dijkstra\u2019s calculus. ACM Trans. Program. Lang. Syst.\u00a011(4), 517\u2013561 (1989)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.scico.2013.07.002","volume":"92","author":"V. Preoteasa","year":"2014","unstructured":"Preoteasa, V.: Refinement algebra with dual operator. Sci. Comput. Program.\u00a092, 179\u2013210 (2014)","journal-title":"Sci. Comput. Program."},{"issue":"6","key":"13_CR19","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.jlap.2011.04.008","volume":"80","author":"K. Solin","year":"2011","unstructured":"Solin, K.: Normal forms in total correctness for while programs and action systems. J. Log. Algebr. Program.\u00a080(6), 362\u2013375 (2011)","journal-title":"J. Log. Algebr. Program."},{"issue":"3","key":"13_CR20","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s11225-012-9416-9","volume":"100","author":"K. Solin","year":"2012","unstructured":"Solin, K.: Dual choice and iteration in an abstract algebra of action. Studia Logica\u00a0100(3), 607\u2013630 (2012)","journal-title":"Studia Logica"},{"issue":"8","key":"13_CR21","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.scico.2007.11.004","volume":"74","author":"K. Solin","year":"2009","unstructured":"Solin, K., von Wright, J.: Enabledness and termination in refinement algebra. Sci. Comput. Program.\u00a074(8), 654\u2013668 (2009)","journal-title":"Sci. Comput. Program."},{"issue":"1-2","key":"13_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.scico.2003.09.002","volume":"51","author":"J. Wright von","year":"2004","unstructured":"von Wright, J.: Towards a refinement algebra. Sci. Comput. Program.\u00a051(1-2), 23\u201345 (2004)","journal-title":"Sci. Comput. Program."}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24704-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T21:33:04Z","timestamp":1559251984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24704-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319247038","9783319247045"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24704-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}