메뉴 건너뛰기




Volumn , Issue , 2007, Pages 54-63

Feature location and extraction using landmarks and barriers

Author keywords

[No Author keywords available]

Indexed keywords

CODES (STANDARDS); CODES (SYMBOLS); FEATURE EXTRACTION; GRAPH THEORY; MAINTENANCE;

EID: 47349091024     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSM.2007.4362618     Document Type: Conference Paper
Times cited : (18)

References (26)
  • 1
    • 84903520119 scopus 로고
    • Program Understanding and the Concept Assignment Problem
    • Biggerstaff, T., Mitbander, B. and Webster, D. Program Understanding and the Concept Assignment Problem, Communications of the ACM, 37(5), 1994, pp.72-82,.
    • (1994) Communications of the ACM , vol.37 , Issue.5 , pp. 72-82
    • Biggerstaff, T.1    Mitbander, B.2    Webster, D.3
  • 10
    • 33244494424 scopus 로고    scopus 로고
    • Mylar: A degree-of-interest model for IDEs
    • Kersten, M. and Murphy, G. C. Mylar: a degree-of-interest model for IDEs. Proc. AOSD 2005, pp. 159-168.
    • (2005) Proc. AOSD , pp. 159-168
    • Kersten, M.1    Murphy, G.C.2
  • 11
    • 4444306353 scopus 로고    scopus 로고
    • Slicing, Chopping, and Path Conditions with Barriers
    • Krinke, J. Slicing, Chopping, and Path Conditions with Barriers. Software Quality Journal, 12(4), 2004, pp.339-360.
    • (2004) Software Quality Journal , vol.12 , Issue.4 , pp. 339-360
    • Krinke, J.1
  • 15
    • 12244308293 scopus 로고    scopus 로고
    • The JUNG (Java Universal Network/Graph) Framework
    • 03-17, School of Information and Computer Science, University of California
    • O'Madadhain, J., Fisher, D., White, S. and Boey, Y. The JUNG (Java Universal Network/Graph) Framework. Technical Report UCI-ICS 03-17, School of Information and Computer Science, University of California, 2003.
    • (2003) Technical Report UCI-ICS
    • O'Madadhain, J.1    Fisher, D.2    White, S.3    Boey, Y.4


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