Approximate code search in program histories

Proceedings - Working Conference on Reverse Engineering, WCRE

Volumn , Issue , 2011, Pages 109-118

  Bazrafshan, Saman ^a   Koschke, Rainer ^a   Göde, Nils ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

approximate search; clone detection; incremental search

Indexed keywords

APPROXIMATE MATCHES; APPROXIMATE SEARCH; CLONE DETECTION; CODE FRAGMENTS; CODE SEARCH; INCREMENTAL SEARCH; RUN-TIME MEASUREMENT;

DEFECTS; REVERSE ENGINEERING;

CODES (SYMBOLS);

EID: 83455205912     PISSN: 10951350     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WCRE.2011.22     Document Type: Conference Paper

References (33)

1. L. Aversano, L. Cerulo, and M. Di Penta, "How clones are maintained: An empirical study," in Proceedings of the 11th European Conference on Software Maintenance and Reengineering. IEEE Computer Society, 2007, pp. 81-90.
2. T. Bakota, R. Ferenc, and T. Gyimóthy, "Clone smells in software evolution," in Proceedings of the 23rd International Conference on Software Maintenance. IEEE Computer Society, 2007, pp. 24-33.
3. L. Jiang, Z. Su, and E. Chiu, "Context-based detection of clone-related bugs," in Proceedings of the 6th Joint Meeting on European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering. ACM, 2007, pp. 55-64.
4. E. Juergens, F. Deissenboeck, B. Hummel, and S. Wagner, "Do code clones matter?" in Proceedings of the 31st International Conference on Software Engineering. IEEE Computer Society, 2009, pp. 485-495.
5. Z. Li, S. Lu, S. Myagmar, and Y. Zhou, "CP-Miner: Finding copy-paste and related bugs in large-scale software code," IEEE Transactions on Software Engineering, vol. 32, no. 3, pp. 176-192, 2006.
6. S. Bazrafshan, "Klonerkennung in Programmhistorien," Diploma Thesis, University of Bremen, 2010.
7. R. A. Baeza-Yates, A., and C. H. Perleberg, "Fast and practical approximate string matching," Information Processing Letters, vol. 59, no. 1, pp. 21-27, 1996.
8. W. I. Chang and E. L. Lawler, "Approximate string matching in sublinear expected time," in Proceedings of the 31st Annual Symposium on Foundations of Computer Science. IEEE Computer Society, 1990, pp. 116-124.
9. -, "Sublinear approximate string matching and biological applications,"Algorithmica, vol. 12, no. 4, pp. 327-344, 1994.
10. E. W. Myers, "A sublinear algorithm for approximate keyword searching,"Algorithmica, vol. 12, no. 4, pp. 345-374, 1994.
11. D. Gusfield, Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. New York, NY, USA: Cambridge University Press, 2008.
12. S. Wu and U. Manber, "Fast text searching: allowing errors," Communications of the ACM, vol. 35, no. 10, pp. 83-91, 1992.
13. P. Pevzner and M. Waterman, "Multiple filtration and approximate pattern matching," Algorithmica, vol. 13, no. 1, pp. 135-154, 1995.
14. M. Lee, J. Roh, S. Hwang, and S. Kim, "Instant code clone search," in Proceedings of the International Symposium on Foundations of Software Engineering. ACM, 2010, pp. 167-176.
15. B. Hummel, E. Juergens, L. Heinemann, and M. Conradt, "Index-based code clone detection: Incremental, distributed, scalable," in Proceedings of the 26th International Conference on Software Maintenance. IEEE Computer Society, 2010.
16. C. K. Roy and J. R. Cordy, "A survey on software clone detection research," Queens University at Kingston, Ontario, Canada, Technical Report, 2007.
17. R. Koschke, "Survey of research on software clones," in Duplication, Redundancy, and Similarity in Software, ser. Dagstuhl Seminar Proceedings, R. Koschke, E. Merlo, and A. Walenstein, Eds., no. 06301. Dagstuhl, Germany: Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, 2007.
18. N. Göde and R. Koschke, "Incremental clone detection," in Proceedings of the European Conference on Software Maintenance and Reengineering. IEEE Computer Society, 2009, pp. 219-228.
19. -, "Studying clone evolution using incremental clone detection,"Journal of Software Maintenance and Evolution: Research and Practice, 2010, published online.
20. V. I. Levenstein, "Binary codes capable of correcting deletions insertions and reversals," Sov. Phys. Dokl., vol. 10, pp. 707-710, 1966.
21. D. Sankoff and J. Cedergren, Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Reading, MA, USA: Addison-Wesley, 1975.
22. E. M. McCreight, "A space-economical suffix-tree construction algorithm,"Journal of the ACM, vol. 23, no. 2, pp. 262-272, 1976.
23. E. Ukkonen, "On-line construction of suffix trees," Algorithmica 14, pp. 249-260, 1995.
24. P. Ferragina, R. Grossi, and M. Montagero, "A note on updating suffix tree labels," in Proceedings of the Third Italian Conference on Algorithms and Complexity. London, UK: Springer-Verlag, 1997, pp. 181-192.
25. N. Göde, "Incremental clone detection," Diploma Thesis, University of Bremen, September 2008.
26. W. I. Chang and J. Lampe, "Theoretical and empirical comparisons of approximate string matching algorithms," in Proceedings of the Third Symposium on Combinatorial Pattern Matching. Springer LNCS 644, 1992, pp. 175-184.
27. G. A. Stephen, String searching algorithms. River Edge, NJ, USA: World Scientific, 1994.
28. M. A. Bender and M. Farach-Colton, "The LCA problem revisited,"in Proceedings of the 4th Latin American Symposium on Theoretical Informatics, 2000, pp. 88-94.
29. G. Landau and U. Vishkin, "Introducing efficient parallelism into approximate string matching and a new serial algorithm," in Proceedings of ACM Symposium on the Theory of Computing, Berkeley, CA, USA, 1986, pp. 220-230.
30. G. M. Landau, U. Vishkin, and R. Nussinov, "An efficient string matching algorithm with k differences for nucleotide and amino acid sequences," Nucleic Acids Research, vol. 14, no. 1, pp. 31-46, 1986.
31. E. W. Myers, "An o(nd) difference algorithm and its variations," Algorithmica, vol. 1, pp. 251-266, 1986.
32. T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms. Cambridge, MA, USA: MIT Press and McGraw Hill, 1992.
33. S. S. Skiena, The Algorithm Design Manual. New York, NY, USA: Springer, 2008.