The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Automatic clustering of software systems using a genetic algorithm
Abstract
Large software systems tend to have a rich and complex structure. Designers typically depict the structure of software systems as one or more directed graphs. For example, a directed graph can be used to describe the modules (or classes) of a system and their static interrelationships using nodes and directed edges, respectively. We call such graphs "module dependency graphs" (MDGs). MDGs can be large and complex graphs. One way of making them more accessible is to partition them, separating their nodes (i.e. modules) into clusters (i.e. subsystems). In this paper, we describe a technique for finding "good" MDG partitions. Good partitions feature relatively independent subsystems that contain modules which are highly interdependent. Our technique treats finding a good partition as an optimization problem, and uses a genetic algorithm (GA) to search the extraordinarily large solution space of all possible MDG partitions. The effectiveness of our technique is demonstrated by applying it to a medium-sized software system.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An Introduction to Genetic Algorithms
Mitchell, M. (1996) · doi:10.7551/mitpress/3927.001.0001 · Cited by 11,340
Software architecture: perspectives on an emerging discipline
Shaw, M., & Garlan, D. (1996) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,910
Foundations for the study of software architecture
Perry, D. E., & Wolf, A. L. (1992) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/141874.141884 · Cited by 2,023
Using automatic clustering to produce high-level system organizations of source code
Mancoridis, S., Mitchell, B. S., Rorres, C., Chen, Y., & Gansner, E. R. (2002) · Proceedings. 6th International Workshop on Program Comprehension. IWPC'98 (Cat. No.98TB100242) · doi:10.1109/wpc.1998.693283 · Cited by 484
Self-citationSoftware reflexion models: bridging the gap between source and high-level models
Murphy, G. C., Notkin, D., & Sullivan, K. (1995) · Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering · doi:10.1145/222124.222136 · Cited by 479
Using clustering algorithms in legacy systems remodularization
Wiggerts, T. A. (2002) · Proceedings of the Fourth Working Conference on Reverse Engineering · doi:10.1109/wcre.1997.624574 · Cited by 306
System Structure Analysis: Clustering with Data Bindings
Hutchens, D. H., & Basili, V. R. (1985) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1985.232524 · Cited by 265
An intelligent tool for re-engineering software modularity
Schwanke, R. W. (1991) · doi:10.5555/256664.256688 · Cited by 228
An intelligent tool for re-engineering software modularity
Schwanke, R. W. (2002) · [1991 Proceedings] 13th International Conference on Software Engineering · doi:10.1109/icse.1991.130626 · Cited by 163
The Turing programming language
Holt, R. C., & Cordy, J. R. (1988) · Communications of the ACM · doi:10.1145/53580.53581 · Cited by 103
A C++ data model supporting reachability analysis and dead code detection
Chen, Y.-F., Gansner, E. R., & Koutsofios, E. (1998) · IEEE Transactions on Software Engineering · doi:10.1109/32.713323 · Cited by 85
A C++ data model supporting reachability analysis and dead code detection
Chen, Y.-F. R., Gansner, E. R., & Koutsofios, E. (1997) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/267896.267924 · Cited by 16
Cited by
Search-based software engineering: Trends, techniques and applications
Harman, M., Mansouri, S. A., & Zhang, Y. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379787 · Cited by 777
Bunch: a clustering tool for the recovery and maintenance of software system structures
Mancoridis, S., Mitchell, B. S., Chen, Y., & Gansner, E. R. (1999) · Proceedings IEEE International Conference on Software Maintenance - 1999 (ICSM'99). 'Software Maintenance for Business Change' (Cat. No.99CB36360) · doi:10.1109/icsm.1999.792498 · Cited by 508
Self-citationOn the automatic modularization of software systems using the Bunch tool
Mitchell, B. S., & Mancoridis, S. (2006) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2006.31 · Cited by 479
Self-citationSoftware Module Clustering as a Multi-Objective Search Problem
Praditwong, K., Harman, M., & Yao, X. (2011) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2010.26 · Cited by 395
Metadata
- Authors
- Doval, D., Mancoridis, S., & Mitchell, B. S.
- Venue
- STEP '99. Proceedings Ninth International Workshop Software Technology and Engineering Practice
- Publisher
- IEEE Comput. Soc
- Published
- 2003-01-20
- Pages
- 73-81
- OpenAlex
- W1947878561
- Cited by
- 262
- References
- 12
- FWCI
- 11.46
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.