@article{ART001672622},
author={Kim, JeeHyun},
title={Relevance of the Cyclomatic Complexity Threshold for the Web Programming},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2012},
volume={17},
number={6},
pages={153-161},
doi={}
TY - JOUR
AU - Kim, JeeHyun
TI - Relevance of the Cyclomatic Complexity Threshold for the Web Programming
JO - Journal of The Korea Society of Computer and Information
PY - 2012
VL - 17
IS - 6
PB - The Korean Society Of Computer And Information
SP - 153
EP - 161
SN - 1598-849X
AB - In this empirical study at the Web environment based on the frequency distribution of the cyclomatic complexity number of the application, the relevance of the threshold has been analyzed with the next two assumptions. The upper bound established by McCabe in the procedural programming equals 10 and the upper bound established by Lopez in the Java programming equals 5. Which numerical value can be adapted to Web application contexts? In order to answer this 10 web site projects have been collected and a sample of more than 4,000 ASP files has been measured. After analyzing the frequency distribution of the cyclomatic complexity of the Web application, experiment result is that more than 90% of Web application have a complexity less than 50 and also 50 is proposed as threshold of Web application. Web application has the complex architecture with Server, Client and HTML, and the HTML side has the high complexity 35~40. The reason of high complexity is that HTML program is usually made of menu type for home page or site map, and the relevance of that has been explained. In the near future we need to find out if there exist some hidden properties of the Web application architecture related to complexity.
KW - measurement;complexity;threshold;Web application
DO -
ER -
Kim, JeeHyun. (2012). Relevance of the Cyclomatic Complexity Threshold for the Web Programming. Journal of The Korea Society of Computer and Information, 17(6), 153-161.
Kim, JeeHyun. 2012, "Relevance of the Cyclomatic Complexity Threshold for the Web Programming", Journal of The Korea Society of Computer and Information, vol.17, no.6 pp.153-161. Available from: doi:
Kim, JeeHyun "Relevance of the Cyclomatic Complexity Threshold for the Web Programming" Journal of The Korea Society of Computer and Information 17.6 pp.153-161 (2012) : 153.
Kim, JeeHyun. Relevance of the Cyclomatic Complexity Threshold for the Web Programming. 2012; 17(6), 153-161. Available from: doi:
Kim, JeeHyun. "Relevance of the Cyclomatic Complexity Threshold for the Web Programming" Journal of The Korea Society of Computer and Information 17, no.6 (2012) : 153-161.doi:
Kim, JeeHyun. Relevance of the Cyclomatic Complexity Threshold for the Web Programming. Journal of The Korea Society of Computer and Information, 17(6), 153-161. doi:
Kim, JeeHyun. Relevance of the Cyclomatic Complexity Threshold for the Web Programming. Journal of The Korea Society of Computer and Information. 2012; 17(6) 153-161. doi:
Kim, JeeHyun. Relevance of the Cyclomatic Complexity Threshold for the Web Programming. 2012; 17(6), 153-161. Available from: doi:
Kim, JeeHyun. "Relevance of the Cyclomatic Complexity Threshold for the Web Programming" Journal of The Korea Society of Computer and Information 17, no.6 (2012) : 153-161.doi: