메뉴 건너뛰기




Volumn , Issue , 2005, Pages 156-165

Detecting higher-level similarity patterns in programs

Author keywords

Clone detection; Similarity patterns; Software clones

Indexed keywords

CLONING; CODES (SYMBOLS); COMPUTER PROGRAMMING; INFORMATION ANALYSIS; PROBLEM SOLVING;

EID: 32344438117     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1095430.1081733     Document Type: Conference Paper
Times cited : (85)

References (42)
  • 1
    • 84956970756 scopus 로고    scopus 로고
    • The enhanced suffix array and its applications to genome analysis
    • Lecture Notes in Computer Science, Springer-Verlag, Berlin
    • Abouelhoda, M.I., Kurtz, S., and Ohlebusch, E. The enhanced suffix array and its applications to genome analysis. In Proc. Workshop on Algorithms in Bioinformatics, in Lecture Notes in Computer Science, vol. 2452, Springer-Verlag, Berlin, 2002, pp. 449-463.
    • (2002) Proc. Workshop on Algorithms in Bioinformatics , vol.2452 , pp. 449-463
    • Abouelhoda, M.I.1    Kurtz, S.2    Ohlebusch, E.3
  • 3
    • 84858548699 scopus 로고    scopus 로고
    • ANTLR website at http:// www.antlr.org
  • 5
    • 0029222025 scopus 로고
    • On finding duplication and near-duplication in large software systems
    • Baker, B. S. On finding duplication and near-duplication in large software systems. In Proc. 2nd Working Conference on Reverse Engineering. 1995, pages 86-95.
    • (1995) Proc. 2nd Working Conference on Reverse Engineering , pp. 86-95
    • Baker, B.S.1
  • 6
    • 0013238532 scopus 로고    scopus 로고
    • Parameterized duplication in strings: Algorithms and an application to software maintenance
    • October
    • Baker, B. S. Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance. SIAM Journal of Computing, October 1997.
    • (1997) SIAM Journal of Computing
    • Baker, B.S.1
  • 8
    • 0024699072 scopus 로고
    • Design recovery for maintenance and reuse
    • July
    • Biggerstaff, T.J. Design Recovery for Maintenance and Reuse. Computer 22(7), pp. 36-49, (July 1989).
    • (1989) Computer , vol.22 , Issue.7 , pp. 36-49
    • Biggerstaff, T.J.1
  • 11
    • 84952201613 scopus 로고
    • Dotplot: A program for exploring self-similarity in million of lines of text and code
    • June
    • Church, K. W. and Helfman, J, I. Dotplot: A program for exploring self-similarity in million of lines of text and code. Journal of Computational and Graphical Statistics, June 1993, 2(2):153-174.
    • (1993) Journal of Computational and Graphical Statistics , vol.2 , Issue.2 , pp. 153-174
    • Church, K.W.1    Helfman, J.I.2
  • 19
    • 84858538936 scopus 로고    scopus 로고
    • Java Technology at http://java.sun.com/
  • 24
    • 32344441944 scopus 로고    scopus 로고
    • Linear time longest common prefix computation in suffix arrays and its applications
    • LNCS 2089
    • Kasai, T., Lee, G., Arimura, H., Arikawa, S., and Park, K. Linear time longest common prefix computation in suffix arrays and its applications. CPU 2001, LNCS 2089.
    • CPU 2001
    • Kasai, T.1    Lee, G.2    Arimura, H.3    Arikawa, S.4    Park, K.5
  • 25
    • 0034826796 scopus 로고    scopus 로고
    • Design and implementation of generics for the. NET common language runtime
    • Cindy Norris and James B. Fenwick, Jr., editors, New York, June. ACM Press. Appears as volume 35, number 5 of SIGPLAN Notices
    • Kennedy, A., and Syme, D. Design and implementation of generics for the .NET Common Language Runtime. In Cindy Norris and James B. Fenwick, Jr., editors, Proceedings of the ACMSIGPLAN '01 Conference on Programming Languages Design and Implementation (PLDI-01), pages 1-12, New York, June 2001. ACM Press. Appears as volume 35, number 5 of SIGPLAN Notices.
    • (2001) Proceedings of the ACMSIGPLAN '01 Conference on Programming Languages Design and Implementation (PLDI-01) , pp. 1-12
    • Kennedy, A.1    Syme, D.2
  • 32
    • 0027681165 scopus 로고
    • Suffix arrays: A new method for on-line search
    • Manber, U., and Myers, G. Suffix arrays: a new method for on-line search. SIAM Journal of Computing, 22:935-48, 1993.
    • (1993) SIAM Journal of Computing , vol.22 , pp. 935-948
    • Manber, U.1    Myers, G.2
  • 36
    • 32344448523 scopus 로고    scopus 로고
    • Scalable hierarchical clustering method for sequences of categorical values
    • Knowledge Discovery and Data Mining - PAKDD 2001. April 16-18, 2001. Lecture Notes in Artificial Intelligence 2035, Springer Verlag
    • Morzy, T., Wojciechowski, M., and Zakrzewicz, M. Scalable Hierarchical Clustering Method for Sequences of Categorical Values. In Knowledge Discovery and Data Mining - PAKDD 2001. In Proceedings 5th Pacific-Asia Conference, Hong Kong, China. April 16-18, 2001. Lecture Notes in Artificial Intelligence 2035, Springer Verlag, 2001.
    • (2001) Proceedings 5th Pacific-Asia Conference, Hong Kong, China
    • Morzy, T.1    Wojciechowski, M.2    Zakrzewicz, M.3
  • 40
    • 0031673367 scopus 로고    scopus 로고
    • A fast algorithm for making suffix arrays and for Burrows-Wheeler transformation
    • Sadakane, K. A fast algorithm for making suffix arrays and for Burrows-Wheeler transformation. In Proc. IEEE Data Compression Conference (1998) 129-138.
    • (1998) Proc. IEEE Data Compression Conference , pp. 129-138
    • Sadakane, K.1
  • 41
    • 0003885423 scopus 로고    scopus 로고
    • Addison-Wesley Publishing Co., New York
    • Somerville, I. Software Engineering, Addison-Wesley Publishing Co., New York (1998).
    • (1998) Software Engineering
    • Somerville, I.1
  • 42
    • 84858543519 scopus 로고    scopus 로고
    • XVCL website at : http://xvcl.comp.nus.edu.sg/overview_brochure.php


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.