{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:15Z","timestamp":1750307715351,"version":"3.41.0"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2009,7,6]],"date-time":"2009-07-06T00:00:00Z","timestamp":1246838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGSOFT Softw. Eng. Notes"],"published-print":{"date-parts":[[2009,7,6]]},"abstract":"<jats:p>Complexity is one of the important attributes of reliability. Higher design complexity increases the probability of error occurrences and decreases reliability of software. Inheritance has been indentified as a key construct to control design complexity. This paper proposes a formula to calculate the overall complexity of design hierarchy caused by inherited methods.<\/jats:p>","DOI":"10.1145\/1543405.1564532","type":"journal-article","created":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T17:28:33Z","timestamp":1247074113000},"page":"1-5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Measuring design complexity"],"prefix":"10.1145","volume":"34","author":[{"given":"A.","family":"Yadav","sequence":"first","affiliation":[{"name":"DIT, Babashaeb Bhimrao Ambedkar University, Lucknow"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. A.","family":"Khan","sequence":"additional","affiliation":[{"name":"DIT, Babashaeb Bhimrao Ambedkar University, Lucknow"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,7,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITNG.2009.157"},{"key":"e_1_2_1_2_1","first-page":"2375","volume-title":"IEEE International Advance Computing Conference (IACC09)","author":"Yadav A.","year":"2009"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.3923\/itj.2008.698.701"},{"key":"e_1_2_1_4_1","first-page":"165","volume-title":"Sep-Oct. 4, 2002","volume":"1","author":"Losavio F.","year":"2002"},{"key":"e_1_2_1_5_1","first-page":"347","volume-title":"Operation Profile-A key Factor for Reliability Estimation","author":"Khan R.A.","year":"2004"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1806170.1806183"},{"key":"e_1_2_1_7_1","first-page":"230","volume-title":"Bell Laboratories","author":"Musa J.D.","year":"1984"},{"key":"e_1_2_1_8_1","first-page":"1","volume-title":"June 2003","volume":"23","author":"Schneidewind N.F.","year":"2003"},{"key":"e_1_2_1_9_1","first-page":"121","volume-title":"Division of Computer Science","author":"Shooman M.L.","year":"1987"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1366522.1366530"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/EDCC-7.2008.28"},{"volume-title":"IJCSNS International Journal of Computer Science and Network Security","year":"2008","author":"Ghani A.A.","key":"e_1_2_1_12_1"},{"key":"e_1_2_1_13_1","first-page":"13","volume-title":"COIT of National Conference on Challenges and Apportunity in Information Technology","author":"Kumar P.J.","year":"2007"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2007.57"},{"key":"e_1_2_1_15_1","first-page":"54","volume-title":"Measuring Complexity","author":"Linda M.","year":"2006"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.979986"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0164-1212(94)90099-X"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/851028.856258"},{"key":"e_1_2_1_19_1","first-page":"1","volume-title":"Computer and Information Science","author":"Khan R.A.","year":"2007"},{"key":"e_1_2_1_20_1","first-page":"1","volume-title":"Journal Paginated","author":"Edmonds B.","year":"2007"},{"key":"e_1_2_1_21_1","first-page":"1","volume-title":"Ruediger Lincke","author":"Lincke R.","year":"2007"},{"key":"e_1_2_1_22_1","first-page":"11","article-title":"(2008)","author":"Koh T.W.","year":"2008","journal-title":"Review of Complexity Metrics for Object Oriented Software. In International Journal of Computer Science and Network Security"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/DEPCOS-RELCOMEX.2007.32"}],"container-title":["ACM SIGSOFT Software Engineering Notes"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1543405.1564532","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1543405.1564532","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:20Z","timestamp":1750253420000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1543405.1564532"}},"subtitle":["an inherited method perspective"],"short-title":[],"issued":{"date-parts":[[2009,7,6]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,7,6]]}},"alternative-id":["10.1145\/1543405.1564532"],"URL":"https:\/\/doi.org\/10.1145\/1543405.1564532","relation":{},"ISSN":["0163-5948"],"issn-type":[{"type":"print","value":"0163-5948"}],"subject":[],"published":{"date-parts":[[2009,7,6]]},"assertion":[{"value":"2009-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}