{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T11:22:43Z","timestamp":1720437763841},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"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":[[1986]]},"DOI":"10.1016\/0167-6423(86)90018-3","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T11:44:35Z","timestamp":1048592675000},"page":"35-88","source":"Crossref","is-referenced-by-count":41,"special_numbering":"C","title":["Script: A communication abstraction mechanism and its verification"],"prefix":"10.1016","volume":"6","author":[{"given":"Nissim","family":"Francez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brent","family":"Hailpern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gadi","family":"Taubenfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0167-6423(86)90018-3_BIB1","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1145\/357103.357110","article-title":"A proof system for communicating sequential process","volume":"2","author":"Apt","year":"1980","journal-title":"ACM Trans. Programming Languages and Systems"},{"issue":"4","key":"10.1016\/0167-6423(86)90018-3_BIB2","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/357146.357150","article-title":"Ten years of Hoare logic: A survey (part 1)","volume":"3","author":"Apt","year":"1981","journal-title":"ACM Trans. Programming Languages and Systems"},{"issue":"1","key":"10.1016\/0167-6423(86)90018-3_BIB3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1145\/322358.322372","article-title":"Formal justification of a proof system for communicating sequential processes","volume":"30","author":"Apt","year":"1983","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/0167-6423(86)90018-3_BIB4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1109\/TSE.1975.6312840","article-title":"The programming language Concurrent Pascal","volume":"1","author":"Brinch Hansen","year":"1975","journal-title":"IEEE Trans. Software Engrg."},{"issue":"3","key":"10.1016\/0167-6423(86)90018-3_BIB5","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(86)90018-3_BIB6","series-title":"Proc. 9th Annual ACM Symposium on Principles of Programming Languages","first-page":"40","article-title":"Extended naming conventions for communicating processes","author":"Francez","year":"1982"},{"key":"10.1016\/0167-6423(86)90018-3_BIB7","article-title":"A fully abstract and composable inter-task communication construct","author":"Francez","year":"1985","journal-title":"ACM Trans. Programming Languages and Systems"},{"issue":"2","key":"10.1016\/0167-6423(86)90018-3_BIB8","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0167-6423(84)90018-2","article-title":"A proof system for concurrent ADA programs","volume":"4","author":"Gerth","year":"1984","journal-title":"Sci. Comput. Programming"},{"issue":"4","key":"10.1016\/0167-6423(86)90018-3_BIB9","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1145\/357114.357119","article-title":"Assignment and procedure call proof rules","volume":"2","author":"Gries","year":"1980","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0167-6423(86)90018-3_BIB10","series-title":"Proc. 9th ACM Symposium on Principles of Programming Languages","first-page":"322","article-title":"Modular verification of concurrent programs","author":"Hailpern","year":"1982"},{"key":"10.1016\/0167-6423(86)90018-3_BIB11","series-title":"An informal definition of Alphard (preliminary)","year":"1978"},{"key":"10.1016\/0167-6423(86)90018-3_BIB12","series-title":"Proc. ACM-Ada TEC Conference on Ada","article-title":"Implementation strategies for Ada tasking idoms","author":"Hilfinger","year":"1982"},{"key":"10.1016\/0167-6423(86)90018-3_BIB13","series-title":"Symposium on Semantics of Algorithmic Languages","first-page":"102","article-title":"Procedures and parameters: An axiomatic approach","volume":"188","author":"Hoare","year":"1971"},{"issue":"8","key":"10.1016\/0167-6423(86)90018-3_BIB14","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(86)90018-3_BIB15","article-title":"Schemes for communication","author":"Joseph","year":"1981"},{"key":"10.1016\/0167-6423(86)90018-3_BIB16","series-title":"Proc. ACM Symposium on Principles of Distributed Computing","first-page":"173","article-title":"Edge locks and deadlock avoidance in distributed systems","author":"Korth","year":"1982"},{"issue":"1","key":"10.1016\/0167-6423(86)90018-3_BIB17","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/TSE.1983.236165","article-title":"Simulation of procedure variables using Ada tasks","volume":"9","author":"Lamb","year":"1983","journal-title":"IEEE Trans. Software Engrg."},{"issue":"2","key":"10.1016\/0167-6423(86)90018-3_BIB18","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1145\/69624.357207","article-title":"Specifying concurrent program modules","volume":"5","author":"Lamport","year":"1983","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0167-6423(86)90018-3_BIB19","volume":"114","author":"Liskov","year":"1981"},{"key":"10.1016\/0167-6423(86)90018-3_BIB20","author":"Mitchell","year":"1979"},{"key":"10.1016\/0167-6423(86)90018-3_BIB21","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","article-title":"An axiomatic proof technique for parallel programs","volume":"6","author":"Owicki","year":"1976","journal-title":"Acta Informat."},{"key":"10.1016\/0167-6423(86)90018-3_BIB22","series-title":"Proc. 8th ACM Symposium on Operating Systems Principles","first-page":"64","article-title":"Accent: A communication oriented network operating system kernel","author":"Rashid","year":"1981"},{"key":"10.1016\/0167-6423(86)90018-3_BIB23","article-title":"Control and communication in programming systems","author":"Reid","year":"1980"},{"key":"10.1016\/0167-6423(86)90018-3_BIB24","article-title":"Multicast and synchronization in distributed systems","author":"Skansholm","year":"1981"},{"key":"10.1016\/0167-6423(86)90018-3_BIB25","author":"United States Department of Defense","year":"1982","journal-title":"Reference manual for the Ada programming language, ACM-AdaTEC"},{"key":"10.1016\/0167-6423(86)90018-3_BIB26_1","article-title":"Mechanisms for broadcast and selective broadcast","author":"Wall","year":"1980"},{"key":"10.1016\/0167-6423(86)90018-3_BIB26_2","author":"Wall","year":"1980"},{"issue":"1","key":"10.1016\/0167-6423(86)90018-3_BIB27","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/spe.4380070102","article-title":"Modula: A language for modular multiprogramming","volume":"7","author":"Wirth","year":"1977","journal-title":"Software Practice and Experience"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642386900183?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642386900183?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T11:50:17Z","timestamp":1553428217000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642386900183"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":28,"alternative-id":["0167642386900183"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(86)90018-3","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}