{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T02:01:02Z","timestamp":1726452062189},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"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":12616,"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":[[1979]]},"DOI":"10.1016\/0304-3975(79)90058-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"73-87","source":"Crossref","is-referenced-by-count":12,"title":["Recursive assertions are not enough - or are they?"],"prefix":"10.1016","volume":"8","author":[{"given":"Krzysztof R.","family":"Apt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan A.","family":"Bergstra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lambert G.L.T.","family":"Meertens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(79)90058-6_BIB1","series-title":"Report IW 84\u29f877","article-title":"Completeness with finite systems of assertions for recursive program schemes","author":"Apt","year":"1977"},{"issue":"3","key":"10.1016\/0304-3975(79)90058-6_BIB2","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0022-0000(75)80056-0","article-title":"On the completeness of the inductive assertion method","volume":"11","author":"De Bakker","year":"1975","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/0304-3975(79)90058-6_BIB3","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BF00571463","article-title":"Program proving: coroutines","volume":"2","author":"Clint","year":"1973","journal-title":"Acta Informat."},{"issue":"1","key":"10.1016\/0304-3975(79)90058-6_BIB4","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\/0304-3975(79)90058-6_BIB5","first-page":"10","article-title":"Programming language constructs for which it is impossible to obtain good Hoare-like axioms","author":"Clarke","year":"1977","journal-title":"Proc. 4th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(79)90058-6_BIB6","series-title":"Mathematical Aspects of Computer Science","first-page":"19","article-title":"Assigning meanings to programs","volume":"Vol. 19","author":"Floyd","year":"1967"},{"key":"10.1016\/0304-3975(79)90058-6_BIB7","series-title":"Technical Report 75","article-title":"A complete axiomatic system for proving assertions about recursive and non-recursive programs","author":"Gorelick","year":"1975"},{"key":"10.1016\/0304-3975(79)90058-6_BIB8","doi-asserted-by":"crossref","first-page":"1888","DOI":"10.2307\/2964398","article-title":"The classical and the \u03c9-complete arithmetic","volume":"23","author":"Grzegorczyk","year":"1958","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(79)90058-6_BIB9","series-title":"Technical Report","article-title":"Completeness issues for inductive assertions and Hoare's method","author":"Harel","year":"1976"},{"key":"10.1016\/0304-3975(79)90058-6_BIB10","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for programming language constructs","volume":"12","author":"Hoare","year":"1969","journal-title":"C. ACM"},{"key":"10.1016\/0304-3975(79)90058-6_BIB11","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0022-0000(69)80009-7","article-title":"The correctness of programs","volume":"3","author":"Manna","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(79)90058-6_BIB12","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/987531.987535","article-title":"The case for the assert statement","author":"Matuszek","year":"1976","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/0304-3975(79)90058-6_BIB13","first-page":"73","article-title":"A consistent and complete system for the verification of parallel programs","author":"Owicki","year":"1976","journal-title":"Proc. 8th ACM Symp. Theory Comput."},{"year":"1967","series-title":"Mathematical logic","author":"Shoenfield","key":"10.1016\/0304-3975(79)90058-6_BIB14"},{"issue":"1","key":"10.1016\/0304-3975(79)90058-6_BIB15","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:0304397579900586?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900586?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:23:09Z","timestamp":1555111389000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397579900586"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979]]}},"alternative-id":["0304397579900586"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(79)90058-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1979]]}}}