Skip to main content
SpringerLink
Log in

Computing Cyclomatic Complexity with Cubic Flowgraphs

  • Published:
Journal of Systems Integration

Abstract

Two new methods for the computation of cyclomatic complexity especially for decomposable representations are introduced. Building software by integration is a developing paradigm, especially enabled by the emerging component technologies. Decomposition of the design for a top-down approach is a prerequisite for this paradigm. Cubic flowgraphs are instrumental in providing formalisms for decomposition and integration. Cyclomatic complexity analysis of a design representation that is decomposable is the goal of this research. In addition to introducing cyclomatic complexity computation using cubic flowgraphs, preservation of cyclomatic complexity in the decomposition of the cubic flowgraph is also presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. M. Tanik and E. S. Chan, Fundamentals of Computing for Software Engineers, Van Nostrand Reinhold, 1991.

  2. A. H. Dogru and I. Altintas, “Modeling language for component-oriented software engineering: COSEML,” The Fifth World Conference on Integrated Design and Process Technology, Dallas, Texas, June 4–8, 2000.

  3. T. McCabe, “A complexity measure,” IEEE Transactions on Software Engineering, SE-2(4), pp. 308–320, 1976.

    Google Scholar 

  4. R. Prather, “Design and analysis of hierarchical software metrics,” ACM Computing Surveys 27(4), pp. 497–518, 1995.

    Google Scholar 

  5. R. Prather, “Regular expressions for program computations,” The American Mathematical Monthly 104(2), pp. 120–130, 1997.

    Google Scholar 

  6. S. Muchnik and N. D. Jones, Program Flow Analysis. Prentice Hall Inc.: Englewood Cliffs, NJ, 1981.

    Google Scholar 

  7. A. Gibbons, Algorithmic Graph Theory, Cambridge University Press: Cambridge, England, 1985.

    Google Scholar 

  8. M. Tanik, U. Pooch, and S. Yurttas, Advanced Programming Techniques in TURBO PASCAL, pp. 237–283, Wordware Publishing, Inc.: Plano, Texas, 1988.

    Google Scholar 

  9. Y. Tang, A Methodology for Component-based System Integration, Ph.D. Dissertation, New Jersey Institute of Technology, Newark, New Jersey, January 1999.

    Google Scholar 

  10. Y. Tang, A. Dogru, and M. Tanik, “Cyclomatic complexity based on cubic flowgraphs,” The Third Conference on Integrated Design and Process Technology, Berlin, Germany, IDPT, 4, pp. 82–85, July 6–9, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Information Systems, Fairleigh Dickinson University, 1000 River Road, T-BE2-01, Teaneck, New Jersey, 07666, USA

    Yongming Tang

  2. Computer Engineering Department, Middle East Technical University, 06531, Ankara, Turkey

    Ali H. Dogru

  3. Computer Science Department, Concordia University, 1455 de Maisonneuve West, Montreal, Quebec, H3G 1M8, Canada

    Franz J. Kurfess

  4. Department of Electrical and Computer Engineering, The University of Alabama at Birmingham, Birmingham, AL, 35294, USA

    Murat M. Tanik

Authors
  1. Yongming Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ali H. Dogru
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Franz J. Kurfess
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Murat M. Tanik
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tang, Y., Dogru, A.H., Kurfess, F.J. et al. Computing Cyclomatic Complexity with Cubic Flowgraphs. Journal of Systems Integration 10, 395–409 (2001). https://doi.org/10.1023/A:1011210102797

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011210102797

Search

Navigation