An Entropy-Based Measure of Software Complexity

IEEE Transactions on Software Engineering

Volumn 18, Issue 11, 1992, Pages 1025-1029

  Harrison, Warren ^a  

^a PORTLAND STATE UNIVERSITY   (United States)

Author keywords

Information theory; management; software metrics; software project; software quality

Indexed keywords

COMPUTATIONAL COMPLEXITY;

SOFTWARE COMPLEXITY; SOFTWARE DEVELOPMENT;

COMPUTER SOFTWARE;

EID: 0026943567     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.177371     Document Type: Article

References (9)

1. E. Berlinger, “An information theory based complexity measure”, in Proc. 1980 Nat. Computer Conf., pp. 773–779.
2. C. Cook, “Information theory metric for assembly language”, in Proc. Third Annual Oregon Workshop on Software Metrics, Mar. 1991.
3. J. Davis and R. LeBlanc, “A study of the applicability of complexity measures”, IEEE Trans. Software Eng., vol. 14, pp. 1366–1372, Sept. 1988.
4. M. Halstead, Elements of Software Science. Amsterdam, The Netherlands: Elsevier Science, 1976.
5. R. Hamming, Coding and Information Theory. Englewood Cliffs, NJ: Prentice-Hall, 1980.
6. W. Harrison, K. Magel, R. Kluczney, and A. DeKock, “Software complexity metrics and their application to maintenance”, IEEE Computer, pp. 65–79, Sept. 1982.
7. E. Weyuker, “Evaluating software complexity measures”, IEEE Trans. Software Eng., vol. 14, pp. 1357–1365, Sept. 1988.
8. H. Zuse, Software Complexity: Measures and Metrics, Berlin, Germany: Walter de Gruyter, 1991.
9. S. Zweben and M. Halstead, “The frequency distribution of operators in PL/I programs”, IEEE Trans. Software Eng., vol. SE-5, pp. 91–95, Mar. 1979.