{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T17:55:29Z","timestamp":1649094929966},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"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":5252,"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":[[1999,3]]},"DOI":"10.1016\/s0304-3975(97)00234-x","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"213-235","source":"Crossref","is-referenced-by-count":0,"title":["Formal verification of a programming logic for a distributed programming language"],"prefix":"10.1016","volume":"216","author":[{"given":"Cui","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Ronald A.","family":"Olsson","sequence":"additional","affiliation":[]},{"given":"Karl N.","family":"Levitt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00234-X_BIB1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0304-3975(91)90224-P","article-title":"The Existence of Refinement Mappings","volume":"82","author":"Abadi","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00234-X_BIB2","series-title":"The SR Programming Language: Concurrency in Practice","author":"Andrews","year":"1993"},{"key":"10.1016\/S0304-3975(97)00234-X_BIB3","series-title":"Concurrent Programming: Principles and Practice","author":"Andrews","year":"1991"},{"key":"10.1016\/S0304-3975(97)00234-X_BIB4","series-title":"Verification of Sequential and Concurrent Programs","author":"Apt","year":"1991"},{"key":"10.1016\/S0304-3975(97)00234-X_BIB5","series-title":"Parallel Program Design: A Foundation of Programming Logic","author":"Chandy","year":"1988"},{"key":"10.1016\/S0304-3975(97)00234-X_BIB6","first-page":"643","article-title":"Using symbolic execution for verification of ada tasking programs","volume":"12","author":"Dillon","year":"1990","journal-title":"ACM Trans. Software Eng."},{"key":"10.1016\/S0304-3975(97)00234-X_BIB7","series-title":"Program Verification","author":"Francez","year":"1992"},{"key":"10.1016\/S0304-3975(97)00234-X_BIB8","series-title":"Current Trends in Hardware Verification and Automated Theorem Proving","first-page":"387","article-title":"Mechanizing programming logics in higher order logic","author":"Gordon","year":"1989"},{"key":"10.1016\/S0304-3975(97)00234-X_BIB9","series-title":"Introduction to HOL: A Theorem Proving Environment for Higher Order Logic","author":"Gordon","year":"1993"},{"issue":"9","key":"10.1016\/S0304-3975(97)00234-X_BIB10","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1109\/32.58790","article-title":"Formal Verification of Ada Programs","volume":"16","author":"Guaspari","year":"1990","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0304-3975(97)00234-X_BIB11","series-title":"Higher Order Logic Theorem Proving and Its Applications","first-page":"269","article-title":"Trustworthy tool for trustworthy programs: a verified conditional generator","volume":"vol. 859","author":"Homeier","year":"1994"},{"key":"10.1016\/S0304-3975(97)00234-X_BIB12","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF00288746","article-title":"Automatic program verification I: a logical basis and its implementation","volume":"4","author":"Igarashi","year":"1975","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(97)00234-X_BIB13","series-title":"Logic and Computation: Interactive Proof with Cambridge LCF","author":"Paulson","year":"1987"},{"key":"10.1016\/S0304-3975(97)00234-X_BIB14","article-title":"A technique for defining predicate transformers","author":"Polak","year":"1989"},{"key":"10.1016\/S0304-3975(97)00234-X_BIB15","article-title":"A verified program verifier","author":"Ragland","year":"1973"},{"key":"10.1016\/S0304-3975(97)00234-X_BIB16","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/158439.158441","article-title":"An introduction to assertional reasoning for concurrent systems","volume":"25","author":"Shankar","year":"1993","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0304-3975(97)00234-X_BIB17","series-title":"Proc. Monterey Workshop on Increasing the Practical Impact of Formal Methods for Computer-Aided Software Development","first-page":"124","article-title":"Towards a practical verification environment for concurrent programs","author":"Shaw","year":"1994"},{"key":"10.1016\/S0304-3975(97)00234-X_BIB18","first-page":"647","article-title":"Axiomatic semantics of communicating sequential processes","volume":"6","author":"Soundararajan","year":"1984","journal-title":"ACM Trans. Software Eng."},{"key":"10.1016\/S0304-3975(97)00234-X_BIB19","series-title":"Higher Order Logic Theorem Proving and Its Applications","first-page":"31","article-title":"Mechanizing a programming logic for the concurrent programming language microSR in HOL","volume":"vol. 780","author":"Zhang","year":"1994"},{"key":"10.1016\/S0304-3975(97)00234-X_BIB20","series-title":"Proc. 30th Hawaii Internat. Conf. on System Sciences","first-page":"252","article-title":"Verification of a distributed computing system by layered proofs","author":"Zhang","year":"1997"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759700234X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759700234X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T09:20:30Z","timestamp":1555406430000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759700234X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["S030439759700234X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00234-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}