{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:23:53Z","timestamp":1649039033850},"reference-count":25,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,5,1]],"date-time":"1987-05-01T00:00:00Z","timestamp":546825600000},"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":[[1987,5]]},"DOI":"10.1016\/0020-0190(87)90131-1","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"189-193","source":"Crossref","is-referenced-by-count":0,"title":["On the detection of unstructuredness in flowgraphs"],"prefix":"10.1016","volume":"25","author":[{"given":"T.H.","family":"Tse","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(87)90131-1_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1975"},{"key":"10.1016\/0020-0190(87)90131-1_BIB2_1","series-title":"Proc. 1971 IFIP Congress","first-page":"250","article-title":"The translation of goto programs to while programs","author":"Ashcroft","year":"1971"},{"key":"10.1016\/0020-0190(87)90131-1_BIB2_2","series-title":"Classics in Software Engineering","first-page":"51","article-title":"The translation of goto programs to while programs","author":"Ashcroft","year":"1979"},{"issue":"6","key":"10.1016\/0020-0190(87)90131-1_BIB3","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1147\/rd.246.0756","article-title":"Grammar characterization of flowgraphs","volume":"24","author":"Becerril","year":"1980","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0020-0190(87)90131-1_BIB4","series-title":"Software Engineering Economics","author":"Boehm","year":"1981"},{"key":"10.1016\/0020-0190(87)90131-1_BIB5_1","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1145\/355592.365646","article-title":"Flow diagrams, Turing machines and languages with only 2 formation rules","volume":"9","author":"Bohm","year":"1966","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(87)90131-1_BIB5_2","series-title":"Classics in Software Engineering","first-page":"13","article-title":"Flow diagrams, Turing machines and languages with only 2 formation rules","author":"Bohm","year":"1979"},{"key":"10.1016\/0020-0190(87)90131-1_BIB6","series-title":"Proc. 6th Internat. Conf. on Information Systems","first-page":"70","article-title":"Techniques for understanding unstructured code","author":"Colter","year":"1985"},{"issue":"3","key":"10.1016\/0020-0190(87)90131-1_BIB7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1093\/comjnl\/23.3.243","article-title":"Synthesis and structural analysis of abstract programs","volume":"23","author":"Cowell","year":"1980","journal-title":"Comput. J."},{"key":"10.1016\/0020-0190(87)90131-1_BIB8","article-title":"Theory of Program Structures: Schemes, Semantics, Verification","volume":"Vol. 36","author":"Greibach","year":"1975"},{"key":"10.1016\/0020-0190(87)90131-1_BIB9","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/S0022-0000(74)80043-7","article-title":"Analysis of structured programs","volume":"9","author":"Kosaraju","year":"1974","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/0020-0190(87)90131-1_BIB10","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1109\/TSE.1976.233837","article-title":"A complexity measure","volume":"SE-2","author":"McCabe","year":"1976","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0020-0190(87)90131-1_BIB11_1","series-title":"Rept. FSC 72-6012","article-title":"Mathematical foundations for structured programming","author":"Mills","year":"1972"},{"key":"10.1016\/0020-0190(87)90131-1_BIB11_2","series-title":"Tutorial on Structured Programming: Integrated Practices","first-page":"42","article-title":"Mathematical foundations for structured programming","author":"Mills","year":"1981"},{"issue":"3","key":"10.1016\/0020-0190(87)90131-1_BIB12","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1093\/comjnl\/25.3.379","article-title":"Unravelling unstructured programs","volume":"25","author":"Oulsman","year":"1982","journal-title":"Comput. J."},{"issue":"3","key":"10.1016\/0020-0190(87)90131-1_BIB13","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1093\/comjnl\/24.3.258","article-title":"Decomposition of flowchart schemata","volume":"24","author":"Prather","year":"1981","journal-title":"Comput. J."},{"issue":"2","key":"10.1016\/0020-0190(87)90131-1_BIB14","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(87)90131-1_BIB15","series-title":"Tech. Rept. TR-C4-86","article-title":"The identification of program unstructuredness: A formal approach","author":"Tse","year":"1986"},{"key":"10.1016\/0020-0190(87)90131-1_BIB16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1147\/rd.192.0181","article-title":"Automic structuring of programs","volume":"19","author":"Urschler","year":"1975","journal-title":"IBM J. Res. Develop."},{"issue":"1","key":"10.1016\/0020-0190(87)90131-1_BIB17","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."},{"issue":"3","key":"10.1016\/0020-0190(87)90131-1_BIB18","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1093\/comjnl\/25.3.393","article-title":"A comment on the decomposition of flowchart schemata","volume":"25","author":"Williams","year":"1982","journal-title":"Comput. J."},{"issue":"3","key":"10.1016\/0020-0190(87)90131-1_BIB19","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1093\/comjnl\/26.3.270","article-title":"Flowchart schemata and the problem of nomenclature","volume":"26","author":"Williams","year":"1983","journal-title":"Comput. J."},{"issue":"2","key":"10.1016\/0020-0190(87)90131-1_BIB20","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1093\/comjnl\/28.2.134","article-title":"Restructuring Pascal programs containing goto statements","volume":"28","author":"Williams","year":"1985","journal-title":"Comput. J."},{"issue":"2","key":"10.1016\/0020-0190(87)90131-1_BIB21","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1093\/comjnl\/21.2.161","article-title":"Conversion of unstructured flow diagrams to structured form","volume":"21","author":"Williams","year":"1978","journal-title":"Comput. J."},{"key":"10.1016\/0020-0190(87)90131-1_BIB22","series-title":"Techniques of Program Structure and Design","author":"Yourdon","year":"1975"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087901311?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087901311?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:53:56Z","timestamp":1553594036000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087901311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,5]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,5]]}},"alternative-id":["0020019087901311"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90131-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,5]]}}}