A graph-based class structural complexity metric and its evaluation

被引:0
|
作者
Aman, H [1 ]
Yamada, H
Noda, MT
Yanaru, T
机构
[1] Ehime Univ, Fac Engn, Matsuyama, Ehime 7908577, Japan
[2] Univ E Asia, Fac Engn, Shimonoseki, Yamaguchi 7518503, Japan
来源
关键词
object oriented software metrics; class structural complexity; directed graph;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Properly representation of the complexity of class structure will be useful in object oriented software developments. Although some class complexity metrics have been proposed, they have ignored directions of coupling relationships among methods and attributes. such as whether a method writes data onto an attribute or reads data from the attribute. In this paper, we use a directed graph model to represent such coupling relationships Based on the directed graph model, we proposed a metric of class structural complexity. The proposed metric satisfies necessary conditions of complexity metric suggusted by Briand and others, The following fact is showed by experimental data of Java classes. While the proposed metric follows a conventional metric, the proposed metric can capture an aspect of class structural complexity which is lost by the conventional one.
引用
收藏
页码:674 / 684
页数:11
相关论文
共 50 条
  • [31] Graph-based structural analysis of planar mechanisms
    Durango, Sebastian
    Correa, Jorge
    Ruiz, Oscar E.
    MECCANICA, 2017, 52 (1-2) : 441 - 455
  • [32] Graph-based structural analysis of planar mechanisms
    Sebastián Durango
    Jorge Correa
    Oscar E. Ruiz
    Meccanica, 2017, 52 : 441 - 455
  • [33] Graph-based decision making for varying complexity multicriteria problems
    Nesterenko, Oleksandr
    Netesin, Igor
    Polischuk, Valery
    Selin, Yuri
    COMPUTER SCIENCE JOURNAL OF MOLDOVA, 2022, 30 (03) : 391 - 412
  • [34] The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes
    Le Roux, Stephane
    Perez, Guillermo A.
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2018, 2018, 10803 : 367 - 383
  • [35] Complexity of some graph-based bounds on the probability of a union of events
    Scozzari, Andrea
    Tardella, Fabio
    DISCRETE APPLIED MATHEMATICS, 2018, 244 : 186 - 197
  • [36] Complexity of Distance Fraud Attacks in Graph-Based Distance Bounding
    Trujillo-Rasua, Rolando
    MOBILE AND UBIQUITOUS SYSTEMS: COMPUTING, NETWORKING, AND SERVICES, 2014, 131 : 289 - 302
  • [37] Towards Performance Evaluation of Graph-Based Representation
    Jouili, Salim
    Tabbone, Salvatore
    GRAPH-BASED REPRESENTATIONS IN PATTERN RECOGNITION, 2011, 6658 : 72 - 81
  • [38] Graph-based Ant System and its convergence
    Gutjahr, WJ
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2000, 16 (08): : 873 - 888
  • [39] A GRAPH-BASED DATA MODEL AND ITS RAMIFICATIONS
    LEVENE, M
    LOIZOU, G
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1995, 7 (05) : 809 - 823
  • [40] A graph-based clustering method and its applications
    Foggia, Pasquale
    Percannella, Gennaro
    Sansone, Carlo
    Vento, Mario
    ADVANCES IN BRAIN, VISION, AND ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2007, 4729 : 277 - +