Recovering High-Level Structure of Software Systems Using a Minimum Description Length Principle

Lutz, Rudi (2002) Recovering High-Level Structure of Software Systems Using a Minimum Description Length Principle. In: AICS'02: Proceedings of the 13th Irish International Conference on Artificial Intelligence and CognitiveScience pp 61-69.

Full text not available from this repository.

Abstract

In [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.

Item Type: Conference or Workshop Item (Paper)
Additional Information: 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 conference
Schools and Departments: School of Engineering and Informatics > Informatics
Depositing User: Rudi Lutz
Date Deposited: 06 Feb 2012 18:30
Last Modified: 31 May 2012 10:38
URI: http://sro.sussex.ac.uk/id/eprint/16809
📧 Request an update