The DOI matches its Crossref record.
Using Slicing to Identify Duplication in Source Code
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 18
- 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. · DOI · Paper page
- B. Baker. Parameterized duplication in strings: Algorithms and an application to software maintenance. SIAM Jrnl. on Computing, 26(5):1343–1362, Oct. 1997. · DOI
- H. Barrow and R. Burstall. Subgraph isomorphism, matching relational structures and maximal cliques. Information Processing Letters, 4(4):83–84, Jan. 1976. · doi:10.1016/0020-0190(76)90049-1
- 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. · DOI · Paper page
- 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. · doi:10.1021/ci00010a015
- 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. · doi:10.1145/279310.279312
- 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.
- 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. · DOI
- 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. · DOI · Paper page
- R. Komondoor and S. Horwitz. Semantics-preserving procedure extraction. In Proc. ACM Symp. on Principles of Programming Languages (POPL), pages 155–169, Jan. 2000. · DOI
- 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. · DOI
- 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. · DOI · Paper page
- 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. · DOI · Paper page
- J. McGregor. Backtrack search algorithms and maximal common subgraph problem. Software-Practice and Experience, 12:23–34, 1982. · DOI · Paper page
- 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. · doi:10.1145/800020.808263
- W. Stevens, G. Myers, and L. Constantine. Structured design. IBM Systems Jrnl., 13(2):115–139, 1974. · DOI · Paper page
- 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. · DOI
- M. Weiser. Program slicing. IEEE Trans. on Software Engineering, SE-10(4):352–357, July 1984. · DOI · Paper page
Cited by
DECKARD: Scalable and Accurate Tree-Based Detection of Code Clones
Jiang, L., Misherghi, G., Su, Z., & Glondu, S. (2007) · 29th International Conference on Software Engineering (ICSE'07) · doi:10.1109/icse.2007.30 · Cited by 1,039
GPLAG: detection of software plagiarism by program dependence graph analysis
Liu, C., Chen, C., Han, J., & Yu, P. S. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150522 · Cited by 422
Deep learning similarities from different representations of source code
Tufano, M., Watson, C., Bavota, G., Di Penta, M., White, M., & Poshyvanyk, D. (2018) · Proceedings of the 15th International Conference on Mining Software Repositories · doi:10.1145/3196398.3196431 · Cited by 158
Rahman, F., Bird, C., & Devanbu, P. (2012) · Empirical Software Engineering · doi:10.1007/s10664-011-9195-3 · Cited by 132
A comparison of code similarity analysers
Ragkhitwetsagul, C., Krinke, J., & Clark, D. (2018) · Empirical Software Engineering · doi:10.1007/s10664-017-9564-7 · Cited by 122
Program Logic Based Software Plagiarism Detection
Zhang, F., Wu, D., Liu, P., & Zhu, S. (2014) · 2014 IEEE 25th International Symposium on Software Reliability Engineering · doi:10.1109/issre.2014.18 · Cited by 57
Detecting differences across multiple instances of code clones
Lin, Y., Xing, Z., Xue, Y., Liu, Y., Peng, X., Sun, J., & Zhao, W. (2014) · Proceedings of the 36th International Conference on Software Engineering · doi:10.1145/2568225.2568298 · Cited by 41
Does BLEU Score Work for Code Migration?
Tran, N., Tran, H., Nguyen, S., Nguyen, H., & Nguyen, T. (2019) · 2019 IEEE/ACM 27th International Conference on Program Comprehension (ICPC) · doi:10.1109/icpc.2019.00034 · Cited by 49
Ming, J., Zhang, F., Wu, D., Liu, P., & Zhu, S. (2016) · IEEE Transactions on Reliability · doi:10.1109/tr.2016.2570554 · Cited by 33
Measuring code behavioral similarity for programming and software engineering education
Li, S., Xiao, X., Bassett, B., Xie, T., & Tillmann, N. (2016) · Proceedings of the 38th International Conference on Software Engineering Companion · doi:10.1145/2889160.2889204 · Cited by 30
Metadata
- Authors
- Komondoor, R., & Horwitz, S.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2001
- Pages
- 40-56
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1593203335
- Cited by
- 527
- References
- 0
- FWCI
- 9.75
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
