Measuring Graph Abstractions of Software: An Information-Theory Approach

  • Authors:
  • Edward B. Allen

  • Affiliations:
  • -

  • Venue:
  • METRICS '02 Proceedings of the 8th International Symposium on Software Metrics
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

A graph composed of nodes and edges may be anabstr action of a software system and a sub graph mayrepresent a software module. Software-design graphsdepict components and their relationships. Buildingon prior work by Allen, Khoshgoftaar, and Chen, thispaper proposes information theory-based measures ongraphs at the system and module levels for applicationto software. We propose measures of size, length, complexity, coupling, and cohesion which largely conformto the properties of these attributes defined by Briand,Morasca, and Basili. We illustrate the measures withexamples and suggest extensions for hypergraphs.