{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T14:43:32Z","timestamp":1778597012345,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540799795","type":"print"},{"value":"9783540799801","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79980-1_25","type":"book-chapter","created":{"date-parts":[[2008,7,28]],"date-time":"2008-07-28T15:55:42Z","timestamp":1217260542000},"page":"330-345","source":"Crossref","is-referenced-by-count":11,"title":["Domain Axioms for a Family of Near-Semirings"],"prefix":"10.1007","author":[{"given":"Jules","family":"Desharnais","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Struth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"http:\/\/www.dcs.shef.ac.uk\/~georg\/ka"},{"key":"25_CR2","unstructured":"Prover9 and Mace4, \n                  \n                    http:\/\/www.cs.unm.edu\/~mccune\/prover9"},{"issue":"4","key":"25_CR3","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s002360050163","volume":"36","author":"R.J.R. Back","year":"1999","unstructured":"Back, R.J.R., von Wright, J.: Reasoning algebraically about loops. Acta Informatica\u00a036(4), 295\u2013334 (1999)","journal-title":"Acta Informatica"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/B978-044482830-9\/50023-0","volume-title":"Handbook of Process Algebra","author":"J.A. Bergstra","year":"2001","unstructured":"Bergstra, J.A., Fokkink, W.J., Ponse, A.: Process algebra with recursive operations. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 333\u2013389. Elsevier, Amsterdam (2001)"},{"issue":"4","key":"25_CR5","doi-asserted-by":"crossref","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 TOCL\u00a07(4), 798\u2013833 (2006)","journal-title":"ACM TOCL"},{"key":"#cr-split#-25_CR6.1","unstructured":"Desharnais, J., Struth, G.: Domain semirings revisited. Technical Report CS-08-01, Department of Computer Science, University of Sheffield (2008);"},{"key":"#cr-split#-25_CR6.2","unstructured":"Accepted for Mathematics of Program Construction (MPC) (2008)"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-540-78913-0_10","volume-title":"Relations and Kleene Algebra in Computer Science","author":"H. Furusawa","year":"2008","unstructured":"Furusawa, H., Tsumagari, N., Nishizawa, K.: A non-probabilistic model of probabilistic Kleene algebra. In: Berghammer, R., M\u00f6ller, B., Struth, G. (eds.) Relations and Kleene Algebra in Computer Science. LNCS, vol.\u00a04988, pp. 110\u2013122. Springer, Heidelberg (2008)"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1023\/A:1027311011342","volume":"75","author":"V. Goranko","year":"2003","unstructured":"Goranko, V.: The basic algebra of game equivalences. Studia Logica\u00a075, 221\u2013238 (2003)","journal-title":"Studia Logica"},{"key":"25_CR9","first-page":"197","volume":"201","author":"P. H\u00f6fner","year":"2007","unstructured":"H\u00f6fner, P., Struth, G.: Can refinement be automated? ENTCS\u00a0201, 197\u2013222 (2007)","journal-title":"ENTCS"},{"issue":"1","key":"25_CR10","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/343369.343378","volume":"1","author":"D. Kozen","year":"2000","unstructured":"Kozen, D.: On Hoare logic and Kleene algebra with tests. ACM TOCL\u00a01(1), 60\u201376 (2000)","journal-title":"ACM TOCL"},{"issue":"1","key":"25_CR11","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.jlap.2007.10.005","volume":"76","author":"A.K. McIver","year":"2008","unstructured":"McIver, A.K., Gonzalia, C., Cohen, E., Morgan, C.C.: Using probabilistic Kleene algebra pKA for protocol verification. J. Logic and Algebraic Programming\u00a076(1), 90\u2013111 (2008)","journal-title":"J. Logic and Algebraic Programming"},{"key":"25_CR12","first-page":"177","volume":"201","author":"L. Meinicke","year":"2007","unstructured":"Meinicke, L., Solin, K.: Refinement algebra for probabilistic programs. ENTCS\u00a0201, 177\u2013195 (2007)","journal-title":"ENTCS"},{"issue":"2","key":"25_CR13","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.scico.2006.01.010","volume":"65","author":"B. M\u00f6ller","year":"2007","unstructured":"M\u00f6ller, B.: Kleene getting lazy. Sc. Computer Programming\u00a065(2), 195\u2013214 (2007)","journal-title":"Sc. Computer Programming"},{"key":"25_CR14","volume-title":"Near-Rings: The Theory and Its Application","author":"G. Pilz","year":"1983","unstructured":"Pilz, G.: Near-Rings: The Theory and Its Application. North-Holland, Amsterdam (1983)"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/11783596_23","volume-title":"Mathematics of Program Construction","author":"K. Solin","year":"2006","unstructured":"Solin, K., von Wright, J.: Refinement algebra with operators for enabledness and termination. In: Uustalu, T. (ed.) MPC 2006. LNCS, vol.\u00a04014, pp. 397\u2013415. Springer, Heidelberg (2006)"},{"issue":"1-2","key":"25_CR16","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. Sc. Computer Programming\u00a051(1-2), 23\u201345 (2004)","journal-title":"Sc. Computer Programming"}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79980-1_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:35:25Z","timestamp":1619523325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79980-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540799795","9783540799801"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79980-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}