{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T11:06:01Z","timestamp":1770289561092,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662445839","type":"print"},{"value":"9783662445846","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44584-6_1","type":"book-chapter","created":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T01:21:03Z","timestamp":1408756863000},"page":"1-6","source":"Crossref","is-referenced-by-count":6,"title":["Laws of Programming: The Algebraic Unification of Theories of Concurrency"],"prefix":"10.1007","author":[{"given":"Tony","family":"Hoare","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Bergstra, J., Klop, J.: Fixed point semantics in process algebra. Technical Report IW 208, Mathematical Centre, Amsterdam (1982)"},{"issue":"1-3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J.A. Bergstra","year":"1984","unstructured":"Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Information and Control\u00a060(1-3), 109\u2013137 (1984)","journal-title":"Information and Control"},{"issue":"3","key":"1_CR3","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. Journal of the ACM\u00a031(3), 560\u2013599 (1984)","journal-title":"Journal of the ACM"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Floyd, R.: Assigning meanings to programs. In: Proceedings of Symposium on Applied Mathematics, vol.\u00a019, pp. 19\u201332 (1967)","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"1_CR5","unstructured":"Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice Hall International Series in Computer Science (1998)"},{"issue":"10","key":"1_CR6","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. Communications of the ACM\u00a012(10), 576\u2013580 (1969)","journal-title":"Communications of the ACM"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: Towards a theory of parrallel programming. In: Hoare, C.A.R., Perrott, R.H. (eds.) Operating Systems Techniques, Proceedings of Seminar at Queen\u2019s University, Belfast, Northern Ireland, pp. 61\u201371. Academic Press (1972)","DOI":"10.1007\/978-1-4757-3472-0_6"},{"issue":"10","key":"1_CR8","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/355620.361161","volume":"17","author":"C.A.R. Hoare","year":"1974","unstructured":"Hoare, C.A.R.: Monitors: An operating system structuring concept. Communications of the ACM\u00a017(10), 549\u2013557 (1974)","journal-title":"Communications of the ACM"},{"issue":"8","key":"1_CR9","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C.A.R. Hoare","year":"1978","unstructured":"Hoare, C.A.R.: Communicating sequential processes. Communications of the ACM\u00a021(8), 666\u2013677 (1978)","journal-title":"Communications of the ACM"},{"issue":"2","key":"1_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/358549.358561","volume":"24","author":"C.A.R. Hoare","year":"1981","unstructured":"Hoare, C.A.R.: The emperor\u2019s old clothes. Communications of the ACM\u00a024(2), 75\u201383 (1981)","journal-title":"Communications of the ACM"},{"issue":"8","key":"1_CR11","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. Communications of the ACM\u00a030(8), 672\u2013686 (1987)","journal-title":"Communications of the ACM"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-642-04081-8_27","volume-title":"CONCUR 2009 - Concurrency Theory","author":"C.A.R. Hoare","year":"2009","unstructured":"Hoare, C.A.R., M\u00f6ller, B., Struth, G., Wehrman, I.: Concurrent kleene algebra. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 399\u2013414. Springer, Heidelberg (2009)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R., Wehrman, I., O\u2019Hearn, P.W.: Graphical models of separation logic. In: Engineering Methods and Tools for Software Safety and Security. IOS Press (2009)","DOI":"10.1016\/j.ipl.2009.06.003"},{"key":"1_CR14","unstructured":"INMOS. occam Programming Manual. Prentice Hall (1984)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Ishtiaq, S.S., O\u2019Hearn, P.W.: BI as an assertion language for mutable data structures. In: Proc. of POPL, pp. 14\u201326 (2001)","DOI":"10.1145\/373243.375719"},{"key":"1_CR16","volume-title":"Categories for the working mathematician","author":"S. Mac Lane","year":"1998","unstructured":"Mac Lane, S.: Categories for the working mathematician, 2nd edn. Springer, Heidelberg (1998)","edition":"2"},{"key":"1_CR17","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: Proc. of LICS, pp. 55\u201374 (2002)","DOI":"10.1109\/LICS.2002.1029817"},{"key":"1_CR19","unstructured":"Roscoe, A.W.: Model-checking CSP. In: A Classical Mind: Essays in Honour of C.A.R. Hoare. Prentice Hall International (UK) Ltd. (1994)"},{"key":"1_CR20","unstructured":"Scott, D., Strachey, C.: Toward a mathematical semantics for computer languages. Oxford Programming Research Group Technical Monograph, PRG-6 (1971)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2014 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44584-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T09:41:01Z","timestamp":1746351661000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44584-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445839","9783662445846"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44584-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}