Recovering high-level structure of software systems using a minimum description length principle

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2464, Issue , 2002, Pages 61-69

  Lutz, Rudi ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; ARTIFICIAL INTELLIGENCE; COMPUTER SOFTWARE; GENETIC ALGORITHMS; INFORMATION THEORY; REVERSE ENGINEERING;

FITNESS FUNCTIONS; HIERARCHICAL DECOMPOSITIONS; HIGH-LEVEL STRUCTURE; MINIMUM DESCRIPTION LENGTH PRINCIPLE; NODES AND LINKS; SOFTWARE SYSTEMS;

HIERARCHICAL SYSTEMS;

EID: 84937411389     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45750-x_8     Document Type: Conference Paper

References (21)

1. Briand, L.C., Morasca, S., and Basili, V.R. (1996) Property-based software engineering measurement: Refining the additivity properties. IEEE Transactions on Software Engineering, 22(1):68-86.
2. Collins, R. and Jefferson, D. (1991) Selection in massively parallel genetic algorithms. Proceedings of the Fourth International Conference on Genetic Algorithms, ICGA-91 Belew, R.K. and Booker, L.B. (eds.), Morgan Kaufmann.
3. Doval, D., Mancoridis, S., and Mitchell, B.S. (1999) Automatic Clustering of Software Systems using a Genetic Algorithm. IEEE Proceedings of the 1999 International Conference on Software Tools and Engineering Practice (STEP'99).
4. Glover, F. (1989) Tabu Search-Part I. ORSA Journal on Computing, Vol. 1, No. 3, pp. 190-206.
5. Goldberg, D.E. (1989) Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley.
6. Harman, M., Hierons, R., and Proctor, M. (2002) A New Representation and Crossover Operator for Search-Based Optimization of Software Modularization. Submitted to GECCO-2002.
7. Holland, J.H. (1975) Adaptation in Natural and Artificial Systems. Now published by MIT Press.
8. Hutchens, D., and Basili, R. (1985) System StructureAnalysis: Clustering with Data Bindings. IEEE Transactions on Software Engineering, SE-11(8):749-757, 1985.
9. Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P. (1983) Optimization by Simulated Annealing, Science, 220, 4598, 671-680.
10. Koza, J.R. (1992) Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press.
11. Li, M. and Vitanyi, P. (1997) An Introduction to Kolmogorov Complexity Theory and Its Applications. Springer-Verlag.
12. Lutz, R. (2001) Evolving Good Hierarchical Decompositions of Complex Systems. Journal of Systems Architecture, 47, pp. 613-634.
13. Mancoridis, S., Mitchell, B.S., Rorres, C., Chen, Y.,Gansner, E.R. (1998) Using automatic clustering to produce high-level system organizations of source code. In International Workshop on Program Comprehension (IWPC'98) IEEE Computer Society Press, Los Alamitos, California, USA, pp.45-53.
14. McIlhagga, M., Husbands, P., and Ives, R. (1996)A comparison of simulated annealing, dispatching rules and a coevolutionary distributed genetic algorithm as optimization techniques for various integrated manufacturing planning problems. In Proceedings of PPSN IV,Volume I. LNCS 1141, pp. 604-613, Springer-Verlag.
15. Mitchell, M. (1996) An Introduction to Genetic Algorithms. MIT Press.
16. Mitchell, T.M. (1997) Machine Learning. McGraw-Hill.
17. Rissanen, J. (1978) Modelling by the shortest data description. Automatica-J.IFAC, 14, pp.465-471.
18. Shannon, C.E. (1948) The mathematical theory of communications. Bell System Technical Journal 27:379-423, 623-656.
19. Thornton, C.J. and du Boulay, B. (1992) Artificial Intelligence Through Search. Intellect, Oxford, England.
20. Wiggerts, T. (1997) Using clutering algorithms in legacy systems remodularisation. In Proc. Working Conference on Reverse Engineering (WCRE'97)
21. Wood, J.A. (1998) Improving Software Designs via the Minimum Description Length Principle. Ph.D. Thesis, University of Sussex (available from http://cogslib.cogs.susx.ac.uk)