Abstract
A new methodology of measuring software complexity is proposed based on program decomposition mechanisms. The purpose of our research is to improve the quality and reliability of software by using a good measurement of the complexity of the software. Thus software development cost can be reduced due to the fewer errors introduced. We present a complete survey of various metrics in the literature. Six types of metrics or measurement techniques are discussed, including some earlier research results of the authors. We then propose a program decomposition mechanism based on the operational semantics of several languages constructs in most procedural languages. An algorithm along with some examples is also given to show the feasibility of our mechanism. Our approach, relies on the path complexity of a program, is more accurate and easier to be realized. The algorithm also points out that how many individual complete paths of a program need to be tested.
| Original language | English |
|---|---|
| Pages (from-to) | 127-134 |
| Number of pages | 8 |
| Journal | Computer Systems Science and Engineering |
| Volume | 15 |
| Issue number | 2 |
| State | Published - 2000 |
Keywords
- Control flow analysis
- Line of code
- McCabe's cyclomatic complexity
- Path complexity
- Software engineering
- Software metric
- Structural programming