{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T11:59:00Z","timestamp":1648555140365},"reference-count":4,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,7,1]],"date-time":"1983-07-01T00:00:00Z","timestamp":425865600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1983,7]]},"DOI":"10.1016\/0020-0190(83)90090-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"47-51","source":"Crossref","is-referenced-by-count":0,"title":["Is an exit statement sufficient?"],"prefix":"10.1016","volume":"17","author":[{"given":"M.H.","family":"Williams","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(83)90090-X_BIB1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0020-0190(71)90018-4","article-title":"Notes on avoiding \u2018Goto\u2019 statements","volume":"1","author":"Knuth","year":"1971","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(83)90090-X_BIB2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF00289504","article-title":"An axiomatic definition of the programming language PASCAL","volume":"2","author":"Hoare","year":"1973","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(83)90090-X_BIB3","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/356635.356640","article-title":"Structured programming with goto statements","volume":"6","author":"Knuth","year":"1974","journal-title":"ACM Comput. Surveys"},{"issue":"1","key":"10.1016\/0020-0190(83)90090-X_BIB4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1093\/comjnl\/20.1.45","article-title":"Generating structured flow diagrams: The nature of unstructuredness","volume":"20","author":"Williams","year":"1977","journal-title":"Comput. J."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908390090X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908390090X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:56:19Z","timestamp":1555073779000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001908390090X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,7]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,7]]}},"alternative-id":["002001908390090X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(83)90090-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1983,7]]}}}