Using slicing to identify duplication in source code

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2126 LNCS, Issue , 2001, Pages 40-56

  Komondoor, Raghavan ^a   Horwitz, Susan ^a,b  

^a University of Wisconsin Madison   (United States)

^b CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CLONING; CODES (SYMBOLS); COMPUTER PROGRAMMING;

PROGRAM DEPENDENCE GRAPH; PROGRAM SLICING; SOURCE CODES; SUBGRAPHS;

STATIC ANALYSIS;

EID: 84890052317     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47764-0_3     Document Type: Conference Paper

References (19)

1. B. Baker. On finding duplication and near-duplication in large software systems. In Proc. IEEE Working Conf. on Reverse Engineering, pages 86-95, July 1995.
2. B. Baker. Parameterized duplication in strings: Algorithms and an application to software maintenance. SIAM Jrnl. on Computing, 26(5): 1343-1362, Oct. 1997.
3. H. Barrow and R. Burstall. Subgraph isomorphism, matching relational structures and maximal cliques. Information Processing Letters, 4(4): 83-84, Jan. 1976.
4. I. Baxter, A. Yahin, L. Moura, M. Sant'Anna, and L. Bier. Clone detection using abstract syntax trees. In Int. Conf. on Software Maintenance, pages 368-378, 1998.
5. D. Bayada, R. Simpson, A. Johnson, and C. Laurenco. An algorithm for the multiple common subgraph problem. Jrnl. of Chemical Information and Computer Sciences, 32(6): 680-685, Nov.-Dec. 1992.
6. R. Bowdidge and W. Griswold. Supporting the restructuring of data abstractions through manipulation of a program visualization. ACM Trans. on Software Engineering and Methodology, 7(2): 109-157, Apr. 1998.
7. N. Davey, P. Barson, S. Field, R. Frank, and D. Tansley. The development of a software clone detector. Int. Jrnl. of Applied Software Technology, 1(3-4): 219-36, 1995.
8. S. Debray, W. Evans, R. Muth, and B. D. Sutter. Compiler techniques for code compaction. ACM Trans. on Programming Languages and Systems, 22(2): 378-415, Mar. 2000.
9. J. Ferrante, K. Ottenstein, and J. Warren. The program dependence graph and its use in optimization. ACM Trans. on Programming Languages and Systems, 9(3): 319-349, July 1987.
10. http://www.codesurfer.com.
11. R. Komondoor and S. Horwitz. Semantics-preserving procedure extraction. In Proc. ACM Symp. on Principles of Programming Languages (POPL), pages 155-169, Jan. 2000.
12. K. Kontogiannis, R. Demori, E. Merlo, M. Galler, and M. Bernstein. Pattern matching for clone and concept detection. Automated Software Engineering, 3(1-2): 77-108, 1996.
13. B. Lague, D. Proulx, J. Mayrand, E. Merlo, and J. Hudepohl. Assessing the benefits of incorporating function clone detection in a development process. In Int. Conf. on Software Maintenance, pages 314-321, 1997.
14. J. Mayrand, C. Leblanc, and E. Merlo. Experiment on the automatic detection of function clones in a software system using metrics. In Proceedings of the Int. Conf. on Software Maintenance, pages 244-254, 1996.
15. J. McGregor. Backtrack search algorithms and maximal common subgraph problem. Software - Practice and Experience, 12: 23-34, 1982.
16. K. Ottenstein and L. Ottenstein. The program dependence graph in a software development environment. In Proc. ACM SIGSOFT/SIGPLAN Software Engineering Symp. on Practical Software Development Environments, pages 177-184, 1984.
17. W. Stevens, G. Myers, and L. Constantine. Structured design. IBM Systems Jrnl., 13(2): 115-139, 1974.
18. T. Wang and J. Zhou. Emcss: A new method for maximal common substructure search. Jrnl. of Chemical Information and Computer Sciences, 37(5): 828-834, Sept.-Oct. 1997.
19. M. Weiser. Program slicing. IEEE Trans. on Software Engineering, SE-10(4): 352-357, July 1984.