{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T22:15:43Z","timestamp":1672697743271},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,4,1]],"date-time":"1983-04-01T00:00:00Z","timestamp":418003200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T00:00:00Z","timestamp":1376697600000},"content-version":"vor","delay-in-days":11096,"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":[[1983,4]]},"DOI":"10.1016\/0167-6423(83)90005-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:09:22Z","timestamp":1027656562000},"page":"101-114","source":"Crossref","is-referenced-by-count":1,"title":["Extended naming conventions for communicating processes"],"prefix":"10.1016","volume":"3","author":[{"given":"Nissim","family":"Francez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(83)90005-9_BIB1","series-title":"Reference manual for the ADA programming language (revised draft)","year":"1982"},{"issue":"2","key":"10.1016\/0167-6423(83)90005-9_BIB2","article-title":"Formal justification of a proof system for communicating sequential processes","volume":"30","author":"Apt","year":"1983","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/0167-6423(83)90005-9_BIB3","doi-asserted-by":"crossref","DOI":"10.1145\/357103.357110","article-title":"A proof system for communicating sequential processes","volume":"2","author":"Apt","year":"1980","journal-title":"ACM-TOPLAS"},{"issue":"2","key":"10.1016\/0167-6423(83)90005-9_BIB4","article-title":"Axioms and proof rules for ADA tasks","volume":"129","author":"Barringer","year":"1982","journal-title":"IEEE Proc., Pt. E (Computers & Digital Techniques)"},{"key":"10.1016\/0167-6423(83)90005-9_BIB5","series-title":"Private communication","author":"Brinch-Nansen,","year":"1978"},{"issue":"11","key":"10.1016\/0167-6423(83)90005-9_BIB6","article-title":"Distributed processes","volume":"21","author":"Brinch-Hansen","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(83)90005-9_BIB7","author":"Doepner","year":"1983","journal-title":"A formal description of the UNIX operating system"},{"key":"10.1016\/0167-6423(83)90005-9_BIB8_1","series-title":"Proc. 5th International Conference on Programming","article-title":"A weakest precondition semantics for communicating processes","volume":"137","author":"Elrad","year":"1982"},{"key":"10.1016\/0167-6423(83)90005-9_BIB8_2","volume":"27","year":"1983","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/0167-6423(83)90005-9_BIB9","doi-asserted-by":"crossref","DOI":"10.1145\/357084.357087","article-title":"Distributed termination","volume":"2","author":"Francez","year":"1980","journal-title":"ACM-TOPLAS"},{"key":"10.1016\/0167-6423(83)90005-9_BIB10","series-title":"Proc. 9th ICALP","article-title":"A sound and complete Hoare axiomatization of the ADA-rendezvous","volume":"140","author":"Gerth","year":"1982"},{"issue":"8","key":"10.1016\/0167-6423(83)90005-9_BIB11","doi-asserted-by":"crossref","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(83)90005-9_BIB12","doi-asserted-by":"crossref","DOI":"10.1007\/BF00289266","article-title":"A proof technique for communicating sequential processes","volume":"15","author":"Levin","year":"1981","journal-title":"Acta informat."},{"key":"10.1016\/0167-6423(83)90005-9_BIB13","article-title":"A Calculus for Communicating Systems","volume":"92","author":"Milner","year":"1980"},{"key":"10.1016\/0167-6423(83)90005-9_BIB14","doi-asserted-by":"crossref","DOI":"10.1145\/1035237.1035256","article-title":"A methodology for verifying request processing protocols","author":"Nikolaou","year":"1983","journal-title":"Proc. ACM-SIGCOM 83, Communications, Architectures, Protocols"},{"key":"10.1016\/0167-6423(83)90005-9_BIB15","doi-asserted-by":"crossref","DOI":"10.1145\/360051.360224","article-title":"Verifying properties of parallel programs: an axiomatic approach","volume":"19","author":"Owicki","year":"1976","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(83)90005-9_BIB16","series-title":"TR-07-80","article-title":"Task management in ADA: a critical evaluation for real-time multiprocessing","author":"Roberts","year":"1980"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642383900059?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642383900059?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T17:50:03Z","timestamp":1555091403000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642383900059"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,4]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,4]]}},"alternative-id":["0167642383900059"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(83)90005-9","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1983,4]]}}}