The complexity measurement of software through program decomposition

Ying Hong Wang, Chi Ming Chung, Timothy K. Shin, Huan Chao Keh, Jui Fa Chen

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


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 languageEnglish
Pages (from-to)127-134
Number of pages8
JournalComputer Systems Science and Engineering
Issue number2
StatePublished - 2000


  • Control flow analysis
  • Line of code
  • McCabe's cyclomatic complexity
  • Path complexity
  • Software engineering
  • Software metric
  • Structural programming


Dive into the research topics of 'The complexity measurement of software through program decomposition'. Together they form a unique fingerprint.

Cite this