메뉴 건너뛰기




Volumn , Issue , 2010, Pages 167-176

Instant code clone search

Author keywords

clone detection; code search

Indexed keywords

CLONE DETECTION; CODE CLONE; CODE CLONE DETECTION; CODE DEVELOPMENT; CODE SEARCH; CODE SEGMENTS; COMMERCIAL CODES; INDEXING STRUCTURES; LARGE-SCALE SOFTWARES; OPEN SOURCE PROJECTS; RESPONSE TIME; SEMANTIC CODES; TWO-LINE;

EID: 78751519375     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1882291.1882317     Document Type: Conference Paper
Times cited : (47)

References (32)
  • 3
    • 0025447750 scopus 로고
    • The r*-tree: An efficient and robust access method for points and rectangles
    • N. Beckmann, H. peter Begel, R. Schneider, and B. Seeger. The r*-tree: an efficient and robust access method for points and rectangles. In SIGMOD, 1990.
    • (1990) SIGMOD
    • Beckmann, N.1    Begel, H.P.2    Schneider, R.3    Seeger, B.4
  • 4
    • 0012975570 scopus 로고    scopus 로고
    • Improving the query performance of high-dimensional index structures by bulk-load operations
    • S. Berchtold, C. Böhm, and H.-P. Kriegel. Improving the query performance of high-dimensional index structures by bulk-load operations. In EDBT, 1998.
    • (1998) EDBT
    • Berchtold, S.1    Böhm, C.2    Kriegel, H.-P.3
  • 5
    • 28444487526 scopus 로고    scopus 로고
    • An evaluation of generic bulk loading techniques
    • J. V. d. Bercken and B. Seeger. An evaluation of generic bulk loading techniques. In VLDB, 2001.
    • (2001) VLDB
    • Bercken, J.V.D.1    Seeger, B.2
  • 6
    • 31644437209 scopus 로고    scopus 로고
    • The k-nearest neighbour join: Turbo charging the kdd process
    • C. Böhm and F. Krebs. The k-nearest neighbour join: Turbo charging the kdd process. Knowl. Inf. Syst., 6(6):728-749, 2004.
    • (2004) Knowl. Inf. Syst. , vol.6 , Issue.6 , pp. 728-749
    • Böhm, C.1    Krebs, F.2
  • 7
    • 15044355327 scopus 로고    scopus 로고
    • Similarity search in high dimensions via hashing
    • A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In VLDB, 1999.
    • (1999) VLDB
    • Gionis, A.1    Indyk, P.2    Motwani, R.3
  • 8
    • 0000701994 scopus 로고    scopus 로고
    • Distance browsing in spatial databases
    • G. R. Hjaltason and H. Samet. Distance browsing in spatial databases. ACM TODS, 24:265-318, 1999.
    • (1999) ACM TODS , vol.24 , pp. 265-318
    • Hjaltason, G.R.1    Samet, H.2
  • 9
    • 33244490514 scopus 로고    scopus 로고
    • Using structural context to recommend source code examples
    • R. Holmes and G. C. Murphy. Using structural context to recommend source code examples. In ICSE, 2005.
    • (2005) ICSE
    • Holmes, R.1    Murphy, G.C.2
  • 10
    • 33947312500 scopus 로고    scopus 로고
    • Approximate structural context matching: An approach to recommend relevant examples
    • R. Holmes, R. J. Walker, and G. C. Murphy. Approximate structural context matching: An approach to recommend relevant examples. IEEE Trans. Softw. Eng., 32(12):952-970, 2006.
    • (2006) IEEE Trans. Softw. Eng. , vol.32 , Issue.12 , pp. 952-970
    • Holmes, R.1    Walker, R.J.2    Murphy, G.C.3
  • 11
    • 34548767669 scopus 로고    scopus 로고
    • DECKARD: Scalable and accurate tree-based detection of code clones
    • L. Jiang, G. Misherghi, Z. Su, and S. Glondu. DECKARD: Scalable and accurate tree-based detection of code clones. In ICSE, 2007.
    • (2007) ICSE
    • Jiang, L.1    Misherghi, G.2    Su, Z.3    Glondu, S.4
  • 12
    • 33746636117 scopus 로고    scopus 로고
    • Springer Series in Statistics
    • Springer, 2nd edition
    • I. T. Jolliffe. Principal Component Analysis. Springer Series in Statistics. Springer, 2nd edition, 2002.
    • (2002) Principal Component Analysis
    • Jolliffe, I.T.1
  • 15
    • 0036648690 scopus 로고    scopus 로고
    • CCFinder: A multilinguistic token-based code clone detection system for large scale source code
    • T. Kamiya, S. Kusumoto, and K. Inoue. CCFinder: a multilinguistic token-based code clone detection system for large scale source code. IEEE Trans. Softw. Eng., 28(7):654-670, 2002.
    • (2002) IEEE Trans. Softw. Eng. , vol.28 , Issue.7 , pp. 654-670
    • Kamiya, T.1    Kusumoto, S.2    Inoue, K.3
  • 16
    • 77952160060 scopus 로고    scopus 로고
    • Adding examples into java documents
    • J. Kim, S. Lee, S. won Hwang, and S. Kim. Adding examples into java documents. In ASE, 2009.
    • (2009) ASE
    • Kim, J.1    Lee, S.2    Hwang, S.W.3    Kim, S.4
  • 17
    • 85020616373 scopus 로고    scopus 로고
    • Towards an intelligent code search engine
    • J. Kim, S. Lee, S. won Hwang, and S. Kim. Towards an intelligent code search engine. In AAAI, 2010.
    • (2010) AAAI
    • Kim, J.1    Lee, S.2    Hwang, S.W.3    Kim, S.4
  • 19
    • 0035049111 scopus 로고    scopus 로고
    • On the 'dimensionality curse' and the 'self-similarity blessing'
    • F. Korn, B.-U. Pagel, and C. Faloutsos. On the 'dimensionality curse' and the 'self-similarity blessing'. TKDE, 13(1):96-111, 2001.
    • (2001) TKDE , vol.13 , Issue.1 , pp. 96-111
    • Korn, F.1    Pagel, B.-U.2    Faloutsos, C.3
  • 21
    • 0030696457 scopus 로고    scopus 로고
    • STR: A simple and efficient algorithm for r-tree packing
    • S. T. Leutenegger, J. M. Edgington, and M. A. Lopez. STR: A simple and efficient algorithm for r-tree packing. In ICDE, 1997.
    • (1997) ICDE
    • Leutenegger, S.T.1    Edgington, J.M.2    Lopez, M.A.3
  • 22
    • 84911970654 scopus 로고    scopus 로고
    • Recommending typical usage examples for component retrieval in reuse repositories
    • Y. Li, L. Zhang, G. Li, B. Xie, and J. Sun. Recommending typical usage examples for component retrieval in reuse repositories. In ICSR, 2008.
    • (2008) ICSR
    • Li, Y.1    Zhang, L.2    Li, G.3    Xie, B.4    Sun, J.5
  • 24
    • 34548789572 scopus 로고    scopus 로고
    • Very-large scale code clone analysis and visualization of open source programs using distributed CCFinder: D-CCFinder
    • S. Livieri, Y. Higo, M. Matushita, and K. Inoue. Very-large scale code clone analysis and visualization of open source programs using distributed CCFinder: D-CCFinder. In ICSE, 2007.
    • (2007) ICSE
    • Livieri, S.1    Higo, Y.2    Matushita, M.3    Inoue, K.4
  • 26
    • 64549135034 scopus 로고    scopus 로고
    • Comparison and evaluation of code clone detection techniques and tools: A qualitative approach
    • C. K. Roy, J. R. Cordy, and R. Koschke. Comparison and evaluation of code clone detection techniques and tools: A qualitative approach. Sci. Comput. Program., 74(7):470-495, 2009.
    • (2009) Sci. Comput. Program. , vol.74 , Issue.7 , pp. 470-495
    • Roy, C.K.1    Cordy, J.R.2    Koschke, R.3
  • 27
    • 0032094249 scopus 로고    scopus 로고
    • Optimal multi-step k-nearest neighbor search
    • T. Seidl and H.-P. Kriegel. Optimal multi-step k-nearest neighbor search. In SIGMOD, 1998.
    • (1998) SIGMOD
    • Seidl, T.1    Kriegel, H.-P.2
  • 29
    • 14344258876 scopus 로고    scopus 로고
    • Clone detection in source code by frequent itemset techniques
    • V. Wahler, D. Seipel, J. W. v. Gudenberg, and G. Fischer. Clone detection in source code by frequent itemset techniques. In SCAM, 2004.
    • (2004) SCAM
    • Wahler, V.1    Seipel, D.2    Gudenberg, J.W.V.3    Fischer, G.4
  • 30
    • 78751472619 scopus 로고    scopus 로고
    • Improving software reliability and productivity via mining program source code
    • T. Xie, M. Acharya, S. Thummalapenta, and K. Taneja. Improving software reliability and productivity via mining program source code. In NSFNGS, 2008.
    • (2008) NSFNGS
    • Xie, T.1    Acharya, M.2    Thummalapenta, S.3    Taneja, K.4
  • 31
    • 0008693810 scopus 로고    scopus 로고
    • Fast time sequence indexing for arbitrary lp norms
    • B.-K. Yi and C. Faloutsos. Fast time sequence indexing for arbitrary lp norms. In VLDB, 2000.
    • (2000) VLDB
    • Yi, B.-K.1    Faloutsos, C.2
  • 32
    • 0024889169 scopus 로고
    • Simple fast algorithms for the editing distance between trees and related problems
    • K. Zhang and D. Shasha. Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput., 18(6):1245-1262, 1989.
    • (1989) SIAM J. Comput. , vol.18 , Issue.6 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2


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