Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Software salvaging and the call dominance tree
Journal of Systems and Software
A method for the identification of reusable units through the reengineering of legacy code
Journal of Systems and Software
Identifying objects in legacy systems using design metrics
Journal of Systems and Software
Flow Analysis of Computer Programs
Flow Analysis of Computer Programs
Introduction to Bayesian Networks
Introduction to Bayesian Networks
Probabilistic Networks and Expert Systems
Probabilistic Networks and Expert Systems
Bayesian Graphical Models for Software Testing
IEEE Transactions on Software Engineering
Supporting program comprehension using dominance trees
Annals of Software Engineering
Analysing Large COBOL Programs: the extraction of reusable modules
ICSM '96 Proceedings of the 1996 International Conference on Software Maintenance
Extracting Reusable Modules from Legacy Code: considering the issues of module granularity
WCRE '96 Proceedings of the 3rd Working Conference on Reverse Engineering (WCRE '96)
Identifying objects in legacy systems
WPC '97 Proceedings of the 5th International Workshop on Program Comprehension (WPC '97)
Enriching Program Comprehension for Software Reuse
WPC '97 Proceedings of the 5th International Workshop on Program Comprehension (WPC '97)
Evaluating the Use of Dominance Trees for C and COBOL
ICSM '99 Proceedings of the IEEE International Conference on Software Maintenance
E-BUS: a toolkit for extracting business services from java software systems
Companion of the 30th international conference on Software engineering
Improving software modularization via automated analysis of latent topics and dependencies
ACM Transactions on Software Engineering and Methodology (TOSEM)
| Hi-index | 0.00 |
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.