SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Software: Practice and Experience

Volumn 21, Issue 7, 1991, Pages 739-755

Identifying syntactic differences between two programs

(1) Yang, Wuu a

a UNIVERSITY OF WISCONSIN MADISON (United States)

Author keywords

cdiff; Synchronous pretty printing; Syntax directed comparator

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES - C; MATHEMATICAL PROGRAMMING, DYNAMIC; MATHEMATICAL TECHNIQUES - TREES;

PROGRAM REPRESENTATION; PROGRAM VERSION COMPARISON; SYNCHRONOUS PRETTY PRINTING; SYNTAX DIRECTED PROGRAM COMPARISON; TREE MATCHING;

COMPUTER SOFTWARE;

EID: 0026185673 PISSN: 00380644 EISSN: 1097024X Source Type: Journal
DOI: 10.1002/spe.4380210706 Document Type: Article

Times cited : (255)

References (31)

1
- 0004072686
- Addison‐Wesley, Reading, MA
- (1986) Compilers: Principles, Techniques, and Tools
- Aho, A.V.¹ Sethi, R.² Ullman, J.D.³

2
- 84976800803
- Prettyprinting
- (1980) ACM Transactions on Programming Languages and Systems , vol.2 , Issue.4 , pp. 465-483
- Oppen, D.C.¹

3
- 0020719092
- Syntax‐directed pretty printing—a first step towards a syntax‐directed editor
- (1983) IEEE Trans. Software Engineering , vol.9 SE , Issue.2 , pp. 119-127
- Rubin, L.F.¹

4
- 0003405432
- Prentice‐Hall, Engleood Cliffs, NJ
- (1978) The C Programming Language
- Kernigham, B.W.¹ Ritchie, D.M.²

5
- 0025226377
- Production trees: a compact representation of parsed programs
- (1990) ACM Trans. Programming Languages and Systems , vol.21 , Issue.1 , pp. 61-83
- Waddle, V.E.¹

6
- 0004146756
- Prentice‐Hall, Englewood Cliffs NJ
- (1984) C: A Reference Manual
- Harbison, S.P.¹ Steele, G.L.²

7
- 0015252494
- Matching sequences under deletion/insertion constraints
- (1972) Proc. Nat. Acad Sci USA , vol.69 , Issue.1 , pp. 4-6
- Sankoff, D.¹

8
- 0043170974
- An algorithm for the distance between two finite sequences
- (1974) J. Combinatorial Theory, Series A , vol.16 , pp. 253-258
- Sellers, P.H.¹

9
- 0015960104
- The string‐to‐string correction problem
- (1974) J. ACM , vol.21 , Issue.1 , pp. 168-173
- Wagner, R.A.¹ Fischer, M.J.²

10
- 0016494974
- An extension to the string‐to‐string correction problem
- (1975) J. ACM , vol.22 , Issue.2 , pp. 177-183
- Lowrance, R.¹ Wagner, R.A.²

11
- 84976825385
- Algorithms for the longest common subsequence problem
- 664, 075
- (1977) Journal of the ACM , vol.24 , Issue.4
- Hirschberg, D.S.¹

12
- 0020205756
- A longest common subsequence algorithm suitable for similar text strings
- (1982) Acta Informatica , vol.18 , pp. 171-179
- Nakatsu, N.¹ Kambayashi, Y.² Yajima, S.³

13
- 0022161646
- A file comparison program
- (1985) Software—Practice and Experience , vol.15 , Issue.11 , pp. 1024-1040
- Miller, W.¹ Myers, E.W.²

14
- 0023586274
- The longest common subsequence problem revisited
- (1987) Algorithmica , vol.2 , pp. 315-336
- Apostolico, A.¹ Guerra, C.²

15
- 0024641218
- Speeding up dynamic programming with applications to molecular biology
- (1989) Theoretical Computer Science , vol.64 , pp. 107-118
- Galil, Z.¹ Giancarlo, R.²

16
- 0017959098
- A technique for isolating differences between files
- (1978) Comm. ACM , vol.21 , Issue.4 , pp. 264-268
- Heckel, P.¹

17
- 84976728067
- The string‐to‐string correction problem with block moves
- (1984) ACM Transactions on Computer Systems , vol.2 , Issue.4 , pp. 309-321
- Tichy, W.F.¹

18
- 0016518550
- A linear space algorithm for computing maximal common subsequences
- (1975) Comm. ACM , vol.18 , Issue.6 , pp. 341-343
- Hirschberg, D.S.¹

19
- 0019595849
- Formatted programming languages
- (1981) Software—Practice and Experience , vol.11 , pp. 651-669
- Rose, G.A.¹ Welsh, J.²

20
- 0020705118
- A specification schema for indenting programs
- (1983) Software—Practice and Experience , vol.13 , pp. 163-179
- Mateti, P.¹

21
- 0022752372
- Formatted syntaxes and Modula‐2
- (1986) Software—Practice and Experience , vol.16 , Issue.7 , pp. 605-626
- Woodman, M.¹

22
- 84987224507
- The synthesizer generator. Proceedings of the ACM SIGSOFT/SIG‐PLAN Software Engineering Symposium on Practical Software Development Environments, Pittsburgh, PA, 23‐25 April
- (1984)
- Reps, T.¹ Teitelbaum, T.²

23
- 84987230656
- (1984) ACM SIGPLAN Notices , vol.19 , Issue.5 , pp. 41-48

24
- 0019899359
- Pattern matching in trees
- (1982) J. ACM , vol.29 , Issue.1 , pp. 68-95
- Hoffmann, C.M.¹ O'Donnell, M.J.²

25
- 0024889169
- Simple fast algorithms for the editing distance between trees and related problems
- (1989) SIAM J. Computing , vol.18 , Issue.6 , pp. 1245-1262
- Zhang, K.¹ Shasha, D.²

26
- 0018491659
- The tree‐to‐tree correction problem
- (1979) J. ACM , vol.26 , Issue.3 , pp. 422-433
- Tai, K.¹

27
- 0017953312
- A tree‐to‐tree distance and its application to cluster analysis
- (1979) IEEE Trans. Pattern Analysis and Machine Intelligence , vol.1 PAMI , Issue.2 , pp. 219-224
- Lu, S.¹

28
- 0001122858
- The tree‐to‐tree editing problem
- (1977) Information Processing Letters , vol.6 , Issue.6 , pp. 184-186
- Selkow, S.M.¹

29
- 84987231778
- Identifying the semantic and textual differences between two versions of a program, Proceedings of the SIGPLAN 90 Conference on Programming Language Design and Implementation, White Plain, New York, 20‐22 June, 1990
- Horwitz, S.¹

30
- 0025446340
- (1990) ACM SIGPLAN Notices , vol.25 , Issue.6 , pp. 234-245

31
- 0021196854
- Managing multi‐version programs with an editor
- (1984) IBM J. Res. Develop. , vol.28 , Issue.1 , pp. 74-81
- Kruskal¹

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