.png){kind=icon}
返回
Moral dominance relations for program comprehension
.png){kind=icon}
OA
AI
DOI：10.1109/TSE.2003.1232289.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Dominance trees have been used as a means for reengineering legacy systems into potential reuse candidates. The dominance relation suggests the reuse candidates which are identified by strongly directly dominated subtrees. We review the approach and illustrate how the dominance tree may fail to show the relationship between the strongly directly dominated procedures and the directly dominated procedures. We introduce a relation of generalized conditional independence which strengthens the argument for the adoption of the potential reuse candidates suggested by the dominance tree and explains their relationship with the directly dominated vertices. This leads to an improved dominance tree, the moral dominance tree, which helps aid program comprehension available from the tree. The generalized conditional independence relation also identifies potential reuse candidates that are missed by the dominance relation.
Keyword:
directed graphical model
generalized conditional independence
dominance tree
program comprehension
reengineering
reuse candidate
reverse engineering
testing
期刊
IF:
5.6
论文数:
2.9K
被引数:
1.1W
机构
暂无机构信息
引用论文
.png){kind=icon}
Improving the analysis of dependable systems by mapping fault trees into Bayesian networks通过将故障树映射到贝叶斯网络来改善对可靠系统的分析
PREAI
分享收藏分享收藏
查看更多内容