{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:25:29Z","timestamp":1787340329160,"version":"build-2736575974"},"reference-count":8,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1980,11]]},"abstract":"<jats:p>It is proved that in the general case of arbitrary context-free schemes a program is (partially) correct with respect to given initial and final assertions if and only if a suitable finite system of intermediate assertions can be found. Assertions are allowed from the extended state space $\\mathcal {V} \\times \\mathcal {V}$. This result contrasts with the results of [2], where it is proved that if assertions are taken from the original state space $\\mathcal {V}$, then in the general case an infinite system of intermediate assertions is needed. The extension of the state space allows a unification in the relational framework of [2], of the (essence of the) results of [2], and of [4], [5] and [6], and provides a semantic counterpart of the use of auxiliary variables.<\/jats:p>","DOI":"10.1137\/0209050","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:21:58Z","timestamp":1109226118000},"page":"665-671","source":"Crossref","is-referenced-by-count":8,"title":["Completeness with Finite Systems of Intermediate Assertions for Recursive Program Schemes"],"prefix":"10.1137","volume":"9","author":[{"given":"Krzysztof R.","family":"Apt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lambert G. L. T.","family":"Meertens","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90058-6"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(75)80056-0"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/0207005"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"J. H. Gallier,  Semantics and correctness of nondeterministic flowchart programs with recursive procedures,  Proc. 5th Coll. Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 62, Springer-Verlag,  1978,  251\u2013267","DOI":"10.1007\/3-540-08860-1_19"},{"key":"R5","unstructured":"G. A. Gorelick,  A complete axiomatic system for proving assertions about recursive and nonrecursive programs, Technical Report, 75, University of Toronto,  1975"},{"key":"R6","unstructured":"D. Harel, A. Pnueli, J. Stavi,  Completeness issues for inductive assertions and Hoare's method, Technical Report, Tel-Aviv University,  1976"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1145\/363235.363259"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1007\/BF00268134"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0209050","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:30:19Z","timestamp":1787337019000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0209050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,11]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1980,11]]}},"alternative-id":["10.1137\/0209050"],"URL":"https:\/\/doi.org\/10.1137\/0209050","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,11]]}}}