Towards a multi-scale approach for source code approximate match report

Chilowicz, Michel; Duris, Étienne; Roussel, Gilles

doi:10.1145/1808901.1808919

Cited by 3 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Abstract syntax tree representations could allow more sophisticate patterns of pre-processing of the representation for better abstraction and normalization of the code, a topic that has been neglected in this article. We are investigating some new techniques in this way [21,32,23] that could also consider the function call graphs of the projects. for the computed similarity metrics between the original project and the obfuscated versions.…”

Section: Resultsmentioning

confidence: 99%

“…If abstract syntax trees [30,23] are considered, some type 3 to type 4 clones can even be managed (tiny expression rewriting or transposition of independent code). Except for suffix indexation techniques other approaches rely on the meta-tokenization of a string of tokens or a brotherhood of sub-trees.…”

Section: Studying the Factorized Graph Nodes And Its Inferred Metricsmentioning

confidence: 99%

“…For this task we can assume that sequences sharing multiple tiny factors (determined via suffix indexation with a suffix array [23]) should be candidate to a local alignment process.…”

Section: Appendix a Dealing With Local Editsmentioning

confidence: 99%

See 2 more Smart Citations

Viewing functions as token sequences to highlight similarities in source code

Chilowicz

Duris

Roussel

2013

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

The detection of similarities in source code has applications not only in software re-engineering (to eliminate redundancies) but also in software plagiarism detection. This latter can be a challenging problem since more or less extensive edits may have been performed on the original copy: insertion or removal of useless chunks of code, rewriting of expressions, transposition of code, inlining and outlining of functions, etc. In this paper, we propose a new similarity detection technique not only based on token sequence matching but also on the factorization of the function call graphs. The factorization process merges shared chunks (factors) of codes to cope, in particular, with inlining and outlining. The resulting call graph offers a view of the similarities with their nesting relations. It is useful to infer metrics quantifying similarity at a function level.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Studying the Factorized Graph Nodes And Its Inferred Metricsmentioning

confidence: 99%

See 1 more Smart Citation

Viewing functions as token sequences to highlight similarities in source code

Chilowicz

Duris

Roussel

2013

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

show abstract

Clone detection using rolling hashing, suffix trees and dagification: A case study

Thomsen¹,

Henglein²

2012

2012 6th International Workshop on Software Clones (IWSC)

View full text Add to dashboard Cite

Microsoft Dynamics NAV is a widely used enterprise resource planning system for small and medium-sized enterprises that, by design, encourages rapid customization by copy-paste programming. We report the results of analyzing clone detection for NAV using two previously published methods and one new algorithmic method: character-based sliding window sampling using Rabin-Karp hashing (MOSS), line-based sequence matching using suffix trees (CodeDup), and abstractsyntax-tree based graph sharing analysis (XMLClone). The latter is piggybacked on XMLStore, which stores XML trees as directed acyclic graphs (dags) where all isomorphic subtrees are identified and coalesced into single nodes, which can be done in linear time using multiset discrimination. This dagification discovers all well-formed Type-1 and, with suitable input normalization, Type-2 clones. We find that the subsequent dag analysis to discover Type-3 clones performs well on NAV source code, both in terms of computational complexity and precision. This suggests that efficient dagification and independently configurable dag interpretation may be valuable ingredients for modular clone detection.

show abstract

Fourth International Workshop on Software Clones (IWSC)

Inoue

Jarzabek

Cordy

et al. 2010

Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 2

View full text Add to dashboard Cite

Software clones are identical or similar pieces of code. They are often the result of copy-and-paste activities as ad-hoc code reuse by programmers. Software clones research is of high relevance for the industry. Many researchers have reported high rates of code cloning in both industrial and open-source systems.In this workshop we will explore lines of research that evaluate code clone detection methods, reason about ways to remove clones, assess the effect of clones on maintainablity, track clones' evolution, and investigate the root causes of clones.

show abstract

Towards a multi-scale approach for source code approximate match report

Cited by 3 publications

References 12 publications

Viewing functions as token sequences to highlight similarities in source code

Viewing functions as token sequences to highlight similarities in source code

Clone detection using rolling hashing, suffix trees and dagification: A case study

Fourth International Workshop on Software Clones (IWSC)

Contact Info

Product

Resources

About