CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Software Refactoring Technique for Code Clone Detection of Static and Dynamic Website

by K.kanagalakshmi, R.suguna
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 107 - Number 12
Year of Publication: 2014
Authors: K.kanagalakshmi, R.suguna
10.5120/18800-9919

K.kanagalakshmi, R.suguna . Software Refactoring Technique for Code Clone Detection of Static and Dynamic Website. International Journal of Computer Applications. 107, 12 ( December 2014), 1-10. DOI=10.5120/18800-9919

@article{ 10.5120/18800-9919,
author = { K.kanagalakshmi, R.suguna },
title = { Software Refactoring Technique for Code Clone Detection of Static and Dynamic Website },
journal = { International Journal of Computer Applications },
issue_date = { December 2014 },
volume = { 107 },
number = { 12 },
month = { December },
year = { 2014 },
issn = { 0975-8887 },
pages = { 1-10 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume107/number12/18800-9919/ },
doi = { 10.5120/18800-9919 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:40:51.310868+05:30
%A K.kanagalakshmi
%A R.suguna
%T Software Refactoring Technique for Code Clone Detection of Static and Dynamic Website
%J International Journal of Computer Applications
%@ 0975-8887
%V 107
%N 12
%P 1-10
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Now-a-days cloning of codes or programs of the developer or authorized person leads a positive approach. But the code cloning is done by unauthorized person leads a negative approach. In the recent years, many clone detection tools have been proposed. It produces an over whelming volume of simple clones of data or structure [3]. Code clone detection the content similarity between the programs or webpages. An attempt is made to desgn a method called "SD Code Clone Detection" for both static and dynamic webpages. It is based on levenshtein's approach. This method comprises some steps like, parsing & analysis, tree construction, code similarity measure and clone detection. Experiments are carried out with open source websites and webpages created by some volunteers. Experimental results are recorded and are showing the better detection rate.

References
  1. Aversano, L. , Canfora, G. , De Lucia, A. , and Gallucci, P. , 2001. Web Site Reuse: Cloning and Adapting. Proc. Of 3rd International Workshop on Web Site Evolution, Florence, Italy, IEEE CS Press, pp. 107-111.
  2. Chang C. -H. and S. -C. Lui, "IEPAD: Information Extraction Based on Pattern Discovery," Proc. Int'l Conf. World Wide Web (WWW-10), pp. 223-231, 2001.
  3. Cloning http://msdn. microsoft. com/en-us/library/hh205279. aspx
  4. De Lucia, A. , Scanniello, G. , and Tortora, G. , 2004. "Identifying Clones in Dynamic Web Sites Using Similarity Thresholds," Proc. Intl. Conf. on Enterprise Information Systems (ICEIS'04), pp. 391-396.
  5. Daniel B, D. Dig, K. Garcia, and D. Marinov, "Automated Testing of Refactoring Engines," Proc. Sixth Joint Meeting European Software Eng. Conf. and ACM SIGSOFT Symp. The Foundations of Software Eng. , pp. 185-194, 2007.
  6. Dig D, and R. Johnson, "The Role of Refactorings in API Evolution," Proc. 21st IEEE Int'l Conf. Software Maintenance,pp. 389-398, 2005.
  7. Eclipse. org, "Eclipse Project,"at http://www. eclipse. org, 2011.
  8. EmbarcaderoTechnologies,"JBuilder," http://www. codegear. com/br/products/jbuilder, 2011.
  9. "JDT Core Component," Eclipse. org, http://www. eclipse. org/ jdt/core/, 2011.
  10. Fowler M. , Refactoring: Improving the Design of Existing Code. Addison-Wesley Longman Publishing Co. , 1999.
  11. Goodenough J. B. and S. L. Gerhart, "Toward a Theory of Test Data Selection," SIGPLAN Notes, vol. 10, pp. 493-510, Apr. 1975.
  12. Gligoric M, T. Gvero, V. Jagannath, S. Khurshid, V. Kuncak, and D. Marinov, "Test Generation through Programming in UDITA," Proc. 32nd Int'l Conf. Software Eng. , vol. 1, pp. 225-234, 2010.
  13. Hoffman D. M, D. Ly-Gagnon, P. Strooper, and H. -Y. Wang, "Grammar-Based Test Generation with YouGen," Software: Prac- tice and Experience, vol. 41, pp. 427-447, Apr. 2011.
  14. Jackson D. , I. Schechter, and H. Shlyahter, "Alcoa: The Alloy Constraint Analyzer," Proc. 22nd Int'l Conf. Software Eng. , pp. 730-733, 2000.
  15. Jin W, A. Orso, and T. Xie, "Automated Behavioral Regression Testing," Proc. 23rd Int'l Conf. Software Testing, Verification and Validation, pp. 137-146, 2010.
  16. Kushmerick, D. Weld, and R. Doorenbos, "Wrapper Induction for Information Extraction," Proc. 15th Int'l Joint Conf. Artificial Intelligence (IJCAI), pp. 729-735, 1997.
  17. Muslea I. , S. Minton, and C. Knoblock, "A Hierarchical Approach to Wrapper Induction," Proc. Third Int'l Conf. Autonomous Agents (AA '99), 1999.
  18. Mens T. and T. Tourwe ?, "A Survey of Software Refactoring," IEEE Trans. Software Eng. , vol. 30, no. 2, pp. 126-139, Feb. 2004.
  19. Demeyer. S, Mens T, and D. Janssens, "Formalising Behaviour Preserving Program Transformations," Proc. First Int'l Conf. Graph Transformation, pp. 286-301, 2002.
  20. Marinov D and S. Khurshid, "TestEra: A Novel Framework for Automated Testing of Java Programs," Proc. IEEE 16th Int'l Conf. Automated Software Eng. , pp. 22-34, 2001.
  21. Opdyke W. F, "Refactoring Object-Oriented Frameworks," PhD dissertation, Univ. of Illinois at Urbana-Champaign, 1992.
  22. Overbey J. L and R. E. Johnson, "Differential Precondition Check-ing: A Lightweight, Reusable Analysis for Refactoring Tools," Proc. 26th IEEE/ACM Int'l Conf. Automated Software Eng. , pp. 303-312,
  23. Refactoring http://www. informit. com/articles/article. aspx
  24. Simon K and G. Lausen, "ViPER: Augmenting Automatic Information Extraction with Visual Perceptions," Proc. Int'l Conf. Information and Knowledge Management (CIKM), 2005.
  25. Sun Microsystems, "NetBeans IDE," http://www. netbeans. org/,2011.
  26. Scha ?fer M, M. Verbaere, T. Ekman, and O. Moor, "Stepping Stones over the Refactoring Rubicon," Proc. 23rd European Conf. Object-Oriented Programming, pp. 369-393, 2009.
  27. Moor O. de, Scha ?fer M and "Specifying and Implementing Refactorings," Proc. 25th ACM Int'l Conf. Object-Oriented Programming, Systems, Languages, and Applications, pp. 286-301, 2010.
  28. Ekman T. Scha ?fer M, and O. de Moor, "Challenge Proposal: Verification of Refactorings," Proc. Third Workshop Programming Languages Meets Program Verification, pp. 67-72, 2008.
  29. Gheyi. R Soares G, D. Serey, and T. Massoni, "Making Program Refactoring Safer," IEEE Software, vol. 27, no. 4, pp. 52-57, July/ Aug. 2010.
  30. Mongiovi M. , Soares G, and R. Gheyi, "Identifying Overly Strong Conditions in Refactoring Implementations," Proc. Conf. Software Maintenance, pp. 173-182, Sept. 2011.
  31. Silva L, A. Sampaio, and Z. Liu, "Laws of Object-Orientation with Reference Semantics," Proc. Sixth IEEE Int'l Conf. Software Eng. And Formal Methods, pp. 217-226, 2008.
  32. Moor O. de, Scha ?fer M, T. Ekman, and "Sound and Extensible Renaming for Java," Proc. 23rd ACM SIGPLAN Conf. Object Oriented Programming, Systems, Languages, and Applications, pp. 277-294, 2008.
  33. Tokuda L and D. Batory, "Evolving Object-Oriented Designs with Refactoring," Automated Software Eng. , vol. 8, pp. 89-120, Jan. 2001.
  34. Sourcemaking http://sourcemaking. com/refactoring/introduction-to-refactoring
  35. DOM Tree Algorithm :http://dbs. snu. ac. kr/papers/xsym09. pdf.
  36. Levenshtein Edit Distance Algorithm: http://www. levenshtein. net/ levenshtein measure http://en. wikibooks. org/wiki/Algorithm_Implementation/Strings/Levenshtein_distance.
Index Terms

Computer Science
Information Sciences

Keywords

Refactoring clone detection code clone static and dynamic pages DOM tree construct Levenshtein distance algorithm.

Powered by PhDFocusTM