An Analysis of the Complexity Measurement Factor for a Program

An Analysis of the Complexity Measurement Factor for a Program

, , Journal of Internet Computing and Services, Vol. 3, No. 4, pp. 61-70, Aug. 2002
Full Text:

Abstract

Measurement of the object, messages, clones, capsulation, inheritance, etc. that are conventional object-oriented paradigm characteristics as a method of measurement of the complexity of object-oriented programs has been reported. In this paper, the measures that are helpful to designing and coding of JAVA program, which is the representative language of object-oriented programs, are applied to six measures(i,e., Halstead's Program Volume, Program Level, Program Impurity, Macabe's Cyclomatic Number, Handerson-Seller's lock of cohesion in method and Sullivan's PVG.) suggested in the present study by referring to several actual programs as example for comparative analysis,

Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from November 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

[APA Style]

이규범 & 송정영 (2002). An Analysis of the Complexity Measurement Factor for a Program. Journal of Internet Computing and Services, 3(4), 61-70.

[IEEE Style]

이규범 and 송정영, "An Analysis of the Complexity Measurement Factor for a Program," Journal of Internet Computing and Services, vol. 3, no. 4, pp. 61-70, 2002.

[ACM Style]

이규범 and 송정영. 2002. An Analysis of the Complexity Measurement Factor for a Program. Journal of Internet Computing and Services, 3, 4, (2002), 61-70.