{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:23:28Z","timestamp":1649190208838},"reference-count":14,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1982,10,1]],"date-time":"1982-10-01T00:00:00Z","timestamp":402278400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1982,10]]},"DOI":"10.1016\/0020-0190(82)90095-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:20:15Z","timestamp":1027657215000},"page":"143-149","source":"Crossref","is-referenced-by-count":7,"title":["Two theorems about the completeness of Hoare's logic"],"prefix":"10.1016","volume":"15","author":[{"given":"J.A.","family":"Bergstra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.V.","family":"Tucker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(82)90095-3_BIB1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/357146.357150","article-title":"Ten years of Hoare's logic, A survey","author":"Apt","year":"1981","journal-title":"ACM TOPL AS 3\u20134"},{"key":"10.1016\/0020-0190(82)90095-3_BIB2","series-title":"Mathematical Theory of Program Correctness","author":"de Bakker","year":"1980"},{"key":"10.1016\/0020-0190(82)90095-3_BIB3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0304-3975(82)90001-9","article-title":"Floyd's principle, correctness theories and program equivalence","volume":"17","author":"Bergstra","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(82)90095-3_BIB4","series-title":"Logic of Programs","article-title":"Hoare's logic is incomplete when it does not have to be","volume":"131","author":"Bergstra","year":"1982"},{"key":"10.1016\/0020-0190(82)90095-3_BIB5","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(82)90027-5","article-title":"Some natural structures which fail to posses a sound and decidable Hoare-like logic for their while-programs","volume":"17","author":"Bergstra","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(82)90095-3_BIB6","series-title":"Proc. ICALP 81","article-title":"Algebraically specified programming systems and Hoare's logic","volume":"115","author":"Bergstra","year":"1981"},{"key":"10.1016\/0020-0190(82)90095-3_BIB7","doi-asserted-by":"crossref","unstructured":"J.A. Bergstra and J.V. Tucker, Expressiveness and the completeness of Hoare's logic, J. Comput. Systems Sci., to appear.","DOI":"10.1016\/0022-0000(82)90013-7"},{"key":"10.1016\/0020-0190(82)90095-3_BIB8","series-title":"Logic of Programs","article-title":"On the refinement of specifications and the stability of Hoare's Logic","volume":"131","author":"Bergstra","year":"1981"},{"issue":"3","key":"10.1016\/0020-0190(82)90095-3_BIB9","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(83)90107-X","article-title":"Hoare's Logic and Peano's arithmetic","volume":"22","author":"Bergstra","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(82)90095-3_BIB10","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/0207005","article-title":"Soundness and completeness of an axiom system for program verification","volume":"7","author":"Cook","year":"1978","journal-title":"Siam J. Comput."},{"key":"10.1016\/0020-0190(82)90095-3_BIB11","series-title":"Current Trends in Programming Methodology","first-page":"80","article-title":"An initial algebra approach to the specification, correctness and implementation of abstract data types","volume":"Vol. IV","author":"Goguen","year":"1978"},{"key":"10.1016\/0020-0190(82)90095-3_BIB12","series-title":"Theory of Program Structures; Schemes, Semantics, Verification","author":"Greibach","year":"1975"},{"key":"10.1016\/0020-0190(82)90095-3_BIB13","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(82)90095-3_BIB14","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019082900953?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019082900953?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:32:45Z","timestamp":1580913165000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019082900953"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,10]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1982,10]]}},"alternative-id":["0020019082900953"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(82)90095-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1982,10]]}}}