{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T07:56:42Z","timestamp":1770278202040,"version":"3.49.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1974,12,1]],"date-time":"1974-12-01T00:00:00Z","timestamp":155088000000},"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":14108,"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,12]]},"DOI":"10.1016\/s0022-0000(74)80043-7","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T09:46:40Z","timestamp":1289382400000},"page":"232-255","source":"Crossref","is-referenced-by-count":57,"title":["Analysis of structured programs"],"prefix":"10.1016","volume":"9","author":[{"given":"S. Rao","family":"Kosaraju","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(74)80043-7_bib1","series-title":"Preprints of the IFIP Congress 1971","article-title":"The translation of \u201cgo to\u201d programs, Booklet TA-2","author":"Ashcroft","year":"1971"},{"key":"10.1016\/S0022-0000(74)80043-7_bib2","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1147\/sj.111.0056","article-title":"Chief programmer team management of production programming","volume":"11","author":"Baker","year":"1972","journal-title":"IBM Systems J."},{"key":"10.1016\/S0022-0000(74)80043-7_bib3","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1145\/355592.365646","article-title":"Flow diagrams, Turing machines and languages with only two formation rules","volume":"9","author":"B\u00f6hm","year":"1966","journal-title":"Comm. ACM"},{"key":"10.1016\/S0022-0000(74)80043-7_bib4","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/321707.321720","article-title":"The expression of algorithms by charts","volume":"19","author":"Bruno","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(74)80043-7_bib5","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":"Comm. ACM"},{"key":"10.1016\/S0022-0000(74)80043-7_bib6","first-page":"21","article-title":"Some transformations and standard forms of graphs, with applications to computer programs","volume":"2","author":"Cooper","year":"1967","journal-title":"Machine Intelligence"},{"key":"10.1016\/S0022-0000(74)80043-7_bib7","author":"Dahl","year":"1972"},{"key":"10.1016\/S0022-0000(74)80043-7_bib8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/362929.362947","article-title":"Go To statement considered harmful","volume":"11","author":"Dijkstra","year":"1968","journal-title":"Comm. ACM"},{"key":"10.1016\/S0022-0000(74)80043-7_bib9","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)80043-7_bib10_1","doi-asserted-by":"crossref","DOI":"10.1016\/0020-0190(71)90018-4","article-title":"Notes on Avoiding \u201cGo To\u201d Statements","volume":"1","author":"Knuth","year":"1971","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0022-0000(74)80043-7_bib10_2","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0020-0190(72)90054-3","article-title":"Notes on Avoiding \u201cGo To\u201d Statements","volume":"1","author":"Knuth","year":"1972","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0022-0000(74)80043-7_bib11","article-title":"Analysis of Structured Programs","author":"Kosaraju","year":"1972"},{"key":"10.1016\/S0022-0000(74)80043-7_bib12","series-title":"Examples of structured programs","author":"Ledgard","year":"1973"},{"key":"10.1016\/S0022-0000(74)80043-7_bib13","article-title":"Mathematical Foundations for Structured Programming","author":"Mills","year":"1972"},{"key":"10.1016\/S0022-0000(74)80043-7_bib14","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1145\/355609.362337","article-title":"On the capabilities of While, Repeat, and Exit statement","volume":"16","author":"Peterson","year":"1973","journal-title":"Comm. ACM"},{"key":"10.1016\/S0022-0000(74)80043-7_bib15","series-title":"Preprints of the IFIP Congress 1971","article-title":"Programming without the Go To, Booklet TA-3","author":"Wulf","year":"1971"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800437?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800437?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T23:52:07Z","timestamp":1544140327000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000074800437"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,12]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1974,12]]}},"alternative-id":["S0022000074800437"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(74)80043-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1974,12]]}}}