{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T19:54:29Z","timestamp":1672689269228},"reference-count":25,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"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":11520,"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":[[1982]]},"DOI":"10.1016\/0304-3975(82)90027-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"303-315","source":"Crossref","is-referenced-by-count":14,"title":["Some natural structures which fail to possess a sound and decidable hoare-like logic for their while-programs"],"prefix":"10.1016","volume":"17","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\/0304-3975(82)90027-5_BIB1_1","series-title":"Proc. 5th Scandinavian Logic Symposium","first-page":"1","article-title":"Ten years of Hoare's logic, a survey","author":"Apt","year":"1979"},{"key":"10.1016\/0304-3975(82)90027-5_BIB2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(79)90058-6","article-title":"Recursive assertions are not enough\u2014or are they?","volume":"8","author":"Apt","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(82)90027-5_BIB3","doi-asserted-by":"crossref","unstructured":"R.J.R. Back, Proving total correctness of nondeterministic programs in infinitary logic, Acta Informat., to appear.","DOI":"10.1007\/BF00289263"},{"key":"10.1016\/0304-3975(82)90027-5_BIB4","series-title":"Mathematical Theory of Program Correctness","author":"de Bakker","year":"1980"},{"key":"10.1016\/0304-3975(82)90027-5_BIB5","doi-asserted-by":"crossref","unstructured":"J.A. Bergstra, J. Tiuryn and J.V. Tucker, Floyd's principle, correctness theories and program equivalence, Theoret. Comput. Sci., to appear.","DOI":"10.1016\/0304-3975(82)90001-9"},{"key":"10.1016\/0304-3975(82)90027-5_BIB6","series-title":"Department of Computer Science Research Report IW 143","article-title":"Algebraically specified programming systems and Hoare's logic","author":"Bergstra","year":"1980"},{"key":"10.1016\/0304-3975(82)90027-5_BIB7","series-title":"Department of Computer Science Research Report IW 149","article-title":"Expresiveness and the completeness of Hoare's logic","author":"Bergstra","year":"1980"},{"key":"10.1016\/0304-3975(82)90027-5_BIB8","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1145\/322108.322120","article-title":"A complete and consistent Hoare axiomatics for a simple programming language","volume":"26","author":"Cherniavsky","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(82)90027-5_BIB9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/322108.322121","article-title":"Programming language constructs for which it is impossible to obtain good Hoare-like axioms","volume":"26","author":"Clarke","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(82)90027-5_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."},{"issue":"4","key":"10.1016\/0304-3975(82)90027-5_BIB11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1070\/RM1965v020n04ABEH001188","article-title":"Elementary theories","volume":"20","author":"Ershov","year":"1965","journal-title":"Russian Math. Surveys"},{"key":"10.1016\/0304-3975(82)90027-5_BIB12","series-title":"Theory of Program Structures: Schemes, Semantics, Verification","author":"Greibach","year":"1975"},{"key":"10.1016\/0304-3975(82)90027-5_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\/0304-3975(82)90027-5_BIB14","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF00289503","article-title":"On procedures as open subroutines I","volume":"2","author":"Langmaack","year":"1973","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(82)90027-5_BIB15","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00288636","article-title":"On procedures as open subroutines II","volume":"3","author":"Langmaack","year":"1974","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(82)90027-5_BIB16","series-title":"Automata Languages and Programming","first-page":"363","article-title":"Present day Hoare-like systems for programming languages with procedures: power, limits and most likely extensions","author":"Langmaack","year":"1980"},{"key":"10.1016\/0304-3975(82)90027-5_BIB17","first-page":"1","article-title":"A necessary and sufficient condition for the existence of Hoare logics","author":"Lipton","year":"1977","journal-title":"18th IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(82)90027-5_BIB18","doi-asserted-by":"crossref","first-page":"239","DOI":"10.2307\/2270515","article-title":"A note on computable real fields","volume":"35","author":"Madison","year":"1970","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(82)90027-5_BIB19","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1070\/RM1961v016n03ABEH001120","article-title":"Constructive algebras, I","volume":"16","author":"Mal'cev","year":"1961","journal-title":"Russian Math. Surveys"},{"key":"10.1016\/0304-3975(82)90027-5_BIB20","series-title":"Algorithms and Recursive Functions","author":"Mal'cev","year":"1970"},{"key":"10.1016\/0304-3975(82)90027-5_BIB21","first-page":"147","article-title":"Algorithmic logic and its applications in the theory of programs II","volume":"1","author":"Mirkowska","year":"1977","journal-title":"Fund. Inform."},{"key":"10.1016\/0304-3975(82)90027-5_BIB22","first-page":"341","article-title":"Computable algebra, general theory and the theory of computable fields","volume":"95","author":"Rabin","year":"1960","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(82)90027-5_BIB23","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0304-3975(82)90027-5_BIB24","series-title":"Recursion Theory, its Generalisations and Applications","article-title":"Computing in algebraic systems","author":"Tucker","year":"1980"},{"key":"10.1016\/0304-3975(82)90027-5_BIB25","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:0304397582900275?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900275?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:26:07Z","timestamp":1555125967000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397582900275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982]]}},"alternative-id":["0304397582900275"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90027-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982]]}}}