메뉴 건너뛰기




Volumn , Issue , 2004, Pages 188-197

Dex: A semantic-graph differencing tool for studying changes in large code bases

Author keywords

[No Author keywords available]

Indexed keywords

LARGE CODE BASES; SEMANTIC-GRAPH DIFFERENCING TOOL; SOFTWARE DEVELOPERS; SOURCE CODES;

EID: 18044373219     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSM.2004.1357803     Document Type: Conference Paper
Times cited : (91)

References (29)
  • 1
    • 84870646285 scopus 로고    scopus 로고
    • accessed January 2003
    • The Apache Software Foundation. Apache HTTP Server. http://httpd.apache. org (accessed January 2003).
    • Apache HTTP Server
  • 3
    • 0028549756 scopus 로고
    • Software merge: Semantics of combining changes to programs
    • V. Berzins. "Software Merge: Semantics of Combining Changes to Programs." ACM Trans. Programming Languages and Systems, 16(6):1875-1903, 1994
    • (1994) ACM Trans. Programming Languages and Systems , vol.16 , Issue.6 , pp. 1875-1903
    • Berzins, V.1
  • 4
    • 84885634776 scopus 로고
    • Using semantic differencing to reduce the cost of regression testing
    • Orlando, FL, November
    • D. Binkley. Using semantic differencing to reduce the cost of regression testing. 1992 International Conference on Software Maintenance (Orlando, FL, November 1992), 41-52.
    • (1992) 1992 International Conference on Software Maintenance , pp. 41-52
    • Binkley, D.1
  • 10
    • 0347781246 scopus 로고    scopus 로고
    • accessed January 2003
    • Free Software Foundation. GNU Compiler Collection. http://www.gnu.org (accessed January 2003).
    • GNU Compiler Collection
  • 11
    • 84860925238 scopus 로고    scopus 로고
    • Gnu.org. diffutils. http://www.gnu.org/software/diffutils/diffutils.html.
    • Diffutils
  • 16
    • 84896693236 scopus 로고    scopus 로고
    • Computing edit distance between unordered rooted trees
    • th European Symposium on Algorithms (Venice, August Springer Verlag)
    • th European Symposium on Algorithms (Venice, August 1998), Lecture Notes in Computer Science 1461, Springer Verlag, 91-102.
    • (1998) Lecture Notes in Computer Science , vol.1461 , pp. 91-102
    • Klein, P.N.1
  • 19
  • 20
    • 84860923178 scopus 로고    scopus 로고
    • Finding differences in program code through abstract semantic graph comparison
    • S. Raghavan. Finding differences in program code through abstract semantic graph comparison. M.S. project report, available at http://softlab4.cwru.edu/dex/index.html.
    • M.S. Project Report
    • Raghavan, S.1
  • 21
    • 84860922730 scopus 로고    scopus 로고
    • Analysis of common programmer error via semantic differencing
    • R. Rohana. Analysis of common programmer error via semantic differencing. M.S. project report, available at http://softlab4.cwru.edu/dex/index.html.
    • M.S. Project Report
    • Rohana, R.1
  • 22
    • 84860938758 scopus 로고    scopus 로고
    • CPPX. University of Waterloo, (accessed January, 2003)
    • Software Architecture Group (SWAG) (2002). CPPX. University of Waterloo, http://swag.uwaterloo.ca/swagkit (accessed January, 2003).
    • (2002)
  • 23
    • 84860924620 scopus 로고    scopus 로고
    • University of Waterloo, (accessed August, 2002)
    • Software Architecture Group (SWAG) (2001). Original CPPX and Documentation. University of Waterloo, http://swag.uwaterloo.ca/~cppx (accessed August, 2002).
    • (2001) Original CPPX and Documentation
  • 27
    • 0026185673 scopus 로고
    • Identifying syntactic differences between two programs
    • July
    • W. Yang. Identifying syntactic differences between two programs. Software Practice and Experience 21, 7 (July 1991), 739-755.
    • (1991) Software Practice and Experience , vol.21 , Issue.7 , pp. 739-755
    • Yang, W.1
  • 28
    • 0345959841 scopus 로고    scopus 로고
    • Approximate tree pattern matching
    • edited by A. Apostolico and Z. Galil, Oxford University Press
    • K. Zhang and D. Shasha. Approximate tree pattern matching. In: Pattern Matching Algorithms, edited by A. Apostolico and Z. Galil, Oxford University Press, 1997.
    • (1997) Pattern Matching Algorithms
    • Zhang, K.1    Shasha, D.2
  • 29
    • 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 (1992), 133-139.
    • (1992) Information Processing Letters , vol.42 , pp. 133-139
    • Zhang, K.1    Statman, R.2    Shasha, D.3


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