{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T11:22:51Z","timestamp":1720437771336},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1985]]},"DOI":"10.1016\/0167-6423(85)90016-4","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T16:44:35Z","timestamp":1048610675000},"page":"277-307","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Automatic construction of CSP programs from sequential non-deterministic programs"],"prefix":"10.1016","volume":"5","author":[{"given":"Abha","family":"Moitra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(85)90016-4_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 TOPLAS"},{"key":"10.1016\/0167-6423(85)90016-4_BIB2","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1145\/357094.357101","article-title":"Output guards and nondeterminism in \u2018Communicating Sequential Processes\u2019","volume":"2","author":"Bernstein","year":"1980","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0167-6423(85)90016-4_BIB3","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0167-6423(85)90016-4_BIB4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0167-6423(83)90013-8","article-title":"Decomposition of distributed programs into communication-closed layers","volume":"2","author":"Elrad","year":"1982","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(85)90016-4_BIB5","series-title":"The Science of Programming","author":"Gries","year":"1981"},{"key":"10.1016\/0167-6423(85)90016-4_BIB6","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(85)90016-4_BIB7","series-title":"Proc. 3rd International Conference on Software Engineering","first-page":"72","article-title":"Information systems: modelling, sequencing and transformations","author":"Jackson","year":"1978"},{"key":"10.1016\/0167-6423(85)90016-4_BIB8","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321765.321782","article-title":"Parallel program schemaata and maximal parallelism I: fundamental results","volume":"20","author":"Keller","year":"1973","journal-title":"J. ACM"},{"key":"10.1016\/0167-6423(85)90016-4_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(82)90002-8","article-title":"A methodology for programming with concurrency: an informal presentation","volume":"2","author":"Lengauer","year":"1982","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(85)90016-4_BIB10","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0167-6423(82)90003-X","article-title":"A methodology for programming with concurrency: the formalism","volume":"2","author":"Lengauer","year":"1982","journal-title":"Sci. Conput. Programming"},{"key":"10.1016\/0167-6423(85)90016-4_BIB11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/362566.362568","article-title":"Toward automatic program synthesis","volume":"14","author":"Manna","year":"1971","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(85)90016-4_BIB12","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/357233.357237","article-title":"Synthesis of communicating processes from temporal logic specifications","volume":"6","author":"Manna","year":"1984","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0167-6423(85)90016-4_BIB13","series-title":"Proc. Conference on Principles of Distributed Computating","first-page":"123","article-title":"A Synthesis of communicating processes","author":"Moitra","year":"1983"},{"key":"10.1016\/0167-6423(85)90016-4_BIB14","series-title":"Proc. Conference on Principles of Distributed Computing","first-page":"143","article-title":"Distributed k-selection: from a sequential to a distributed algorithm","author":"Shrira","year":"1983"},{"key":"10.1016\/0167-6423(85)90016-4_BIB15","series-title":"Semantics of Concurrent Computation","first-page":"337","article-title":"Principles for distributed programs","volume":"70","author":"Sintzoff","year":"1979"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642385900164?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642385900164?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T15:30:49Z","timestamp":1553441449000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642385900164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":15,"alternative-id":["0167642385900164"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(85)90016-4","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}