{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T03:51:48Z","timestamp":1648957908911},"reference-count":13,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"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":["Computer Languages"],"published-print":{"date-parts":[[1982,1]]},"DOI":"10.1016\/0096-0551(82)90003-0","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:11:16Z","timestamp":1060297876000},"page":"147-160","source":"Crossref","is-referenced-by-count":16,"title":["A measure of logical complexity of programs"],"prefix":"10.1016","volume":"7","author":[{"given":"S.Sitharama","family":"Iyengar","sequence":"first","affiliation":[]},{"given":"N.","family":"Parameswaran","sequence":"additional","affiliation":[]},{"given":"John","family":"Fuller","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0096-0551(82)90003-0_BIB1","series-title":"Elements of Software Science","author":"Halstead","year":"1977"},{"key":"10.1016\/0096-0551(82)90003-0_BIB2","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 Engng"},{"key":"10.1016\/0096-0551(82)90003-0_BIB3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/954373.954375","article-title":"Measurement of program complexity by the pair (Cyclomatic number, operators count)","volume":"13","author":"Hansen","year":"1978","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/0096-0551(82)90003-0_BIB4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/TSE.1979.226497","article-title":"A measure of control flow complexity in program text","volume":"SE-5","author":"Woodward","year":"1979","journal-title":"IEEE Trans. Software Engng"},{"key":"10.1016\/0096-0551(82)90003-0_BIB5","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/TSE.1980.230799","article-title":"A comparison of measures of control flow complexity","volume":"SE-6","author":"Baker","year":"1980","journal-title":"IEEE Trans. Software Engng"},{"key":"10.1016\/0096-0551(82)90003-0_BIB6","article-title":"Software science and program complexity measures","author":"Baker","year":"1979"},{"key":"10.1016\/0096-0551(82)90003-0_BIB7","series-title":"Technical Report","article-title":"Algorithms to compute logical effort in programs","author":"Cater","year":"1982"},{"key":"10.1016\/0096-0551(82)90003-0_BIB8","unstructured":"N. Parameswaran and S. S. Iyengar, Quantification of data structure complexity in complex programs. Submitted to IEEE Trans. Software Engng."},{"key":"10.1016\/0096-0551(82)90003-0_BIB9","unstructured":"S. S. Iyengar and J. Fuller, A comparison of logical complexity of programs with Halstead and McCabes complexities. In preparation."},{"key":"10.1016\/0096-0551(82)90003-0_BIB10","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1109\/TSE.1979.234168","article-title":"A qualitative justification for a measure of program clarity","volume":"SE-5","author":"Gordon","year":"1979","journal-title":"IEEE Trans. Software Engng"},{"key":"10.1016\/0096-0551(82)90003-0_BIB11","series-title":"Proceedings of the ACM Annual Conference","first-page":"554","article-title":"Programming factors\u2014language features that help explain programming complexity","author":"Dunsmore","year":"1978"},{"key":"10.1016\/0096-0551(82)90003-0_BIB12","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0020-0190(71)90018-4","article-title":"Notes on avoiding GO TO statements","volume":"1","author":"Knuth","year":"1971","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0096-0551(82)90003-0_BIB13","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1145\/390017.808317","article-title":"An experimental investigation on the effect of program structure on program understanding","volume":"12","author":"Love","year":"1977","journal-title":"ACM SIGPLAN Notices"}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055182900030?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055182900030?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T09:23:08Z","timestamp":1552641788000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0096055182900030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,1]]},"references-count":13,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1982,1]]}},"alternative-id":["0096055182900030"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(82)90003-0","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1982,1]]}}}