{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T02:01:25Z","timestamp":1726452085564},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0304-3975(85)90138-0","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"189-206","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Some questions about expressiveness and relative completeness in Hoare's logic"],"prefix":"10.1016","volume":"39","author":[{"given":"Mario","family":"Rodriguez Artalejo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90138-0_BIB1","first-page":"208","article-title":"Completeness problems in verification of programs and program schemes","volume":"74","author":"Andr\u00e9ka","year":"1979"},{"key":"10.1016\/0304-3975(85)90138-0_BIB2_1","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(82)90004-4","article-title":"A complete logic for reasoning about programs via nonstandard model theory, Parts I\u2013II","volume":"17","author":"Andr\u00e9ka","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90138-0_BIB2_2","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0304-3975(82)90025-1","article-title":"A complete logic for reasoning about programs via nonstandard model theory, Parts I\u2013II","volume":"17","author":"Andr\u00e9ka","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90138-0_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":"ACM TOPLAS"},{"key":"10.1016\/0304-3975(85)90138-0_BIB4","series-title":"Logics of Programs","first-page":"24","article-title":"The refinement of specifications and the stability of Hoare's logic","volume":"131","author":"Bergstra","year":"1981"},{"key":"10.1016\/0304-3975(85)90138-0_BIB5","series-title":"Proceedings of the 8th ICALP","first-page":"348","article-title":"Algebraically specified programming systems and Hoare's logic","volume":"115","author":"Bergstra","year":"1981"},{"key":"10.1016\/0304-3975(85)90138-0_BIB6","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0022-0000(82)90013-7","article-title":"Expressiveness and the completeness of Hoare's logic","volume":"25","author":"Begstra","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(85)90138-0_BIB7","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(82)90027-5","article-title":"Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs","volume":"17","author":"Bergstra","year":"1982","journal-title":"Theoret. Comput. Sci."},{"year":"1973","series-title":"Model theory","author":"Chang","key":"10.1016\/0304-3975(85)90138-0_BIB8"},{"key":"10.1016\/0304-3975(85)90138-0_BIB9","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/0207005","article-title":"Soundness and completeness of an axiom systems for program verification","volume":"7","author":"Cook","year":"1978","journal-title":"SIAM J. Comput."},{"year":"1972","series-title":"A Mathematical Introduction to Logic","author":"Enderton","key":"10.1016\/0304-3975(85)90138-0_BIB10"},{"key":"10.1016\/0304-3975(85)90138-0_BIB11","doi-asserted-by":"crossref","first-page":"567","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\/0304-3975(85)90138-0_BIB12","series-title":"Schriften zur Informatik und angewandten Mathematik, Rheinisch Westfalische TH Aachen","article-title":"A note on expressivity definitions in Hoare logic","volume":"80","author":"Josko","year":"1982"},{"key":"10.1016\/0304-3975(85)90138-0_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(83)90013-0","article-title":"Definability by programs in first order structures","volume":"25","author":"Kfoury","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90138-0_BIB14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0019-9958(75)90415-5","article-title":"On the termination of program schemas","volume":"29","author":"Kfoury","year":"1975","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(85)90138-0_BIB15","series-title":"Proc. 1st ICALP","first-page":"253","article-title":"Comparing algebraic structures up to algorithmic equivalence","author":"Kfoury","year":"1973"},{"key":"10.1016\/0304-3975(85)90138-0_BIB16","doi-asserted-by":"crossref","first-page":"147","DOI":"10.3233\/FI-1977-1111","article-title":"Algorithmic logic and its applications in the theory of programs II","volume":"1","author":"Mirkowska","year":"1977","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/0304-3975(85)90138-0_BIB17","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(83)90009-9","article-title":"On the notion of expressiveness and the rule of adaptation","volume":"24","author":"Olderog","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90138-0_BIB18","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0019-9958(81)90163-7","article-title":"The unwind property in certain algebras","volume":"5","author":"Urzyczyn","year":"1981","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(85)90138-0_BIB19","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/322047.322062","article-title":"A new incompleteness result for Hoare's system","volume":"25","author":"Wand","year":"1978","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901380?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901380?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,6,7]],"date-time":"2021-06-07T02:02:46Z","timestamp":1623031366000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585901380"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":20,"alternative-id":["0304397585901380"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90138-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1985]]}}}