A program complexity metric based on data flow information in control graphs

ABSTRACT

This paper presents a new approach to measuring program complexity with the use of data flow information in programs. A complexity metric, called DU, is defined for the control graph of a structured program. This new metric is different from other control-graph based metrics in that it is based on “representative” data flow information in a control graph. An algorithm for computing the value of DU(G) for a control graph G is given. The lower and upper bounds of DU(G) are provided. The DU metric is shown to have several advantages over other control-graph based complexity metrics.

References

1. 1.M.H. Halstead, Elements of Software Science, New York: Elsevier North-Holland, 1977.
2. 2.M. Woodward, M. Hennell, and D. Hedley, "A measure of control flow complexity in program text," IEEE Trans. on Software Engineering, Vol. SE-5, Jan. 1979, pp.45-50.
3. 3.T. J. McCabe, "A complexity measure," IEEE Trans. on Software Engineering, Vol. SE-2, Dec. 1976, pp. 308-320.
4. 4.N. F. Schneidewind, and Hoffmann, H-M, "An experiment in software error data collection and analysis," IEEE Trans. on Software Engineering, Vol. SE-5, No. 3, May 1979, pp. 107-117.
5. 5.S. Henry, D. Kafura, and K. Harris, "On the relationships among three software metrics," Performance Evaluation Review, Vol. 10, No.1, 1981, pp. 3-10.
6. 6.S. Henry, and D. Kafura, "Software structure metrics based on information flow," IEEE Trans. on Software Engineering, Vol. SE-7, No. 5, Sept. 1981, pp. 510-518.
7. 7.E. I. Oviedo, "Control flow, data flow, and program complexity," Proceedings of COMPSAC 1980, pp.146-152.
8. 8.S. Iyengar, N. Parameswaran, and J. Fuller, "A measure of logical complexity of programs," Computer Languages, Vol. 7, 1982, pp. 147-160.
9. 9.W. Harrison, K. Magel, R. Kluczny, and A. Dekock, "Applying software complexity metrics to program maintenance," Computer, Vol. 15, No. 9, Sept. 1982, pp. 65-79.
10. 10.T. J. McCabe, "Structured testing: a testing methodology using the McCabe complexity metric," NBS Special Publication, Contract NBB2NAAK5518, U. S. Department of Commerce, National Bureau of Standards, 1982.
11. 11.K.-C. Tai, "Program testing complexity and test criteria," IEEE Trans. on Software Engineering, Vol. SE-6, Nov. 1980, pp. 531-537.
12. 12.P. M. Herman, "A data flow analysis approach to program testing," The Australian Computer Journal, Vol. 8, No. 3, Nov. 1976, pp.92-96
13. 13.J. W. Laski, "On data flow guided program testing," ACM SIGPLAN Notices, Vol. 17, No.9 Sept. 1982, pp. 62-71.
14. 14.J. W. Laski, and B. Korel, "A data flow oriented program testing strategy", IEEE Transaction on Software Engineering, Vol. SE-9, No. 3, May 1983, pp.347-354.
15. 15.S. Rapps, and E. J. Weyuker, "Dat flow analysis techniques for test data selection" Proc. 6th International Conf. Software Engineering, 1982, pp. 272-278.

Index Terms

• Software and its engineering

  • Software creation and management

    • Software verification and validation

      • Empirical software validation

      • Software defect analysis

        • Software testing and debugging

  • Software organization and properties

    • Software functional properties

      • Formal methods