{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:35:55Z","timestamp":1770284155604,"version":"3.49.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,8,1]],"date-time":"1983-08-01T00:00:00Z","timestamp":428544000000},"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":10943,"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":[[1983,8]]},"DOI":"10.1016\/0304-3975(83)90009-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"337-347","source":"Crossref","is-referenced-by-count":43,"title":["On the notion of expressiveness and the rule of adaptation"],"prefix":"10.1016","volume":"24","author":[{"given":"Ernst-R\u00fcdiger","family":"Olderog","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90009-9_BIB1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/357146.357150","article-title":"Ten years of Hoare's logic: A survey - Part I","volume":"3","author":"Apt","year":"1981","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0304-3975(83)90009-9_BIB2","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1137\/0209050","article-title":"Completeness with finite systems of intermediate assertions for recursive program schemes","volume":"9","author":"Apt","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90009-9_BIB3","series-title":"Mathematical Theory of Program Correctness","author":"de Bakker","year":"1980"},{"key":"10.1016\/0304-3975(83)90009-9_BIB4","series-title":"Rept. IW 149","article-title":"Expressiveness and the completeness of Hoare's logic","author":"Bergstra","year":"1980"},{"key":"10.1016\/0304-3975(83)90009-9_BIB5","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF00264535","article-title":"The logic of aliasing","volume":"15","author":"Cartwright","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(83)90009-9_BIB6","series-title":"Ph.D. Thesis","article-title":"Completeness and incompleteness theorems for Hoare-like axiom systems","author":"Clarke","year":"1976"},{"key":"10.1016\/0304-3975(83)90009-9_BIB7","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 axioms","volume":"26","author":"Clarke","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(83)90009-9_BIB8","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/0207005","article-title":"Soundness and completness of an axiom system for program verification","volume":"7","author":"Cook","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90009-9_BIB9","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0304-3975(83)90009-9_BIB10","series-title":"Tech. Rept. 75","article-title":"A complete axiomatic system for proving assertions about recursive and non-recursive programs","author":"Corelick","year":"1975"},{"key":"10.1016\/0304-3975(83)90009-9_BIB11","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1145\/357114.357119","article-title":"Assignment and procedure call proof rules","volume":"2","author":"Gries","year":"1980","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0304-3975(83)90009-9_BIB12","series-title":"Formal Description of Programming Language Concepts","first-page":"211","article-title":"A proof rule for Euclid procedures","author":"Guttag","year":"1978"},{"key":"10.1016\/0304-3975(83)90009-9_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(83)90009-9_BIB14","series-title":"Symp. on Semantics of Algorithmic Languages","first-page":"102","article-title":"Procedures and parameters: An axiomatic approach","volume":"188","author":"Hoare","year":"1971"},{"key":"10.1016\/0304-3975(83)90009-9_BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00260921","article-title":"Proof rules for the programming language Euclid","volume":"10","author":"London","year":"1978","journal-title":"Acta Inform."},{"issue":"4, 5","key":"10.1016\/0304-3975(83)90009-9_BIB16","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/0020-0190(80)90048-4","article-title":"A simple relation between relational and predicate transformer semantics for nondeterministic programs","volume":"11","author":"Majster-Cederbaum","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(83)90009-9_BIB17","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00261258","article-title":"Sound and complete Hoare-like calculi based on copy rules","volume":"16","author":"Olderog","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(83)90009-9_BIB18","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1093\/comjnl\/20.2.151","article-title":"Generic commands \u2014 A too for partial correctness formalisms","volume":"20","author":"Schwarz","year":"1977","journal-title":"The Computer Journal"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900099?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900099?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:28:16Z","timestamp":1555126096000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583900099"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,8]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,8]]}},"alternative-id":["0304397583900099"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90009-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983,8]]}}}