{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:54:03Z","timestamp":1742388843478},"reference-count":6,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1985,7,1]],"date-time":"1985-07-01T00:00:00Z","timestamp":489024000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":10244,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1985,7]]},"DOI":"10.1016\/s0019-9958(85)80010-3","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T20:43:56Z","timestamp":1115412236000},"page":"29-44","source":"Crossref","is-referenced-by-count":4,"title":["On relative completeness of Hoare logics"],"prefix":"10.1016","volume":"66","author":[{"given":"Michal","family":"Grabowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 1","key":"10.1016\/S0019-9958(85)80010-3_bib1","doi-asserted-by":"crossref","DOI":"10.1145\/322108.322121","article-title":"Programming language constructs for which it is impossible to obtain good Hoare axiom systems","author":"Clarke","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(85)80010-3_bib2","series-title":"Proc. 9th ACM Sympos. Principles of Programming","first-page":"309","article-title":"On effective axiomatization of Hoare logics","author":"Clarke","year":"1982"},{"issue":"No. 1","key":"10.1016\/S0019-9958(85)80010-3_bib3","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/0207005","article-title":"Soundness and completeness of axiom system for program verification","volume":"7","author":"Cook","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0019-9958(85)80010-3_bib4","series-title":"Logic Colloquium","article-title":"Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory","author":"Friedman","year":"1970"},{"key":"10.1016\/S0019-9958(85)80010-3_bib5","series-title":"Proc. 11th ACM Sympos. Principles of Programming","first-page":"258","article-title":"On relative completeness of programming logics","author":"Grabowski","year":"1984"},{"key":"10.1016\/S0019-9958(85)80010-3_bib6","series-title":"Proc. 18th IEEE Sympos. Found. of Comput. Sci.","first-page":"1","article-title":"A necessary and sufficient condition for existence of Hoare logics","author":"Lipton","year":"1977"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995885800103?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995885800103?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T08:51:37Z","timestamp":1550479897000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995885800103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,7]]},"references-count":6,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1985,7]]}},"alternative-id":["S0019995885800103"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(85)80010-3","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1985,7]]}}}