Allowing overlapping boundaries in source code using a search based approach to concept binding

IEEE International Conference on Software Maintenance, ICSM

Volumn , Issue , 2006, Pages 310-319

  Gold, Nicolas ^a   Harman, Mark ^a   Zheng, Li ^a   Mahdavi, Kiarash ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; COBOL (PROGRAMMING LANGUAGE); GENETIC ALGORITHMS; RANDOM PROCESSES;

CONCEPT BINDING; NONOVERLAPPING BOUNDARIES; OVERLAPPING BOUNDARIES; SOURCE CODES;

CODES (SYMBOLS);

EID: 34547340486     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSM.2006.10     Document Type: Conference Paper

References (28)

1. I. D. Baxter. Design maintenance systems. Communications of the Association for Computing Machinery, 35:73-89, April 1992.
2. T. J. Biggerstaff, B. G. Mittbander, and D. Webster. The concept assignment problem in program understanding. In Proceedings of the 15th international conference on Software Engineering (ICSE 1993). IEEE Computer, 1993.
3. J. R. Cordy, T. R. Dean, and A. J. Malton. Source Transformation in Software Engineering using the TXL Transformation System. Information and Software Technology, 44:827-837, October 1996.
4. P. Devanbu, R. Brachman, P. Selfridge, and B. Ballard. LaSSIE: A Knowledge-Based Software Information System. CACM, 34(5):34-49, May 1991.
5. N. Gold. Hypothesis-Based Concept Assignment to Support Software Maintenance. In Proceedings IEEE International Conference on Software Maintenance 2001, pages 545-548, 2001.
6. N. Gold and K. H. Bennett. A Flexible Method for Segmentation in Concept Assignmen. In IWPC, pages 135-144, 2001.
7. N. Gold and K. H. Bennett. Hypothesis-based concept assignment in software maintenance. IEE Proceedings - Software, 149(4):103-110, 2002.
8. N. E. Gold. Hypothesis-Based Concept Assignment to Support Software Maintenance. PhD thesis, Research Institute in Software Evolution, Department of Computer Science, University of Durham, 2000.
9. N. E. Gold, M. Harman, D. Binkley, and R. M. Hierons. Unifying program slicing and concept assignment for higher-level executable source code extraction. j-SPE, 35(10):977-1006, Aug. 2005.
10. D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Publishing Company, 1989.
11. D. E. Goldberg, B. Korb, and K. Deb. Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems, 3:493-530, 1989.
12. GrammaTech-CodeSurfer. http://www.grammatech.com/products/codesurfer/.
13. M. Harman, N. Gold, R. M. Hierons, and D. Binkley. Code Extraction Algorithms which Unify Slicing and Concept Assignment. In WCRE, pages 11-21, 2002.
14. J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press (Second edition MIT Press 1992), second edition, 1975.
15. S. Horwitz, T. W. Reps, and D. Binkley. Interprocedural Slicing Using Dependence Graphs. In PLDI, pages 35-46, 1988.
16. V. Karakostas. Intelligent Search and Acquisition of Business Knowledge from Programs. Journal of Software Maintenance: Research and Practice, 4:1-17, 1992.
17. T. Kohonen. Self-Organising Maps, volume 30 of Springer Series in Information Sciences. Springer, third edition edition, 2001.
18. D. L. Kreher and D. R. Stinson. Combinatorial Algorithms. Generation, Enumeration and Search. CRC Press, 1999.
19. B. Laguë and M. Dagenais. An Analysis Framework for Understanding Layered Software Architectures. In IWPC '98: Proceedings of the 6th International Workshop on Program Comprehension, pages 37-44. IEEE Computer Society, June 1998.
20. T. K. Landauer, P. W. Foltz, and D. Laham. An Introduction to Latent Semantic Analysis. Discourse Processes, 25:259-284, 1998.
21. S. Letovsky and E. Soloway. Delocalized Plans and Program Comprehension. IEEE Software, 3(3):41-49, May 1986.
22. A. Marcus, A. Sergeyev, V. Rajlich, and J. Maletic. An Information Retrieval Approach to Concept Location in Source Code. In Proceedings of the 11th Working Conference on Reverse Engineering (WCRE 2004), pages 214-223, Nov. 2004.
23. M. Mitchell. An Introduction to Genetic Algorithms. MIT Press, 7 edition, 2001.
24. C. Rich and R. C. Waters. The programmer's apprentice. Computer, 21(11):10-25, Nov. 1988.
25. S. Tilley. A Reverse-Engineering Environment Framework. Technical Report CMU/SEI-98-TR-005, ESC-TR-98-005, Software Engineering Institute, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213, April 1998.
26. M. Ward. Proving Program Refinements and Transformations. PhD thesis, Oxford University, 1989.
27. M. Weiser. Program slicing. IEEE Transactions on Software Engineering, 10:352-357, July 1984.
28. L. Wills. Automated Program Recognition by Graph Parsing. PhD thesis, MIT Artificial Intelligence Lab, July 1992.