{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T15:10:27Z","timestamp":1695654627285},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1974,10,1]],"date-time":"1974-10-01T00:00:00Z","timestamp":149817600000},"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":14169,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1974,10]]},"DOI":"10.1016\/s0022-0000(74)80006-1","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T04:46:40Z","timestamp":1289364400000},"page":"177-195","source":"Crossref","is-referenced-by-count":13,"title":["Translatability of flowcharts into while programs"],"prefix":"10.1016","volume":"9","author":[{"given":"Takumi","family":"Kasai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(74)80006-1_bib1","article-title":"The expression of algorithms by charts","author":"Bruno","year":"1971"},{"key":"10.1016\/S0022-0000(74)80006-1_bib2","first-page":"21","article-title":"Some transformations and standard froms of graphs with application to computer programs","volume":"Vol. 2","author":"Cooper","year":"1968"},{"key":"10.1016\/S0022-0000(74)80006-1_bib3","first-page":"43","article-title":"Programs for mechanical program verification","volume":"Vol. 6","author":"Cooper","year":"1971"},{"key":"10.1016\/S0022-0000(74)80006-1_bib4_1","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/363534.363539","article-title":"B\u00f6hm and Jacopini's reduction of flow charts","volume":"10","author":"Cooper","year":"1967","journal-title":"Commm. ACM"},{"key":"10.1016\/S0022-0000(74)80006-1_bib4_2","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1145\/363534.363539","article-title":"B\u00f6hm and Jacopini's reduction of flow charts","volume":"10","author":"Cooper","year":"1967","journal-title":"Comm. ACM"},{"key":"10.1016\/S0022-0000(74)80006-1_bib5","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/362929.362947","article-title":"GOTO statement considered harmful","volume":"11","author":"Dijkstra","year":"1968","journal-title":"Comm. ACM"},{"key":"10.1016\/S0022-0000(74)80006-1_bib6","series-title":"Symposium on Semantics of Algorithmic Languages","first-page":"89","article-title":"Structure and meanings of elementary programs","author":"Engeler","year":"1971"},{"key":"10.1016\/S0022-0000(74)80006-1_bib7","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/0201014","article-title":"Flow graph reducibility","volume":"1","author":"Hecht","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(74)80006-1_bib8_1","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis of computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Comm. ACM"},{"key":"10.1016\/S0022-0000(74)80006-1_bib8_2","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis of computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Comm. ACM"},{"key":"10.1016\/S0022-0000(74)80006-1_bib9","series-title":"Lecture Notes in Mathematics 188","first-page":"102","article-title":"Procedures and parameters: an axiomatic approach","author":"Hoare","year":"1970"},{"key":"10.1016\/S0022-0000(74)80006-1_bib10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0020-0190(71)90018-4","article-title":"Notes on avoiding GOTO statements","volume":"1","author":"Knuth","year":"1971","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0022-0000(74)80006-1_bib11","unstructured":"Z. Manna, \u201cIntroduction to Mathematical Theory of Computations,\u201d to be published."},{"key":"10.1016\/S0022-0000(74)80006-1_bib12","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/363567.363570","article-title":"The GOTO statement reconsidered","volume":"11","author":"Rice","year":"1968","journal-title":"Comm. ACM"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800061?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800061?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T01:11:51Z","timestamp":1559783511000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000074800061"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,10]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1974,10]]}},"alternative-id":["S0022000074800061"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(74)80006-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1974,10]]}}}