{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T07:51:58Z","timestamp":1715241118239},"reference-count":29,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,8,1]],"date-time":"1984-08-01T00:00:00Z","timestamp":460166400000},"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":10577,"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":[[1984,8]]},"DOI":"10.1016\/0167-6423(84)90018-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:19:32Z","timestamp":1027657172000},"page":"159-204","source":"Crossref","is-referenced-by-count":22,"title":["A proof system for concurrent ADA programs"],"prefix":"10.1016","volume":"4","author":[{"given":"Rob","family":"Gerth","sequence":"first","affiliation":[]},{"given":"Willem P","family":"De Roever","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(84)90018-2_BIB1","article-title":"The Programming Language ADA Reference Manual","volume":"155","author":"ADA","year":"1983"},{"issue":"1","key":"10.1016\/0167-6423(84)90018-2_BIB2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/356901.356903","article-title":"Concepts and notations for concurrent programming","volume":"15","author":"Andrews","year":"1983","journal-title":"ACM Comput. Surveys"},{"issue":"4","key":"10.1016\/0167-6423(84)90018-2_BIB3","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/357146.357150","article-title":"Ten years of Hoare's logic: A survey\u2014Part I","volume":"3","author":"Apt","year":"1981","journal-title":"TOPLAS"},{"key":"10.1016\/0167-6423(84)90018-2_BIB4","series-title":"Foundations of Computer Science IV. Distributed Systems: Part II, Semantics and Logic","article-title":"Ten years of Hoare's logic: A survey\u2014Part II: Nondeterminism","volume":"159","author":"Apt","year":"1982"},{"issue":"3","key":"10.1016\/0167-6423(84)90018-2_BIB5","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":"TOPLAS"},{"key":"10.1016\/0167-6423(84)90018-2_BIB6","series-title":"Technical Report CS-76-01","article-title":"Program verification tableaus","author":"Ashcroft","year":"1976"},{"key":"10.1016\/0167-6423(84)90018-2_BIB7_1","series-title":"Axioms and proof rules for ADA tasks","author":"Barringer","year":"1982"},{"issue":"2","key":"10.1016\/0167-6423(84)90018-2_BIB7_2","article-title":"Axioms and proof rules for ADA tasks","volume":"129","author":"Barringer","year":"1982","journal-title":"Proc. IEE"},{"key":"10.1016\/0167-6423(84)90018-2_BIB8","first-page":"99","article-title":"The programming language concurrent Pascal","volume":"1","author":"Brinch Hansen","year":"1975","journal-title":"IEEE Trans. Software Engrg."},{"issue":"11","key":"10.1016\/0167-6423(84)90018-2_BIB9","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1145\/359642.359651","article-title":"Distributed processes: A concurrent programming concept","volume":"21","author":"Brinch Hansen","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(84)90018-2_BIB10","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF00264535","article-title":"The logic of aliasing","volume":"15","author":"Cartwright","year":"1981","journal-title":"Acta Informat."},{"key":"10.1016\/0167-6423(84)90018-2_BIB11","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1109\/TSE.1980.234505","article-title":"\u2217Mod\u2014A language for distributed programming","volume":"6","author":"Cook","year":"1980","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0167-6423(84)90018-2_BIB12","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0167-6423(84)90018-2_BIB13","series-title":"Technical Report RUU-CS-81-17","article-title":"A proof system for a subset of the concurrency section of ADA","author":"Gerth","year":"1981"},{"key":"10.1016\/0167-6423(84)90018-2_BIB14","series-title":"Proc. 5th International Symposium on Programming","first-page":"132","article-title":"Procedures and concurrency: A study in proof","volume":"137","author":"Gerth","year":"1982"},{"key":"10.1016\/0167-6423(84)90018-2_BIB15","series-title":"A sound and complete Hoare axiomatization of the ADA rendezvous","author":"Gerth","year":"1984"},{"issue":"4","key":"10.1016\/0167-6423(84)90018-2_BIB16","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":"TOPLAS"},{"issue":"8","key":"10.1016\/0167-6423(84)90018-2_BIB17","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"},{"issue":"2","key":"10.1016\/0167-6423(84)90018-2_BIB18","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/358549.358561","article-title":"1980 ACM Turing Award Lecture","volume":"24","author":"Hoare","year":"1981","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(84)90018-2_BIB19","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF00289062","article-title":"The \u2018Hoare logic\u2019 of concurrent programs","volume":"14","author":"Lamport","year":"1980","journal-title":"Acta Informat."},{"key":"10.1016\/0167-6423(84)90018-2_BIB20","doi-asserted-by":"crossref","first-page":"281","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(84)90018-2_BIB21","series-title":"Ph.D. Thesis","article-title":"A denotational semantics for concurrent ADA programs","author":"Mearns","year":"1983"},{"key":"10.1016\/0167-6423(84)90018-2_BIB22","series-title":"Mesa Language Manual","author":"Mitchell","year":"1979"},{"key":"10.1016\/0167-6423(84)90018-2_BIB23","series-title":"Proc. Logics of Programs Workshop","first-page":"349","article-title":"A critique of the foundations of Hoare-style programming logics","volume":"131","author":"O'Donnell","year":"1982"},{"key":"10.1016\/0167-6423(84)90018-2_BIB24","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","article-title":"An axiomatic proof technique for parallel programs I","volume":"6","author":"Owicki","year":"1976","journal-title":"Acta Informat."},{"key":"10.1016\/0167-6423(84)90018-2_BIB25","doi-asserted-by":"crossref","DOI":"10.1145\/3304133.3304152","article-title":"Rendezvous with ADA\u2014A proof theoretical view","author":"Pnueli","year":"1982","journal-title":"Proc. ACM ADATEC Conference"},{"key":"10.1016\/0167-6423(84)90018-2_BIB26","series-title":"Technical Report RUU-CS-81-5","article-title":"A proof system for Brinch Hansen's distributed processes","author":"Roncken","year":"1981"},{"key":"10.1016\/0167-6423(84)90018-2_BIB27","series-title":"Proc. Logics of Programming Workshop 1981","first-page":"397","article-title":"Critical remarks on MAX model of concurrency","volume":"131","author":"Salwicki","year":"1982"},{"key":"10.1016\/0167-6423(84)90018-2_BIB28","series-title":"Using message passing for distributed programming: Proof rules and disciplines","author":"Schlichting","year":"1982"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642384900182?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642384900182?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T14:34:21Z","timestamp":1580913261000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642384900182"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,8]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,8]]}},"alternative-id":["0167642384900182"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(84)90018-2","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1984,8]]}}}