{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T07:47:35Z","timestamp":1648626455414},"reference-count":28,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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":[[1984,1]]},"DOI":"10.1016\/0096-0551(84)90001-8","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:11:16Z","timestamp":1060297876000},"page":"133-148","source":"Crossref","is-referenced-by-count":2,"title":["Computation of logical effort in high level languages"],"prefix":"10.1016","volume":"9","author":[{"given":"Steven C.","family":"Cater","sequence":"first","affiliation":[]},{"given":"S.Sitharama","family":"Iyengar","sequence":"additional","affiliation":[]},{"given":"John","family":"Fuller","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0096-0551(84)90001-8_BIB1","series-title":"Elements of Software Science","author":"Halstead","year":"1977"},{"key":"10.1016\/0096-0551(84)90001-8_BIB2","first-page":"105","article-title":"A complexity measure","volume":"SE-2","author":"McCabe","year":"1977","journal-title":"IEEE Trans. Software Engng"},{"key":"10.1016\/0096-0551(84)90001-8_BIB3","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/TSE.1979.226497","article-title":"A measure of control flow complexity in program test","volume":"SE-5","author":"Woodward","year":"1979","journal-title":"IEEE Trans. Software Engng"},{"key":"10.1016\/0096-0551(84)90001-8_BIB4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/356715.356717","article-title":"A review and evaluation of software science","volume":"10","author":"Fitzimmons","year":"1978","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/0096-0551(84)90001-8_BIB5","article-title":"Software science and program complexity","author":"Baker","year":"1979"},{"key":"10.1016\/0096-0551(84)90001-8_BIB6","series-title":"Proceedings of the National Conference (NCC)","first-page":"317","article-title":"On the complexity of measuring software complexity","author":"Schneider","year":"1981"},{"key":"10.1016\/0096-0551(84)90001-8_BIB7","article-title":"Cognitive structures in the comprehension and memory of computer programs: an investigation of computer program debugging","author":"Atwood","year":"1978","journal-title":"ARI Technical Report TR-78-A21"},{"key":"10.1016\/0096-0551(84)90001-8_BIB8","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/0020-0190(76)90059-4","article-title":"On program analysis","volume":"5","author":"Hennell","year":"1976","journal-title":"Information Processing Lett."},{"key":"10.1016\/0096-0551(84)90001-8_BIB9","series-title":"Proceedings of the ACM 1978 Annual Conference","article-title":"Programming factors\u2014language features that help explain programming complexity","author":"Dunsmore","year":"1978"},{"key":"10.1016\/0096-0551(84)90001-8_BIB10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1109\/TSE.1979.234165","article-title":"Measuring the psychological complexity of software maintenance tasks with Halstead and McCabe metrics","volume":"SE-5","author":"Curtis","year":"1979","journal-title":"IEEE Trans. Software Engng"},{"key":"10.1016\/0096-0551(84)90001-8_BIB11","series-title":"Proceedings of the 3rd Conference on Software Engineering","first-page":"149","article-title":"A model for program complexity analysis","author":"McClure","year":"1978"},{"key":"10.1016\/0096-0551(84)90001-8_BIB12","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1145\/390017.808317","article-title":"An experimental investigation of the effect of program structure on program understanding","volume":"12","author":"Love","year":"1977","journal-title":"SIGPLAN"},{"key":"10.1016\/0096-0551(84)90001-8_BIB13","series-title":"Proceedings of the 1979 National Computer Conference","first-page":"995","article-title":"A measure of software complexity","author":"Chapin","year":"1979"},{"key":"10.1016\/0096-0551(84)90001-8_BIB14","unstructured":"Parameswaran N. and Iyengar S. S., A measure of logical complexity as related to program complexity. Submitted for publication."},{"key":"10.1016\/0096-0551(84)90001-8_BIB15","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0096-0551(82)90003-0","article-title":"A measure of logical complexity of programs","volume":"7","author":"Iyengar","year":"1982","journal-title":"Comput. Lang."},{"key":"10.1016\/0096-0551(84)90001-8_BIB16","article-title":"Algorithms for the computation of logical effort in a program","author":"Cater","year":"1982"},{"key":"10.1016\/0096-0551(84)90001-8_BIB17","first-page":"626","article-title":"A genealogy of control structures","volume":"8","author":"Ledgard","year":"1975","journal-title":"Commun. ACM"},{"key":"10.1016\/0096-0551(84)90001-8_BIB18","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1109\/TSE.1979.234163","article-title":"Measuring improvements in program clarity","volume":"SE-5","author":"Gordon","year":"1979","journal-title":"IEEE Trans. Software Engng"},{"key":"10.1016\/0096-0551(84)90001-8_BIB19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1145\/358315.358391","article-title":"Control flow and data structure documentation: two experiments","volume":"25","author":"Shneiderman","year":"1982","journal-title":"Commun. ACM"},{"key":"10.1016\/0096-0551(84)90001-8_BIB20","volume":"Vol. 1","author":"Knuth","year":"1973"},{"key":"10.1016\/0096-0551(84)90001-8_BIB21","series-title":"Structured Computer Organization","author":"Tannenbaum","year":"1976"},{"key":"10.1016\/0096-0551(84)90001-8_BIB22","series-title":"Operating Systems","author":"Madnick","year":"1974"},{"key":"10.1016\/0096-0551(84)90001-8_BIB23","series-title":"Logic for Mathematicians","author":"Hamilton","year":"1978"},{"key":"10.1016\/0096-0551(84)90001-8_BIB24","series-title":"Introduction to Switching Theory: A Mathematical Approach","author":"Prather","year":"1967"},{"key":"10.1016\/0096-0551(84)90001-8_BIB25","article-title":"A complexity measure that takes into account the complete program semantics","author":"Parameswaran","year":"1983"},{"key":"10.1016\/0096-0551(84)90001-8_BIB26","series-title":"Proceedings of the IEEE-SMC Conference","article-title":"Logical complexity of programs","author":"Parameswaran","year":"1983"},{"key":"10.1016\/0096-0551(84)90001-8_BIB27","article-title":"Formalization of logical complexity of programs","author":"Iyengar","year":"1983"},{"key":"10.1016\/0096-0551(84)90001-8_BIB28","unstructured":"Iyengar S. S., Fuller J., Parameswaran N. and Ambhardhar S., A comparison of logical complexity with Halstead and McCabe measures. Kybernates. To appear."}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055184900018?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055184900018?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:25:45Z","timestamp":1552641945000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0096055184900018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,1]]},"references-count":28,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1984,1]]}},"alternative-id":["0096055184900018"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(84)90001-8","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1984,1]]}}}