2005 · 122 citations · 36 references
ComputingComputer ScienceRequirements EngineeringSoftware EngineeringSystems ArchitectureSoftware ArchitectureSoftware EvolutionSoftware MaintenanceSoftware ModelingVersion ControlVersion Control SystemsSoftware Evolution AnalysisSoftware VersioningSource Code Change AnalysisSubsystem Interactions
Software changes are cheaper and less error‑prone when confined to a single subsystem, so artifacts that co‑change frequently can indicate subsystem boundaries. The study proposes a two‑step method to identify clusters of frequently co‑changed software artifacts. The method first extracts a co‑change graph from version control, then computes a layout that satisfies derived requirements using an energy model to reveal artifact clusters. Evaluation on three systems showed that the generated layouts align with authoritative decompositions.
Changes of software systems are less expensive and less error-prone if they affect only one subsystem. Thus, clusters of artifacts that are frequently changed together are subsystem candidates. We introduce a two-step method for identifying such clusters. First, a model of common changes of software artifacts, called co-change graph, is extracted from the version control repository of the software system. Second, a layout of the co-change graph is computed that reveals clusters of frequently co-changed artifacts. We derive requirements for such layouts, and introduce an energy model for producing layouts that fulfill these requirements. We evaluate the method by applying it to three example systems, and comparing the resulting layouts to authoritative decompositions.
36
A hierarchical O(N log N) force-calculation algorithm
Josh Barnes, Piet Hut · Nature · 1986 · 3.7K citations
An algorithm for drawing general undirected graphs
Tomihisa Kamada, Satoru Kawai · Information Processing Letters · 1989 · 2.8K citations
P. Eades · 1984 · 1.2K citations