메뉴 건너뛰기




Volumn , Issue , 2006, Pages 65-71

Detecting similar Java classes using tree algorithms

Author keywords

change analysis; software evolution; software repositories; tree similarity measures

Indexed keywords

CHANGE ANALYSIS; CODE FRAGMENTS; CODE REUSE; DEVELOPMENT ENVIRONMENT; JAVA CLASS; KNOWLEDGE BASE; MINING SOFTWARE REPOSITORIES; QUERY DOCUMENTS; SIMILARITY ALGORITHM; SIMILARITY ANALYSIS; SIMILARITY MEASURE; SOFTWARE EVOLUTION; SOFTWARE EVOLUTION ANALYSIS; SOFTWARE PROJECT; SOFTWARE REPOSITORIES; SOURCE CODE REPOSITORIES; SOURCE CODES; TEST CASE; TREE ALGORITHMS; TREE-BASED;

EID: 77954003070     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1137983.1138000     Document Type: Conference Paper
Times cited : (61)

References (18)
  • 15
    • 77953985121 scopus 로고    scopus 로고
    • Technical Report LSI-00-72-R, Technical University of Catalonia, Dec.
    • G. Valiente. Simple and Efficient Tree Pattern Matching. Technical Report LSI-00-72-R, Technical University of Catalonia, Dec. 2000.
    • (2000) Simple and Efficient Tree Pattern Matching
    • Valiente, G.1
  • 18
    • 0000307499 scopus 로고
    • On the Editing Distance between Unordered Labeled Trees
    • K. Zhang, R. Statman, and D. Shasha. On The Editing Distance Between Unordered Labeled Trees. Information Processing Letters, 42(3):133-139, 1992.
    • (1992) Information Processing Letters , vol.42 , Issue.3 , pp. 133-139
    • Zhang, K.1    Statman, R.2    Shasha, D.3


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