Reducing program comprehension effort in evolving software by recognizing feature implementation convergence

IEEE International Conference on Program Comprehension

Volumn , Issue , 2007, Pages 17-26

  Kothari, Jay ^a   Denton, Trip ^a   Shokoufandeh, Ali ^a   Mancoridis, Spiros ^a  

^a Drexel University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALL GRAPHS; SOFTWARE APPLICATION;

COMPUTER PROGRAMMING; SEMANTICS;

COMPUTER SOFTWARE;

EID: 34948829152     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPC.2007.33     Document Type: Conference Paper

References (12)

1. J. Davey and E. Burd. Evaluating the suitability of data clustering for softwareremodularisation. Reverse Engineering, 2000. Proceedings. Seventh Working Conference on, pages 268-276, 2000.
2. T. Eisenbarth, R. Koschke, and D. Simon. Locating features in source code. IEEE Trans. Software Eng., 29(3):210-224, 2003.
3. M. R. Gary and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco, 1979. (ND2,SR1).
4. I. Hsi and C. Potts. Studying the Evolution and Enhancement of Software Features. Proceedings of the 2000 IEEE International Conference on Software Maintenance, pages 143-151, 2000.
5. J. Kothari, T. Denton, S. Mancoridis, and A. Shokoufandeh. On computing the canonical features of software systems. In Proceedings of the 13th Working Conference on Reverse Engineering (WCRE 2006, Benevento, October 23-27),. IEEE Computer Society, 2006.
6. J. Kothari, T. Denton, A. Shokoufandeh, S. Mancoridis, and A. E. Hassan. Studying the evolution of sofware systems using change clusters. In Proceedings of the 14th International Conference on Program Comprehension (ICPC 2006, Athens, June 14-16),. IEEE Computer Society, 2006.
7. M. Mandal, T. Aboulnasr, and S. Panchanathan. Image indexing using moments an wavelets. In IEEE Transactions on Consumer Electronics, pages 557-565, Rosemont, IL, USA, 1996. IEEE.
8. T. Motzkin and E. Straus. Maxima for graphs and a new proof of theorem of turan. Canadian Journal of Mathematics, 17:533-540, 1965.
9. G. Murphy and D. Notkin. Software reflexion models: Bridging the gap between source and high-level models. In ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE '95), 1995.
10. J. Novatnack, T. Denton, A. Shokoufandeh, and L. Bretzner. Stable bounded canonical sets and image matching. In Energy Minimization Methods in Computer Vision and Pattern Recognition (EMMCVPR), pages 316-331, November 2005.
11. M. Pelillo, K. Siddiqi, and S. W. Zucker. Matching hierarchical structures using association graphs. Lecture Notes in Computer Science, 1407, 1998.
12. J. Rilling, W. Meng, and O. Ormandjieva. Context driven slicing based coupling measures. Software Maintenance, 2004. Proceedings. 20th IEEE International Conference on, 2004.