An investigation into the connectivity properties of source-header dependency graphs Export

@inproceedings{citeulike:890950, 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}, author = {Gannodt, G. C. and Gannod, B. D.}, citeulike-article-id = {890950}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=957815}, journal = {Reverse Engineering, 2001. Proceedings. Eighth Working Conference on}, keywords = {header, include}, pages = {115--124}, posted-at = {2006-10-10 04:58:31}, priority = {4}, title = {An investigation into the connectivity properties of source-header dependency graphs}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=957815}, year = {2001} }

TY - CONF ID - citeulike:890950 L3 - citeulike-article-id:890950 N2 - 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 JF - Reverse Engineering, 2001. Proceedings. Eighth Working Conference on EP - 124 TI - An investigation into the connectivity properties of source-header dependency graphs SP - 115 KW - header KW - include AU - Gannodt, GC AU - Gannod, BD PY - 2001/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=957815 ER -