Title :
An investigation into the connectivity properties of source-header dependency graphs
Author :
Gannodt, G.C. ; Gannod, Gerald C.
Author_Institution :
Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA
fDate :
6/23/1905 12:00:00 AM
Abstract :
A modularization is a partitioning of a software system into components based on a variety of criteria, each depending on the clustering approach and desired level of abstraction. Source-header dependency graphs are bipartite graphs that are formed by flattening include file dependencies and enumerating source-file-to-header-file dependencies. In this paper, we describe an approach for identifying candidate modularizations of software systems by analyzing connectivity properties of source-header dependency graphs. In addition, we apply the approach to a large software system to demonstrate its applicability
Keywords :
graphs; reverse engineering; software engineering; subroutines; abstraction level; bipartite graphs; candidate modularizations; clustering; file dependencies; flattening; large software system; software system components partitioning; source-header dependency graph connectivity properties; Bipartite graph; Computer science; Genetics; Graph theory; NASA; Reverse engineering; Software maintenance; Software systems;
Conference_Titel :
Reverse Engineering, 2001. Proceedings. Eighth Working Conference on
Conference_Location :
Stuttgart
Print_ISBN :
0-7695-1303-4
DOI :
10.1109/WCRE.2001.957815
