File(s) not publicly available
Recovering high-level structure of software systems using a minimum description length principle
presentation
posted on 2023-06-07, 20:18 authored by Rudi LutzIn [11] a system was described for finding good hierarchical decompositions of complex systems represented as collections of nodes and links, using a genetic algorithm, with an information theoretic fitness function (representing complexity) derived from a minimum description length principle. This paper describes the application of this approach to the problem of reverse engineering the high-level structure of software systems. Ref: 11. Lutz, R. (2001) Evolving Good Hierarchical Decompositions of Complex Systems. Journal of Systems Architecture, 47, pp. 613634.
History
Publication status
- Published
Publisher
Springer-VerlagExternal DOI
Pages
8.0Presentation Type
- paper
Event name
AICS'02: Proceedings of the 13th Irish International Conference on Artificial Intelligence and CognitiveScience pp 61-69Event type
conferenceDepartment affiliated with
- Informatics Publications
Notes
Originality: Presented an improved version of the complexity metric described in an earlier journal article, and applied it specifically to software systems Rigour: Significance: showed that the new metric could do a reasonable job of finding a heierarchical decompoistion of a complex software system, and on a "gold-standard" small design often used in the software-clustering literature Impact: 15 citations for this and previous journal article Outlet: this was a fully (3 referees) refereed international conferenceFull text available
- No
Peer reviewed?
- Yes
