{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:41:57Z","timestamp":1780994517777,"version":"3.54.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1973,1,1]],"date-time":"1973-01-01T00:00:00Z","timestamp":94694400000},"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":[[1973]]},"DOI":"10.1007\/bf00571463","type":"journal-article","created":{"date-parts":[[2004,11,20]],"date-time":"2004-11-20T10:45:34Z","timestamp":1100947534000},"page":"50-63","source":"Crossref","is-referenced-by-count":67,"title":["Program proving: Coroutines"],"prefix":"10.1007","volume":"2","author":[{"given":"M.","family":"Clint","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","first-page":"576","volume":"12","author":"C. A. R. Hoare","year":"1969","unstructured":"Hoare, C. A. R.: An axiomatic basis for computer programming. Comm. A.C.M.12, 576?580 (1969).","journal-title":"Comm. A.C.M."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Hoare, C. A. R.: Procedures and parameters; An Axiomatic Approach, Symposium on the Semantics of Algorithmic Languages (ed. E. Engeler) pp. 102?116, Springer-Verlag, 1971.","DOI":"10.1007\/BFb0059696"},{"key":"CR3","first-page":"39","volume":"14","author":"C. A. R. Hoare","year":"1971","unstructured":"Hoare, C. A. R.: Proof of a program: FIND, Comm. A.C.M.,14, 39?45 (1971).","journal-title":"Comm. A.C.M."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/BF00288686","volume":"1","author":"M. Clint","year":"1972","unstructured":"Clint, M., Hoare, C. A. R.: Program proving: Jumps and functions. Acta Informatica1, 214?224 (1972).","journal-title":"Acta Informatica"},{"key":"CR5","unstructured":"Foley, M.: Proof a recursive procedure quicksort: A comparison of two methods, Master's Dissertation, The Queen's University of Belfast 1969."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1093\/comjnl\/14.4.391","volume":"14","author":"M. Foley","year":"1971","unstructured":"Foley, M., Hoare, C. A. R.: Proof of a recursive program: Quicksort. Comp. J.14, 391?395 (1971).","journal-title":"Comp. J."},{"key":"CR7","volume-title":"SIMULA ? a language for programming and description of discrete event systems, introduction and user's manual","author":"O.-J. Dahl","year":"1965","unstructured":"Dahl, O.-J., Nygaard, K.: SIMULA ? a language for programming and description of discrete event systems, introduction and user's manual. Norwegian Computing Center, Forskningsveien 1B, Oslo 3, Norway, May 1965."},{"key":"CR8","first-page":"671","volume":"9","author":"O.-J. Dahl","year":"1966","unstructured":"Dahl, O.-J., Nygaard, K.: SIMULA ? An ALGOL-based simulation language. Comm. A.C.M.9, 671?678 (1966).","journal-title":"Comm. A.C.M."},{"key":"CR9","first-page":"396","volume":"6","author":"M. E. Conway","year":"1963","unstructured":"Conway, M. E.: Design of a separable transition diagram compiler. Comm. A.C.M.6, 396?408 (1963).","journal-title":"Comm. A.C.M."},{"key":"CR10","volume-title":"Lecture notes","author":"A. Wang","year":"1971","unstructured":"Wang, A., Dahl, O.-J.: Coroutine Sequencing in a Block Structured Environment. Lecture notes, International Summer School on Program Structures and Fundamental Concepts of Programming, Munich, Germany, July 1971."},{"key":"CR11","unstructured":"Foley, M.: The function PREC, Internal report, Department of Computer Science, The Queen's University of Belfast, 1970."},{"key":"CR12","volume-title":"Doctoral Dissertation","author":"J. C. King","year":"1969","unstructured":"King, J. C.: A Program Verifier, Doctoral Dissertation, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Pennsylvania, September 1969."},{"key":"CR13","unstructured":"Dahl, O.-J.: Discrete event simulation languages. Programming Languages (F. Genuys, Ed.), pp. 349?395, Academic Press, 1968."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00571463.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00571463\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00571463","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T15:04:23Z","timestamp":1554822263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00571463"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1973]]}},"alternative-id":["BF00571463"],"URL":"https:\/\/doi.org\/10.1007\/bf00571463","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1973]]}}}