{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:29:23Z","timestamp":1765355363313},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer"],"published-print":{"date-parts":[[1982,9]]},"DOI":"10.1109\/mc.1982.1654138","type":"journal-article","created":{"date-parts":[[2007,8,22]],"date-time":"2007-08-22T20:04:20Z","timestamp":1187813060000},"page":"65-79","source":"Crossref","is-referenced-by-count":91,"title":["Applying software complexity metrics to program maintenance"],"prefix":"10.1109","volume":"15","author":[{"family":"Harrison","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Magel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Kluczny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"DeKock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","author":"harrison","year":"1981","journal-title":"A Hybrid Metric to Measure Software Complexity"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/360018.360025"},{"key":"ref10","first-page":"351","article-title":"some results from an empirical study of computer software","author":"feuer","year":"1979","journal-title":"Proc Fourth Int'l Conf Software Eng"},{"key":"ref11","author":"sheppard","year":"0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/356715.356717"},{"key":"ref13","first-page":"214","author":"basili","year":"1980","journal-title":"Tutorial on Models and Metrics for Software Management and Engineering"},{"key":"ref14","first-page":"995","article-title":"a measure of software complexity","author":"chapin","year":"1979","journal-title":"Proc NCC"},{"key":"ref15","first-page":"43","volume":"2","author":"chapin","year":"1978","journal-title":"Structured Analysis and Design"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1976.233837"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/954627.954633"},{"key":"ref18","author":"gilb","year":"1977","journal-title":"Software Metrics"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-7373(73)80011-2"},{"key":"ref28","first-page":"146","article-title":"control flow, data flow and program complexity","author":"oviedo","year":"0","journal-title":"Proc Compsac 80"},{"key":"ref4","author":"halstead","year":"1977","journal-title":"Elements of Software Science"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/954373.954375","article-title":"measurement of program complexity by the pair (cyclomatic number, operator count)","author":"hansen","year":"1978","journal-title":"ACM SIGPLAN Notices"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1976.233538"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/956003.956006"},{"key":"ref29","author":"kernighan","year":"1974","journal-title":"The Elements of Programming Style"},{"key":"ref5","first-page":"262","article-title":"halstead's criteria and statistical algorithms","author":"bohrer","year":"1975","journal-title":"Proc Eighth Ann Computer Science Statistics Symp"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1979.234165"},{"key":"ref7","first-page":"133","article-title":"a software physics analysis of akiyama's debugging data","author":"funami","year":"1976","journal-title":"Proc Symp Computer Software Eng"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-27662-9_4"},{"key":"ref9","first-page":"356","article-title":"third time charm: stronger prediction of programmer performance by software complexity metrics","author":"curtis","year":"1979","journal-title":"Proc Fourth Int'l Conf Software Eng"},{"key":"ref1","first-page":"1","author":"baird","year":"1978","journal-title":"Fundamentals of Scaling and Psychophysics"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-7373(77)80045-X"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1979.226497"},{"key":"ref21","author":"farr","year":"1965","journal-title":"Proc ICC Symp"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/947825.947829","article-title":"a complexity measure based on nesting level","author":"harrison","year":"1981","journal-title":"ACM SIGPLAN Notices"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1978.231497"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/988131.988137","article-title":"a topological analysis of computer programs with less than three binary branches","author":"harrison","year":"1981","journal-title":"ACM SIGPLAN Notices"},{"key":"ref25","article-title":"a graph-theoretic complexity measure","author":"harrison","year":"1981","journal-title":"ACM Computer Science Conf"}],"container-title":["Computer"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/2\/34673\/01654138.pdf?arnumber=1654138","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:57:27Z","timestamp":1642006647000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1654138\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":31,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/mc.1982.1654138","relation":{},"ISSN":["0018-9162"],"issn-type":[{"value":"0018-9162","type":"print"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}