메뉴 건너뛰기




Volumn , Issue , 2003, Pages 227-236

Differences between Versions of UML Diagrams

Author keywords

Configuration; Design transaction; Differences; Fine grained data model; Software engineering environments; UML diagrams; Versions

Indexed keywords

ABSTRACTING; COMPUTER PROGRAMMING; DATA REDUCTION; DATABASE SYSTEMS; FILE EDITORS; XML;

EID: 1542317057     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/949952.940102     Document Type: Conference Paper
Times cited : (107)

References (25)
  • 2
    • 0010689806 scopus 로고
    • Tree-to-tree correction for document trees
    • Departement of Computing andf Information Science Queen's University Kingston Ontario, Canada, January
    • D. T. Barnard, G. Clarke, and N. Duncan. Tree-to-tree correction for document trees. Technical report, Departement of Computing andf Information Science Queen's University Kingston Ontario, Canada, January 1995.
    • (1995) Technical Report
    • Barnard, D.T.1    Clarke, G.2    Duncan, N.3
  • 6
    • 0032083407 scopus 로고    scopus 로고
    • Version models for software configuration management
    • June
    • R. Conradi and B. Westfechtel. Version models for software configuration management. ACM Computing Surveys, 30(2):232-282, June 1998.
    • (1998) ACM Computing Surveys , vol.30 , Issue.2 , pp. 232-282
    • Conradi, R.1    Westfechtel, B.2
  • 8
    • 0002557551 scopus 로고
    • H-PCTE - A high-performance object management system for system development environments
    • September 23-25. IEEE Press
    • U. Kelter. H-PCTE - a high-performance object management system for system development environments. In Proceedings COMPSAC Illinois, September 23-25, pages 45-50. IEEE Press, 1992.
    • (1992) Proceedings COMPSAC Illinois , pp. 45-50
    • Kelter, U.1
  • 11
  • 13
    • 0023012946 scopus 로고
    • An O (ND) difference algorithm and its variations
    • E. W. Myers. An O (ND) difference algorithm and its variations. Algorithmica, 1:251-256, 1986.
    • (1986) Algorithmica , vol.1 , pp. 251-256
    • Myers, E.W.1
  • 17
    • 0001122858 scopus 로고
    • The tree-to-tree editing problem
    • December
    • S. M. Selkow. The tree-to-tree editing problem. Information Processing Letters, 6(6):184-186, December 1977.
    • (1977) Information Processing Letters , vol.6 , Issue.6 , pp. 184-186
    • Selkow, S.M.1
  • 18
    • 0018491659 scopus 로고
    • The tree-to-tree correction problem
    • July
    • K.-C. Tai. The tree-to-tree correction problem. Journal of the ACM, 26(3):422-433, July 1979.
    • (1979) Journal of the ACM , vol.26 , Issue.3 , pp. 422-433
    • Tai, K.-C.1
  • 19
    • 84976728067 scopus 로고
    • The string-to-string correction problem with block moves
    • Nov.
    • W. F. Tichy. The string-to-string correction problem with block moves. ACM Transactions on Computer Systems, 2(4):309-321, Nov. 1984.
    • (1984) ACM Transactions on Computer Systems , vol.2 , Issue.4 , pp. 309-321
    • Tichy, W.F.1
  • 22
    • 0028546141 scopus 로고
    • How to merge program texts
    • November
    • W. Yang. How to merge program texts. The Journal of Systems and Software, 27(2):129-141, November 1994.
    • (1994) The Journal of Systems and Software , vol.27 , Issue.2 , pp. 129-141
    • Yang, W.1
  • 23
    • 0024889169 scopus 로고
    • Simple fast algorithms for the editing distance between trees and related problems
    • K. Zhang and D. Shasha. Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing, 18:1245-1262, 1989.
    • (1989) SIAM Journal of Computing , vol.18 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2


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