Composing subsystem structures using (k,2)-partite graphs

Müller, Hausi A.; Uhl, James S.

doi:10.1109/icsm.1990.131315

Cited by 37 publications

(17 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The natural decomposition of a software system is usually presented as a nested decomposition [3]. Many different methodologies and approaches that attempt to create such decompositions automatically have been presented in the literature [1,2,3,5,7,10]. Most of them produce nested decompositions.…”

Section: Introductionmentioning

confidence: 99%

Lossless Comparison of Nested Software Decompositions

Shtern

Tzerpos

2007

14th Working Conference on Reverse Engineering (WCRE 2007)

View full text Add to dashboard Cite

Reverse engineering legacy software systems often involves the employment of clustering algorithms that automatically decompose a software system into subsystems. The decompositions created by existing software clustering algorithms are often nested, i.e. subsystems may contain other finer-grained subsystems as well as system resources, such as source files. It is rather surprising then, that almost all existing methods for decomposition comparison assume flat decompositions, i.e. subsystems only contain system resources.In this paper, we introduce UpMoJo, a novel comparison method for software decompositions that can be applied to both nested and flat decompositions. The benefits of utilizing this method are presented in both analytical and experimental fashion. We also compare UpMoJo to the END framework, the only other existing method for nested decomposition comparison.

show abstract

Section: Introductionmentioning

confidence: 99%

Lossless Comparison of Nested Software Decompositions

Shtern

Tzerpos

2007

14th Working Conference on Reverse Engineering (WCRE 2007)

View full text Add to dashboard Cite

show abstract

“…It consists of functions, types, and variables together with call, data, and type relationships among them that can directly be derived from source code. RFGs are used in approaches to detect subsystems [Müll90] and abstract data types [Gira97]. In both applications, higher abstractions are added to those directly derived from source code: the concepts of subsystems and abstract data types.…”

Section: Entity-relationship Graphmentioning

confidence: 99%

An intermediate representation for integrating reverse engineering analyses

Koschke

Girard

Wurthner

1998

Proceedings Fifth Working Conference on Reverse Engineering (Cat. No.98TB100261)

View full text Add to dashboard Cite

show abstract

“…Omnipresent classes represent crosscutting concerns, utility functionalities or elementary domain concepts such as entities. Their basic attributes are that they are called by a vast number of classes in the system [6,7,8,9,10,11,5,12], directly or indirectly, and they are usually located in 20 the bottom architectural layers. However, they are not very important from an architectural point of view in SAR activities, since they do not necessarily represent architecturally significant decisions [13].…”

Section: Introductionmentioning

confidence: 99%

“…One of our contributions is that we can assist in the exclusion of noise as a preparatory procedure prior to modularization or feature location processes and not only to SAR techniques. In general, any approach attempting to comprehend a system for the identification of higher-level constructs, such as architecturally significant program elements or program elements related to a 40 feature, should first remove elements that represent noise in the system [5,8,9].…”

Section: Introductionmentioning

confidence: 99%