메뉴 건너뛰기




Volumn , Issue , 2011, Pages 452-455

History slicing

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED TECHNIQUES; CODE CHANGES; DESIGN RATIONALE; LINE OF CODES; MINING SOFTWARE; ORDERS OF MAGNITUDE; PROCESS HISTORY; SET OF LINES; SOFTWARE FEATURES; SOFTWARE PROJECT;

EID: 84855447588     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASE.2011.6100097     Document Type: Conference Paper
Times cited : (22)

References (19)
  • 1
    • 84855454384 scopus 로고    scopus 로고
    • Aspectj. http://www.eclipse.org/aspectj/.
    • Aspectj
  • 2
    • 84855456732 scopus 로고    scopus 로고
    • Diffj. http://www.incava.org/projects/java/diffj/.
    • Diffj
  • 3
    • 34247400790 scopus 로고    scopus 로고
    • JDiff: A differencing technique and tool for object-oriented programs
    • DOI 10.1007/s10515-006-0002-0, Special Issue on Selected Papers from the 19th international Automated Software Engineering Conference (ASE-2004).
    • T. Apiwattanapong, A. Orso, and M. Harrold. Jdiff: A differencing technique and tool for object-oriented programs. Automated Software Engineering, 14:3-36, 2007. (Pubitemid 46639272)
    • (2007) Automated Software Engineering , vol.14 , Issue.1 , pp. 3-36
    • Apiwattanapong, T.1    Orso, A.2    Harrold, M.J.3
  • 5
    • 0032083407 scopus 로고    scopus 로고
    • Version Models for Software Configuration Management
    • R. Conradi and B. Westfechtel. Version models for software configuration management. ACM Computing Surveys, 30:232-282, June 1998. (Pubitemid 128485204)
    • (1998) ACM Computing Surveys , vol.30 , Issue.2 , pp. 232-282
    • Conradi, R.1    Westfechtel, B.2
  • 8
    • 0002719797 scopus 로고
    • The hungarian method for the assignment problem
    • H. W. Kuhn. The hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2(1-2):83-97, 1955.
    • (1955) Naval Research Logistics Quarterly , vol.2 , Issue.1-2 , pp. 83-97
    • Kuhn, H.W.1
  • 9
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions and reversals
    • Feb.
    • V. I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady, pages 707-710, Feb. 1966.
    • (1966) Soviet Physics Doklady , pp. 707-710
    • Levenshtein, V.I.1
  • 12
    • 0036564990 scopus 로고    scopus 로고
    • A state-of-the-art survey on software merging
    • DOI 10.1109/TSE.2002.1000449
    • T. Mens. A state-of-the-art survey on software merging. IEEE Transactions on Software Engineering, 28:449-462, 2002. (Pubitemid 34669572)
    • (2002) IEEE Transactions on Software Engineering , vol.28 , Issue.5 , pp. 449-462
    • Mens, T.1
  • 16
    • 0020157396 scopus 로고
    • PROGRAMMERS USE SLICES WHEN DEBUGGING.
    • DOI 10.1145/358557.358577
    • M. Weiser. Programmers use slices when debugging. Communications of the ACM, 25:446-452, July 1982. (Pubitemid 12550162)
    • (1982) Communications of the ACM , vol.25 , Issue.7 , pp. 446-452
    • Weiser, M.1


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