The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
A representação adequada da complexidade da estrutura de classes será útil no desenvolvimento de software orientado a objetos. Embora algumas métricas de complexidade de classe tenham sido propostas, elas ignoraram as direções dos relacionamentos de acoplamento entre métodos e atributos, como se um método grava dados em um atributo ou lê dados do atributo. Neste artigo, usamos um modelo de gráfico direcionado para representar tais relações de acoplamento. Com base no modelo de grafos direcionados, propomos uma métrica de complexidade estrutural de classes. A métrica proposta satisfaz as condições necessárias da métrica de complexidade sugerida por Briand e outros. O seguinte fato é mostrado por dados experimentais de classes Java. Embora a métrica proposta siga uma métrica convencional, a métrica proposta pode capturar um aspecto da complexidade estrutural da classe que é perdido pela convencional.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Hirohisa AMAN, Hiroyuki YAMADA, Matu-Tarow NODA, Torao YANARU, "A Graph-Based Class Structural Complexity Metric and Its Evaluation" in IEICE TRANSACTIONS on Information,
vol. E85-D, no. 4, pp. 674-684, April 2002, doi: .
Abstract: 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 propose a metric of class structural complexity. The proposed metric satisfies necessary conditions of complexity metric suggested 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e85-d_4_674/_p
Copiar
@ARTICLE{e85-d_4_674,
author={Hirohisa AMAN, Hiroyuki YAMADA, Matu-Tarow NODA, Torao YANARU, },
journal={IEICE TRANSACTIONS on Information},
title={A Graph-Based Class Structural Complexity Metric and Its Evaluation},
year={2002},
volume={E85-D},
number={4},
pages={674-684},
abstract={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 propose a metric of class structural complexity. The proposed metric satisfies necessary conditions of complexity metric suggested 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.},
keywords={},
doi={},
ISSN={},
month={April},}
Copiar
TY - JOUR
TI - A Graph-Based Class Structural Complexity Metric and Its Evaluation
T2 - IEICE TRANSACTIONS on Information
SP - 674
EP - 684
AU - Hirohisa AMAN
AU - Hiroyuki YAMADA
AU - Matu-Tarow NODA
AU - Torao YANARU
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E85-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 2002
AB - 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 propose a metric of class structural complexity. The proposed metric satisfies necessary conditions of complexity metric suggested 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.
ER -