Proceedings Eighth Working Conference on Reverse Engineering (2001)
Oct. 2, 2001 to Oct. 5, 2001
Gerald C. Gannod , Arizona State University
Barbara D. Gannod , Arizona State University
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.
reverse engineering, modularization, clustering, graph connectivity
B. D. Gannod and G. C. Gannod, "An Investigation into the Connectivity Properties of Source-Header Dependency Graphs," Proceedings Eighth Working Conference on Reverse Engineering(WCRE), Suttgart, Germany, 2001, pp. 115.