{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T14:17:43Z","timestamp":1772633863790,"version":"3.50.1"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1972,1,1]],"date-time":"1972-01-01T00:00:00Z","timestamp":63072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1972]]},"DOI":"10.1007\/bf00288686","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T05:28:20Z","timestamp":1096954100000},"page":"214-224","source":"Crossref","is-referenced-by-count":85,"title":["Program proving: Jumps and functions"],"prefix":"10.1007","volume":"1","author":[{"given":"M.","family":"Clint","sequence":"first","affiliation":[]},{"given":"C. A. R.","family":"Hoare","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"No. 10","key":"CR1","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C. A. R. Hoare","year":"1969","unstructured":"Hoare, C. A. R.: An axiomatic basis for computer programming. Comm. ACM 12, No. 10, 576?580 (October 1969).","journal-title":"Comm. ACM"},{"key":"CR2","volume-title":"Symposium on the Semantics of Algorithmic Languages","author":"C. A. R. Hoare","year":"1971","unstructured":"? Procedures and parameters; an axiomatic approach, Symposium on the Semantics of Algorithmic Languages (ed. E. Engeler). Berlin-Heidelberg-New York: Springer 1971."},{"issue":"No. 3","key":"CR3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/362929.362947","volume":"11","author":"E. W. Dijkstra","year":"1968","unstructured":"Dijkstra, E. W.: Go to statement considered harmful. Letter to the editor. Comm. ACM 11, No. 3, 147?148 (March 1968).","journal-title":"Comm. ACM"},{"key":"CR4","series-title":"Technical Report No. CS 148","volume-title":"Notes on avoiding ?go to? statements","author":"D. E. Knuth","year":"1970","unstructured":"Knuth, D. E., Floyd, R.W.: Notes on avoiding ?go to? statements. Technical Report No. CS 148, Computer Science Dept., Stanford, Jan. 1970."},{"issue":"Nos. 2 and 3","key":"CR5","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/363744.363749","volume":"8","author":"P. J. Landin","year":"1965","unstructured":"Landin, P. J.: A correspondence between ALGOL 60 and Church's lambda notation, parts I and II. Comm. ACM 8, Nos. 2 and 3, 89?101, Feb., 158?165, Mar. (1965).","journal-title":"Comm. ACM"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288686.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00288686\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288686","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T21:14:24Z","timestamp":1554758064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00288686"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1972]]}},"alternative-id":["BF00288686"],"URL":"https:\/\/doi.org\/10.1007\/bf00288686","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1972]]}}}