A Slice - based Complexity Measure


The KIPS Transactions:PartD, Vol. 8, No. 3, pp. 257-264, Jun. 2001
10.3745/KIPSTD.2001.8.3.257,   PDF Download:

Abstract

We developed a SIFG (Slice-based Information Graph), which modelled the information flow on program on the basis of the information flow of data tokens on data slices. Then we defined a SCM (Slice-based complexity measure), which measured the program complexity by measuring the complexity of information flow on SIFG. SCM satisfied the necessary properties for complexity measure proposed by Briand et al. SCM could measure not only the control and data flow on program but also the physical size of program unlike the existing measures.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
Y. M. Moon, W. K. Choi, S. J. Lee, "A Slice - based Complexity Measure," The KIPS Transactions:PartD, vol. 8, no. 3, pp. 257-264, 2001. DOI: 10.3745/KIPSTD.2001.8.3.257.

[ACM Style]
Yu Mi Moon, Wan Kyoo Choi, and Sung Joo Lee. 2001. A Slice - based Complexity Measure. The KIPS Transactions:PartD, 8, 3, (2001), 257-264. DOI: 10.3745/KIPSTD.2001.8.3.257.