• DocumentCode
    2569474
  • Title

    Deriving Coupling Metrics from Call Graphs

  • Author

    Allier, Simon ; Vaucher, Stéphane ; Dufour, Bruno ; Sahraoui, Houari

  • Author_Institution
    DIRO, Univ. de Montreal, Montréal, QC, Canada
  • fYear
    2010
  • fDate
    12-13 Sept. 2010
  • Firstpage
    43
  • Lastpage
    52
  • Abstract
    Coupling metrics play an important role in empirical software engineering research as well as in industrial measurement programs. The existing coupling metrics have usually been defined in a way that they can be computed from a static analysis of the source code. However, modern programs extensively use dynamic language features such as polymorphism and dynamic class loading that are difficult to capture by static analysis. Consequently, the derived metric values might not accurately reflect the state of a program. In this paper, we express existing definitions of coupling metrics using call graphs. We then compare the results of four different call graph construction algorithms with standard tool implementations of these metrics in an empirical study. Our results show important variations in coupling between standard and call graph-based calculations due to the support of dynamic features.
  • Keywords
    graph theory; program diagnostics; software metrics; software quality; call graph construction algorithm; call graphs; coupling metrics; dynamic class loading; dynamic language features; industrial measurement program; polymorphism; software engineering; source code static analysis; Buildings; Couplings; Heuristic algorithms; Java; Loading; Measurement; Runtime; call graphs; coupling; empirical study; metrics;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Source Code Analysis and Manipulation (SCAM), 2010 10th IEEE Working Conference on
  • Conference_Location
    Timisoara
  • Print_ISBN
    978-1-4244-8655-7
  • Type

    conf

  • DOI
    10.1109/SCAM.2010.25
  • Filename
    5601830