頁籤選單縮合
題 名 | The Measurement of Software Complexity through Program Decomposition |
---|---|
作 者 | Chung,Chi-ming; Shih,Timothy K.; Wang,Ying-hong; Lin,Wei-chuan; Kou,Ying-feng; | 書刊名 | International Journal of Information and Management Sciences |
卷 期 | 6:3 1995.09[民84.09] |
頁 次 | 頁69-86 |
分類號 | 312.49 |
關鍵詞 | Software engineering; Software metric; Line of code; McCabe's cyclomatic complexity; Path complexity; Structural programming; Control flow analysis; |
語 文 | 英文(English) |
英文摘要 | When the cost of software continues to increase, software development techniques become more important. In software life cycle, about two-thirds of software development cost is spent on testing and maintenance [2]. The purpose of our research is to improve the quality and reliability of software thus software cost is reduced [4]. One of them is utilizing software metrics to monitor software development process and to improve the quality of the program. In software engineering, various "metrics" have been introduced as an attempt to measure the complexity of programs. For example, the "Lines of code" strategy has been widely applied in measuring software complexity. But it is not precise enough. The "Halstead's metrics" is too complex to implement [17], so it is rarely used. The McCabe's cyclomatic complexity [21] is well known metric and has been widely applied because it is more accurate and easier to implement. However, the method still has shortcomings [3]. In this paper, a more accurate and easier measuring methodology b Path complexity is proposed and an algorithm of the methodology is presented. Moreover, the methodology points out that how many individual complete paths of a program need to be tested. |
本系統中英文摘要資訊取自各篇刊載內容。