Affiliation:
1. Moti Lal Nehru National Institute Of Technology, Allahabad, India
Abstract
There has been a continuous effort to estimate software complexity but very little established methods exist that can estimate the complexity of the software before it is written. Since a high quality Software Requirement Specification (SRS) is a pre requisite for high quality software, this work attempts to empirically demonstrate that the complexity of the code can be determined based on its IEEE software requirement specification document (IEEE 830-1998). Existing complexity measures established are based on the code and the cognitive metrics value of the software. This may require recodingleading to loss of time and cost. Considering the shortcoming of code-based approaches, our proposed approach is able to compute the complexity of yet-to-be-written software immediately after freezing the requirement in the Software development Lifecycle (SDLC) process. The proposedcomplexity measure compares well with established complexity measures like Halstead, Mc Cabe, KLCID, CFS and CICM. Results obtained show that the complexity values are comparable with other established measures. The robustness of our complexity measure is established by evaluating our measure against Weyuker properties.
Publisher
Association for Computing Machinery (ACM)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献