{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:57:02Z","timestamp":1775055422115,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1988,9,1]],"date-time":"1988-09-01T00:00:00Z","timestamp":589075200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9085,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1988,9]]},"DOI":"10.1016\/0304-3975(88)90049-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"177-229","source":"Crossref","is-referenced-by-count":99,"title":["The laws of OCCAM programming"],"prefix":"10.1016","volume":"60","author":[{"given":"A.W.","family":"Roscoe","sequence":"first","affiliation":[]},{"given":"C.A.R.","family":"Hoare","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0304-3975(88)90049-7_BIB1","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1145\/357103.357110","article-title":"A proof system for communicating sequential processes","volume":"2","author":"Apt","year":"1980","journal-title":"ACM Trans. Programming Language Systems"},{"key":"10.1016\/0304-3975(88)90049-7_BIB2","series-title":"Ph.D. Thesis","article-title":"A model for communicating sequential processes","author":"Brookes","year":"1983"},{"key":"10.1016\/0304-3975(88)90049-7_BIB3","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0304-3975(88)90049-7_BIB4","article-title":"Formal Number Theory and Computability","volume":"7","author":"Fisher","year":"1982"},{"key":"10.1016\/0304-3975(88)90049-7_BIB5","article-title":"Algebraic Semantics","volume":"99","author":"Guessarian","year":"1981"},{"key":"10.1016\/0304-3975(88)90049-7_BIB6","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/0304-3975(88)90049-7_BIB7","series-title":"The Occam Programming Manual","year":"1984"},{"issue":"8","key":"10.1016\/0304-3975(88)90049-7_BIB8","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1145\/27651.27653","article-title":"Laws of programming","volume":"30","author":"Hoare","year":"1987","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(88)90049-7_BIB9_1","first-page":"306","article-title":"Denotational semantics for occam","volume":"197","author":"Roscoe","year":"1985"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588900497?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588900497?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:54:16Z","timestamp":1555127656000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588900497"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,9]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,9]]}},"alternative-id":["0304397588900497"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90049-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,9]]}}}