메뉴 건너뛰기




Volumn , Issue , 2012, Pages 233-242

LINSEN: An efficient approach to split identifiers and expand abbreviations

Author keywords

Expansion; Program Comprehension; Source Code Identifiers; Splitting

Indexed keywords

APPROXIMATE STRING MATCHING; CONCEPT LOCATIONS; GRAPH MODEL; LEXICAL INFORMATION; LINEAR TIME; OPEN SOURCE SYSTEM; PROGRAM COMPREHENSION; SOFTWARE MAINTENANCE ACTIVITY; SOURCE CODES; SPLITTING; STRONG ENHANCEMENT; TRACEABILITY LINKS;

EID: 84873153527     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSM.2012.6405277     Document Type: Conference Paper
Times cited : (67)

References (20)
  • 6
    • 33846409962 scopus 로고    scopus 로고
    • Semantic clustering: Identifying topics in source code
    • A. Kuhn, S. Ducasse, and T. Gîrba, "Semantic clustering: Identifying topics in source code," Information & Software Technology, vol. 49, no. 3, pp. 230-243, 2007.
    • (2007) Information & Software Technology , vol.49 , Issue.3 , pp. 230-243
    • Kuhn, A.1    Ducasse, S.2    Gîrba, T.3
  • 17
    • 34748895724 scopus 로고    scopus 로고
    • Source code analysis: A road map
    • Washington, DC, USA: IEEE Computer Society
    • D. Binkley, "Source code analysis: A road map," in 2007 Future of Software Engineering, ser. FOSE '07. Washington, DC, USA: IEEE Computer Society, 2007, pp. 104-119.
    • (2007) 2007 Future of Software Engineering, Ser. FOSE '07 , pp. 104-119
    • Binkley, D.1
  • 19
    • 0016518897 scopus 로고
    • Efficient string matching: An aid to bibliographic search
    • A. V. Aho and M. J. Corasick, "Efficient string matching: An aid to bibliographic search." Communication ACM, vol. 18, no. 6, pp. 333-340, 1975.
    • (1975) Communication ACM , vol.18 , Issue.6 , pp. 333-340
    • Aho, A.V.1    Corasick, M.J.2


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