{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T10:32:13Z","timestamp":1770287533149,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642396977","type":"print"},{"value":"9783642396984","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-39698-4_13","type":"book-chapter","created":{"date-parts":[[2013,7,24]],"date-time":"2013-07-24T17:03:05Z","timestamp":1374685385000},"page":"213-226","source":"Crossref","is-referenced-by-count":2,"title":["Generic Models of the Laws of Programming"],"prefix":"10.1007","author":[{"given":"Tony","family":"Hoare","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Roscoe, A.W.: Laws of occam programming, Tech Mon PRG-53. Oxford University (1986)"},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.2307\/2268577","volume":"6","author":"A. Tarski","year":"1941","unstructured":"Tarski, A.: On the Calculus of Relations. J. Symbolic Logic\u00a06(3), 73\u201389 (1941)","journal-title":"J. Symbolic Logic"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Hoare, T.: Unifying Semantics for Concurrent Programming (to appear, 2013)","DOI":"10.1007\/978-3-642-38164-5_10"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A Theory of Communicating Sequential Processes. JACM\u00a031, 560\u2013599 (1984)","journal-title":"JACM"},{"key":"13_CR5","volume-title":"A Discipline of Programming","author":"E.W. Dijkstra","year":"1976","unstructured":"Dijkstra, E.W.: A Discipline of Programming. Prentice Hall, Englewood Cliffs (1976)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Pratt, V.: The Pomset Model of Parallel Processses: Unifying the Temporal and the Spatial. Stanford University, STAN-CS-85-1049 (January 1985)","DOI":"10.1007\/3-540-15670-4_9"},{"issue":"10","key":"13_CR7","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C.A.R. Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An Axiomatic Basis for Computer Programming. Comm. ACM\u00a012(10), 576\u2013580 (1969)","journal-title":"Comm. ACM"},{"issue":"8","key":"13_CR8","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/27651.27653","volume":"30","author":"C.A.R. Hoare","year":"1987","unstructured":"Hoare, C.A.R., Hayes, I.J., He, J., Morgan, C., Roscoe, A.W., Sanders, J.W., S\u00f8rensen, I.H., Spivey, J.M., Sufrin, B.: Laws of Programming. Comm. ACM\u00a030(8), 672\u2013687 (1987)","journal-title":"Comm. ACM"},{"key":"13_CR9","unstructured":"Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice Hall (1998)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-540-28644-8_4","volume-title":"CONCUR 2004 - Concurrency Theory","author":"P.W. O\u2019Hearn","year":"2004","unstructured":"O\u2019Hearn, P.W.: Resources, Concurrency and Local Reasoning. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 49\u201367. Springer, Heidelberg (2004)"},{"key":"13_CR11","unstructured":"Plotkin, G.D.: A Structural Approach to Operational Semantics. DAIMI FN-16 Computer Science Department Aarhus University (1981)"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"13_CR13","unstructured":"Hennessy, M.: Algebraic Theory of Processes. MIT Press (1988)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Baeten, J.C.M., Basten, T., Reniers, M.A.: Process Algebra: Equational Theories of Communicating Processes. Cambridge University Press (2010)","DOI":"10.1017\/CBO9781139195003"},{"issue":"17","key":"13_CR15","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1016\/j.ipl.2009.06.003","volume":"109","author":"I. Wehrman","year":"2009","unstructured":"Wehrman, I., Hoare, C.A.R., O\u2019Hearn, P.: Graphical models of separation logic. IPL\u00a0109(17), 1001\u20131004 (2009)","journal-title":"IPL"},{"key":"13_CR16","unstructured":"Hoare, T., Wickerson, J.: Unifying Models of Data Flow. Software and Systems Safety, pp. 211\u2013230. IOS Press (2011)"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-23217-6_17","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"C.A.R. Hoare","year":"2011","unstructured":"Hoare, C.A.R., Hussain, A., M\u00f6ller, B., O\u2019Hearn, P.W., Petersen, R.L., Struth, G.: On Locality and the Exchange Law for Concurrent Processes. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol.\u00a06901, pp. 250\u2013264. Springer, Heidelberg (2011)"},{"issue":"6","key":"13_CR18","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., Moeller, 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."},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-642-31113-0_2","volume-title":"Mathematics of Program Construction","author":"T. Hoare","year":"2012","unstructured":"Hoare, T., van Staden, S.: The Laws of Programming Unify Process Calculi. In: Gibbons, J., Nogueira, P. (eds.) MPC 2012. LNCS, vol.\u00a07342, pp. 7\u201322. Springer, Heidelberg (2012)"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-35705-3_4","volume-title":"Unifying Theories of Programming","author":"S. Staden van","year":"2013","unstructured":"van Staden, S., Hoare, T.: Algebra Unifies Operational Calculi. In: Wolff, B., Gaudel, M.-C., Feliachi, A. (eds.) UTP 2012. LNCS, vol.\u00a07681, pp. 88\u2013104. Springer, Heidelberg (2013)"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Back, R.-J., von Wright, J.: Refinement Calculus. Springer Graduate Texts in Computer Science (1998)","DOI":"10.1007\/978-1-4612-1674-2"},{"key":"13_CR22","unstructured":"Morgan, C.: Programming from Specifications. Prentice Hall International (1990)"}],"container-title":["Lecture Notes in Computer Science","Theories of Programming and Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39698-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T03:12:54Z","timestamp":1557976374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39698-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642396977","9783642396984"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39698-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}