A Metric for Class Structural Complexity Focusing on Relationships among Class Members (Special Issue on Knowledge-Based Software Engineering)
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we represent a class structure using directed graph in which each node corresponds to each member of the class. To quantify the dependence relationship among menbers, we define weighted closure. Using this quantified relationship and effort equation proposed by M.H.Halstead, we propose a metric for class structural complexity.
- 社団法人電子情報通信学会の論文
- 1998-12-25
著者
-
Yanaru Torao
The Department Of Electrical Electronic And Computer Engineering Faculty Of Engineering Kyushu Insti
-
Miyamoto K
Univ. Tokushima Tokushima Jpn
-
Aman H
Faculty Of Engineering Ehime University
-
AMAN Hirohisa
the Department of Electrical, Electronic and Computer Engineering, Faculty of Engineering, Kyushu In
-
NAGAMATSU Masahiro
the Department of Electrical, Electronic and Computer Engineering, Faculty of Engineering, Kyushu In
-
MIYAMOTO Kazunori
the Department of Electrical, Electronic and Computer Engineering, Faculty of Engineering, Kyushu In
-
Nagamatsu Masahiro
The Department Of Electrical Electronic And Computer Engineering Faculty Of Engineering Kyushu Insti
関連論文
- A Model for Detecting Cost-Prone Classes Based on Mahalanobis-Taguchi Method(Knowledge-Based Software Engineering)
- A Simple Predictive Method for Discriminating Costly Classes Using Class Size Metric(Software Engineering)
- A Class Cohesion Metric Focusing on Cohesive-Part Size(Metrics, Test, and Maintenance)(Knowledge-Based Software Engineering)
- A Graph-Based Class Structural Complexity Metric and Its Evaluation(Special Issue on Knowledge-Based Software Engineering)
- A Proposal of Class Cohesion Metrics focusing on Sizes of Cohesive Parts
- A Metric for Class Structural Complexity Focusing on Relationships among Class Members (Special Issue on Knowledge-Based Software Engineering)