Deep learning similarities from different representations of source code
Open accessAbstract
Assessing the similarity between code components plays a pivotal role in a number of Software Engineering (SE) tasks, such as clone detection, impact analysis, refactoring, etc. Code similarity is generally measured by relying on manually defined or hand-crafted features, e.g., by analyzing the overlap among identifiers or comparing the Abstract Syntax Trees of two code components. These features represent a best guess at what SE researchers can utilize to exploit and reliably assess code similarity for a given task. Recent work has shown, when using a stream of identifiers to represent the code, that Deep Learning (DL) can effectively replace manual feature engineering for the task of clone detection. However, source code can be represented at different levels of abstraction: identifiers, Abstract Syntax Trees, Control Flow Graphs, and Bytecode. We conjecture that each code representation can provide a different, yet orthogonal view of the same code fragment, thus, enabling a more reliable detection of similarities in code. In this paper, we demonstrate how SE tasks can benefit from a DL-based approach, which can automatically learn code similarities from different representations.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
0 of 9 cited sources checked · 0 supported · 0 flagged
- Findingown data
The combined model CloneDetector, trained on clone candidates from a single project (hibernate), can be effectively used to detect clones in the remaining nine systems.
“We also show that the combined model CloneDetector, trained on clone candidates belonging to a single project (hibernate), can be effectively used to detect clones in the remaining nine systems.”
Quote in the paperSubstantial claim - Findingown data
Distances computed by the Identifier-based model for clones missed by it were several orders of magnitude higher than a reasonable threshold.
“We found that the distances computed by the Identifier-based model for such clones were several orders of magnitude higher than a reasonable threshold”
Quote in the paperSubstantial claim - Findingown data
AST-based models identify the highest number of Type II clones.
“Identifier-based models detect the highest number of Type I, AST-based models identify the highest number of Type II, Bytecode models identify the highest number of Type III, and CFG models detect the highest number of Type IV.”
Quote in the paperSubstantial claim - Findingreasoning
At class level, false positives for Bytecode and CFG are mainly due to Java Beans.
“Better results are achieved at class-level, where false positives are mainly due to Java Beans”
Quote in the paperNot a substantial claim - Findingown data
The combined model achieves overall better results than stand-alone code representations.
“In fact, we show that the combined model achieves overall better results as compared to stand-alone code representations.”
Quote in the paperSubstantial claim
- Findingown data
Candidates detected only by Bytecode or only by CFG models tend to be false positives.
“From Table 2, we can notice that candidates detected only by Bytecode or only by CFG models (partitions with ID 1 and 2) tend to be false positives.”
Quote in the paperSubstantial claim - Findingown data
Identifier-based models detect the highest number of Type I clones.
“Identifier-based models detect the highest number of Type I, AST-based models identify the highest number of Type II, Bytecode models identify the highest number of Type III, and CFG models detect the highest number of Type IV.”
Quote in the paperSubstantial claim - Findingown data
Identifier-based models achieve the best precision at both method and class level.
“The Identifier-based models achieve the best precision, both when working at method-and class-level.”
Quote in the paperSubstantial claim - Findingown data
The partitions with ID 1 and 2, referring to clone candidates detected only by Bytecode and only by CFG, respectively, are notable exceptions to good precision.
“The notable exceptions are the partitions with ID 1 and 2, referring to clone candidates detected only by the Bytecode and by the CFG representations, respectively.”
Quote in the paperNot a substantial claim - Findingown data
Fleiss' kappa shows moderate/substantial agreement for clone types classification (75% for methods and 57% for classes).
“and a moderate/substantial agreement in terms of clone types classification (75% for methods and 57% for classes).”
Quote in the paperNot a substantial claim - Findingown data
AST-based models provide the best balance between precision and recall.
“AST-based models provide the best balance between precision and recall.”
Quote in the paperSubstantial claim - Findingown data
A reused AST model identifies a similar list of clone candidates as the original model trained on the set projects.
“We evaluate the effectiveness, showing that a reused model identifies a similar list of clone candidates as compared to the original model trained on the set projects.”
Quote in the paperSubstantial claim - Findingown data
Combined models can be automatically assembled to use multiple code representations for software engineering tasks such as clone detection.
“We demonstrate that combined models can be automatically assembled to consider multiple representations for SE tasks (in our example, code clone detection).”
Quote in the paperSubstantial claim - Findingown data
40% of true positives are detected by both AST and Identifier models.
“For example, 40% of the true positives are detected by both the AST and Identifier models.”
Quote in the paperSubstantial claim - Findingown data
Bytecode models identify the highest number of Type III clones.
“Identifier-based models detect the highest number of Type I, AST-based models identify the highest number of Type II, Bytecode models identify the highest number of Type III, and CFG models detect the highest number of Type IV.”
Quote in the paperSubstantial claim - Findingown data
The overlap among candidate sets is no more than 51% at both method and class granularity.
“The relatively small overlap among the candidate sets, at both method and class granularity (no more than 51%)”
Quote in the paperSubstantial claim - Findingown data
AST-based models can identify similar code fragments even when their set of identifiers is significantly different and share almost no lexical tokens.
“These models can identify similar code fragments, even when their set of identifiers (i.e., vocabulary) is significantly different and share almost no lexical tokens.”
Quote in the paperSubstantial claim - Findingown data
Raising the threshold for the Identifier-based model would still not be enough to detect most clones detected by other representations.
“we found that this would still not be enough to detect most of the clones detected by other representations.”
Quote in the paperSubstantial claim - Findingown data
Bytecode and CFG are the representations that detect the most Type IV clones in the dataset.
“Table 3 also shows that Bytecode and CFG are the representations that detect the most Type IV clones in our dataset.”
Quote in the paperSubstantial claim - Findingown data
Fleiss' kappa shows substantial agreement for TP/FP (93% for methods and 65% for classes).
“The Fleiss' kappa shows substantial agreement in terms of TP/FP (93% for methods and 65% for classes)”
Quote in the paperNot a substantial claim - Findingown data
CFG models detect the highest number of Type IV clones.
“Identifier-based models detect the highest number of Type I, AST-based models identify the highest number of Type II, Bytecode models identify the highest number of Type III, and CFG models detect the highest number of Type IV.”
Quote in the paperSubstantial claim - Findingown data
When both Bytecode and CFG models detect clones not detected by AST and Identifier-based models (partition ID 3), they achieve reasonable precision (88% and 73%).
“However, when both Bytecode and CFG models detect clones not detected by the AST and Identifier-based models (partition with ID 3), they achieve reasonable levels of precision (88% and 73%).”
Quote in the paperSubstantial claim - Findingown data
Multi-representation models learned on available software systems can be effectively applied to detect code similarities on previously unseen systems.
“We demonstrate that we can learn multi-representation models on available software systems and then effectively apply these models for detecting code similarities on previously unseen systems.”
Quote in the paperSubstantial claim - Findingnone given
The libraries codec-1.9 and net-3.6 share the same implementation for class Base64, providing encoding/decoding features.
“The libraries codec-1.9 and net-3.6 share the same implementation for the class Base64, providing encoding/decoding features.”
Quote in the paperNot a substantial claim - Findingown data
At method level, 93% of candidates returned by the original model are identified by the reused model.
“Similarly, 93% of the candidates returned by the original model are identified by the reused model.”
Quote in the paperSubstantial claim - Findingown data
The largest group of clones is between the libraries lang3-3.6 and text-1.1.
“The largest group of clones is between the libraries lang3-3.6 and text-1.1.”
Quote in the paperNot a substantial claim - Findingown data
48% of true positive clones identified by the AST model at class level are not identified by the Identifier-based model.
“For example, 48% of the true positive clones identified by the AST model at class level are not identified by the Identifier-based model.”
Quote in the paperSubstantial claim - Findingreasoning
At class level, smaller percentages of overlap are observed.
“At class-level we notice smaller percentages.”
Quote in the paperNot a substantial claim - Findingown data
There are candidates exclusively identified by a single representation.
“From these results, we note that there are candidates exclusively identified by a single representation.”
Quote in the paperSubstantial claim - Findingown data
All computed correlations between representations are statistically significant.
“While all the computed correlations are statistically significant”
Quote in the paperNot a substantial claim - Findingown data
Despite InternalGamma being significantly smaller than Gamma, the tool detected similarity between the two classes.
“Despite InternalGamma being significantly smaller than Gamma, our tool was still able to detect similarity between the two classes.”
Quote in the paperNot a substantial claim - Findingnone given
StringsComparator in text-1.1 appears to be a Type III clone of SequencesComparator in collections4-4.1.
“In particular, the class StringsComparator in text-1.1 appears to be a Type III clone of the class SequencesComparator in collections4-4.1.”
Quote in the paperNot a substantial claim - Findingown data
Combinations with Identifiers+AST+{CFG or Bytecode} obtain results similar to the overall model trained on all representations.
“However, the combinations with Identifiers+AST+{CFG or Bytecode} obtain results similar to the overall model trained on all representations.”
Quote in the paperSubstantial claim - Findingown data
Another group of similar classes was identified between text-1.1 (package diff) and collections4-4.1 (package sequence).
“We also identified another group of similar classes between text-1.1 (package diff) and collections4-4.1 (package sequence).”
Quote in the paperNot a substantial claim - Findingreasoning
Classes MessageDestination and ContextEjb were detected only by the AST representation.
“the classes MessageDestination and ContextEjb were detected only by the AST representation.”
Quote in the paperNot a substantial claim - Findingown data
The list of candidates identified by the reused model and original models tend to be similar.
“Generally, the list of candidates identified by the reused model and the original models tend to be similar.”
Quote in the paperSubstantial claim - Findingown data
For maven-3.0.5, two candidates are identified by the reused model and one by the original model.
“For maven-3.0.5, two candidates are identified by the reused model and only one by the original model.”
Quote in the paperNot a substantial claim - Findingown data
For antlr-3.4, the reused model identifies three candidates while the original model identifies one.
“For example, for antlr-3.4 the reused model identifies three candidates while the original model only identifies one.”
Quote in the paperNot a substantial claim - Findingown data
At method level, 97% of candidates identified by the reused model were also identified by the original model.
“At methodlevel, we can see that 97% of the candidates identified by the reused model were also identified by the original model.”
Quote in the paperSubstantial claim - Findingown data
90% of class-level candidates identified by original models are detected by the reused model.
“Still, 90% of the class-level candidates identified by the original models are detected by the reused model.”
Quote in the paperSubstantial claim - Findingnone given
The libraries math3-3.6.1 and rng-1.0 contain two shared classes: ISAACRandom and Gamma/InternalGamma.
“The libraries math3-3.6.1 and rng-1.0contain two shared classes: ISAACRandom and Gamma/InternalGamma.”
Quote in the paperNot a substantial claim - Findingown data
The duplicated code between lang3-3.6 and text-1.1 involves classes operating on Strings, with 21 shared similar classes identified.
“The duplicated code involves classes operating on Strings, for example: StringMatcher, StrBuilderWriter, StrTokenizer, StrSubstitutor etc., for a total of 21 shared similar classes identified.”
Quote in the paperNot a substantial claim - Findingown data
Single-representation models tend to have worse performance than the combined model trained on all representations.
“We found that single-representation models tend to have worse performance than the combined model, which was trained on all representations.”
Quote in the paperSubstantial claim - Findingown data
False positives were identified in the study, mainly due to small inner classes and enumerators.
“We also identified false positives in this study, mainly due to small inner classes and enumerators.”
Quote in the paperNot a substantial claim- Rests on an assumption: Enumerators tend to have bytecode structures that are highly similar even when their constants differ.
- Findingown data
Several groups of duplicate code were identified across different Apache commons libraries in the dataset.
“We identified several groups of duplicate code across different Apache commons libraries in the dataset.”
Quote in the paperNot a substantial claim - Findingown data
The overall classification performance is lower for class level (~85% F-Measure) than for method level (~96% F-Measure).
“The overall classification performance (i.e., the weighted average of the Clone/Not Clone categories) is also lower for the class-level (∼85% F-Measure for classes, and ∼96% for methods).”
Quote in the paperNot a substantial claim - Findingown data
The category with the lowest precision and recall is Type IV clones for both method and class level.
“As expected, the category with the lowest precision and recall is the Type IV clones for both method and class level”
Quote in the paperNot a substantial claim - Interpretationreasoning
Models trained on representations with a limited or fixed vocabulary are easier to reuse on different projects.
“In particular, models trained on representations with a limited or fixed vocabulary are easier to be reused on different projects.”
Quote in the paperSubstantial claim - Premisecitation
The performance of machine learning based software engineering approaches varies depending on the underlying datasets.
“While there are many successful and widely adopted ML-based approaches that use different code representations to support SE tasks, their performance varies depending on the underlying datasets [56,57].”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [56] 56. Meghan Revelle, Bogdan Dit, and Denys Poshyvanyk. 2010. Using Data Fusion and Web Mining to Support Feature Location in Software. In Proceedings of the 2010 IEEE 18th International Conference on Program Comprehension (ICPC '10). IEEE Computer Society, Washington, DC, USA, 14-23. https://doi.org/10.1109/ ICPC.2010.10 source
- cites [57] 57. Chanchal Kumar Roy and James R. Cordy. 2008. NICAD: Accurate Detection of Near-Miss Intentional Clones Using Flexible Pretty-Printing and Code Nor- malization. In The 16th IEEE International Conference on Program Comprehension, ICPC 2008, Amsterdam, The Netherlands, June 10-13, 2008. 172-181. source
- Interpretationreasoning
Clone candidates with pervasive renaming or obfuscation would be very difficult to detect with the Identifier-based model.
“Clearly, clone candidates where pervasive renaming or obfuscation has been performed, would be very difficult to detect with this model.”
Quote in the paperSubstantial claim - Interpretationreasoning
The high number of Type IV clones detected by Bytecode and CFG is likely due to their high level of abstraction.
“Again, this is likely due to their high level of abstraction in representing the code.”
Quote in the paperNot a substantial claim - Interpretationreasoning
Using bytecode and CFG in a combined model yields acceptable precision.
“The general lesson learned is that the use bytecode and CFG in a combined model yield an acceptable precision.”
Quote in the paperSubstantial claim - Interpretationown data
The four representations are complementary.
“This suggests that the four representations are complementary, and will be addressed further in RQ 2 .”
Quote in the paperSubstantial claim - Interpretationreasoning§ Deep Learning Similarities from Different Representations of Source Code
There is value in every code representation.
“However, we show that there is value in every code representation, and therefore all representations should be considered in order to identify all possible features from the data.”
Quote in the paperSubstantial claim - Interpretationreasoning
The high level of abstraction of Bytecode and CFG appears imprecise for fine granularities such as methods.
“Such a level of abstraction appears to be imprecise for fine granularities such as methods, where the code fragments might have similar structure but, at the same time, perform very different tasks.”
Quote in the paperSubstantial claim - Premisereasoning
The major factor hindering reusability of DL-based models is possible variability in vocabulary for new, unseen projects.
“The major factor that hinders the reusability of such models is the possible variability in the vocabulary for new, unseen projects.”
Quote in the paperSubstantial claim - Premisereasoning
The importance of a specific code representation depends on the software engineering task.
“The importance of a specific code representation is dependent upon the SE task.”
Quote in the paperSubstantial claim - Study design and conductown data
The ability of AST models to identify similar code fragments despite different identifiers has been confirmed by manual investigation.
“This has been confirmed by our manual investigation of the candidates.”
Quote in the paperNot a substantial claim - Interpretationnone given
The paper claims to be the first to demonstrate that deep learning can simultaneously learn from multiple source code representations.
“To the best of our knowledge, our work is the very first attempt to show that it is possible to automatically learn (via DL) simultaneously from different source code representations.”
Quote in the paperNot a substantial claim - Premisecitation
HOPE preserves asymmetric transitivity by implementing the Katz proximity metric.
“HOPE preserves asymmetric transitivity by implementing the highly correlated metric known as the Katz proximity.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [55] 55. Annibale Panichella, Bogdan Dit, Rocco Oliveto, Massimiliano Di Penta, Denys Poshyvanyk, and Andrea De Lucia. 2016. Parameterizing and Assembling IR- Based Solutions for SE Tasks Using Genetic Algorithms. In IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering, SANER 2016, Suita, Osaka, Japan, March 14-18, 2016 -Volume 1. 314-325. https://doi.org/10.1109/ SANER.2016.97 source
- Interpretationown data
The identifiers-based model fails to detect a significant percentage of clones.
“However its estimated recall is respectively 52% and 40%, meaning that the model fails to detect a significant percentage of clones.”
Quote in the paperSubstantial claim - Interpretationreasoning
The smaller class-level percentages are mostly due to fewer clones being identified at class level.
“This is mostly due to the fact that fewer clones are identified at the class-level.”
Quote in the paperNot a substantial claim - Interpretationown data
Combined models can be reused on different systems.
“We also show that combined models can be reused on different systems.”
Quote in the paperSubstantial claim - Interpretationown data
The representations are orthogonal and complementary to each other.
“We evaluated the performance of each representation for detecting code clones and show that such representations are orthogonal and complementary to each other.”
Quote in the paperSubstantial claim - Interpretationreasoning
Combined models relying on multiple representations can be effective in code clone detection and classification.
“Moreover, combined models relying on multiple representations can be effective in code clone detection and classification.”
Quote in the paperSubstantial claim - Interpretationown data
Code similarities can be learned from diverse representations of code such as Identifiers, ASTs, CFGs, and bytecode.
“In this paper, we show that code similarities can be learned from diverse representations of the code, such as Identifiers, ASTs, CFGs and bytecode.”
Quote in the paperSubstantial claim - Interpretationnone given
Bytecode and CFG representations can be used for library provenance and code maintainability.
“Additionally, we show that Bytecode and CFG representations can be used for library provenance and code maintainability.”
Quote in the paperNot a substantial claim - Study design and conductown data
The CloneDetector model was trained only on hibernate data and tested on all instances of the remaining projects.
“The CloneDetector model has been trained only on the data available for one project (hibernate) and tested on all the instances of the remaining projects.”
Quote in the paperSubstantial claim - Interpretationown data
The model is reusable, avoiding retraining the DL approach to be project-specific.
“We also show that our model is reusable, therefore, avoiding to retrain the DL approach so that it is project specific.”
Quote in the paperSubstantial claim - Interpretationreasoning
The approach highlights benefits of combinations of code representations, not only single representations.
“Our approach inherently highlights the benefits of not only single code representations, but the combinations of these representations.”
Quote in the paperSubstantial claim
- May combine two claims. 30
- Classified as probably not a substantial claim. 44
- Borderline: one of the tests for a substantial claim is unclear. 1
- The quote only partly states this claim. 1
May combine two claims.
Findingown dataMost candidate clone partitions exhibit good precision, with peaks of 100%.
“Table 2 shows that most of the partitions exhibit a good precision, with peaks of 100%.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataThe identifiers-based model has estimated recall of 52% at method level and 40% at class level.
“However its estimated recall is respectively 52% and 40%, meaning that the model fails to detect a significant percentage of clones.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataClones missed by the Identifier-based model share a small percentage of identifiers, making them hard to detect with that representation.
“a close inspection at the vocabulary of the candidates showed that they share a small percentage of identifiers, which in turn, makes them hard to detect with such a representation.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataThe proposed models can effectively compute code similarities both within a single project and among different software projects.
“We also demonstrate that the proposed models can be effectively used to compute similarities, not only in the context of a single project, but also to analyze code similarities among different (diverse) software projects (e.g., detecting clones or libraries across multiple projects).”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataThe precision for partitions ID 1 and 2 is 5% and 9% at method level and 49% and 58% at class level.
“The precision for such partitions is 5% and 9% at method-level and 49% and 58% at class-level.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Findingnone givenDevelopers took needed functionalities from Gamma, stripped unnecessary code, and built InternalGamma.
“The developers only took the needed functionalities out of the Gamma class, stripped it of unnecessary code, and built InternalGamma.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataAt class level, the CloneClassifier's overall F-measure was 68%, with average precision 67% and recall 68%.
“At class level, the CloneClassifier has overall F-Measure of 68%, with average precision of 67% and recall of 68%.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Findingnone givenThe classes mentioned in the study refer to actual Java duplicated code, not imported libraries; the source files are in both libraries.
“Note that the classes mentioned in this study do not refer to imported libraries but to actual Java duplicated code, i.e., the source code files are in both libraries.”
Quote in the paperNot a substantial claimMay combine two claims.
FindingreasoningMessageDestination and ContextEjb share only a few identifiers and differ in some if-structures, making them more difficult to detect by CFG and Bytecode.
“These classes share only a few identifiers (therefore not detected by the Identifier model) and differ in some if-structures, making them more difficult to detect by CFG and Bytecode representations.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataThe CloneDetector achieves 90% precision and 93% recall at class level, and 98% precision and 97% recall at method level.
“When identifying clone instances, the model achieves 90% precision and 93% recall at class, and 98% precision 97% recall at method level.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Findingown dataBoth classes implement a method that sets a seed.
“As an example, both classes implement a method which sets a seed.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataThe classes ISAACRandom and Gamma/InternalGamma share many similarities across math3-3.6.1 and rng-1.0 but differ at statement and structural level.
“The classes share many similarities across the two libraries, however, they differ on a statement and structural level.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Findingown dataIn one class, the seed is set by an integer argument; in the other, it is set using a combination of current time and system hash code.
“In one class, the seed is set by an integer passed through an argument, while the other class sets the seed by using a combination of the current time and system hash code of the instance.”
Quote in the paperNot a substantial claimBorderline on S1 (asserted), S3 (load-bearing), S4 (based): unclear from the text.
Findingnone givenThe strongest correlation observed is between AST and CFG, at 0.157.
“the”
Quote in the paperNot a substantial claimMay combine two claims.
FindingreasoningGamma and InternalGamma are clones because parts of Gamma were used to develop InternalGamma.
“Gamma and InternalGamma, named respectively to the library they belong to, are clones since parts of the Gamma class were used to develop InternalGamma.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
FindingreasoningEditScript and ReplacementsFinder classes are an example of a Type II clone within text-1.1 and collections4-4.1.
“An example of Type II clone within these two libraries is instead the pair EditScript and ReplacementsFinder classes.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Findingown dataThese clones are classified as Type II because only package information changed.
“These clones are classified as Type II, since only package information has been changed.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataAt method level, the CloneClassifier's overall F-measure was 84%, and its average precision and recall were also 84% across categories.
“At method level, the model obtains an overall F-Measure of 84%, with an average precision and recall of 84% across the different categories”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
FindingreasoningMany methods in Gamma either do not appear or are significantly smaller in InternalGamma.
“Therefore, many of the methods in Gamma either do not appear or are significantly smaller in InternalGamma.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingnone givenMessageDestination and ContextEjb both extend ResourceBase and offer the same features.
“They both extend ResourceBase and offer the same features.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingnone givenSingle-representation models obtain significantly worse results in the classification task, with a bigger gap compared to the CloneDetector.
“Single-representation models obtain significantly worse results in the classification task (with a bigger gap with respect to what observed for the CloneDetector).”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataOther clone types achieve precision of at least 74% and recall of at least 75%.
“while other clone types achieve a precision ≥ 74% and a recall ≥ 75%.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataThe CloneDetector achieved 98% precision and 92% recall at method level and 99% precision and 95% recall at class level.
“It achieved 98% precision and 92% recall at method-level and 99% precision and 95% recall at class-level.”
Quote in the paperSubstantial claimClassified as probably not a substantial claim.
Premisenone givenA language model and recursive autoencoder trained on a given vocabulary would not provide adequate results on a vocabulary with unseen terms.
“For example, a language model and a recursive autoencoder trained on a given vocabulary would not be able to provide adequate results on a vocabulary containing terms not previously seen during the training phase.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S4 (based).
PremisereasoningLearning transformations of data drastically reduces the cost of modeling code.
“Firstly, learning transformations of the data drastically reduces the cost of modeling code, since software (and various code representations) store a lot of data to improve the effectiveness of learning.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductnone givenThe data presented in the results section is based on the agreement of three evaluators.
“The data presented in this section is based on the agreement of three evaluators.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S2 (checkable).
Premisenone givenBytecode and CFG representations have a very high degree of abstraction.
“Bytecode and CFG representations have a very high degree of abstraction.”
Quote in the paperNot a substantial claimMay combine two claims.
InterpretationreasoningJava Beans are false positives in terms of code clones but represent successful classification in terms of learning structural and low-level similarities.
“While these classes are false positives in terms of code clones, they still represent a successful classification in terms of learning structural and low-level similarities from the code.”
Quote in the paperSubstantial claimClassified as probably not a substantial claim.
Study design and conductown dataFor RQ4, the authors verified whether identified classes were imported by downloading source code and analyzing Maven .pom files.
“we downloaded the j's source code and analyzed the building files (weaver-1.3relies on Maven, thus we investigated the .pomfiles) to check whether the library x is imported as a dependency in j.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S4 (based).
Premisenone givenCode similarity is generally measured using manually defined or hand-crafted features.
“Code similarity is generally measured by relying on manually defined or hand-crafted features, e.g., by analyzing the overlap among identifiers or comparing the Abstract Syntax Trees of two code components.”
Quote in the paperNot a substantial claimMay combine two claims.
PremisecitationHOPE embeds directed graphs, which is needed for control flow graphs.
“differently from other techniques (e.g., SDNE), HOPE embeds directed graphs (as needed in the case of Control Flow Graphs).”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [55] 55. Annibale Panichella, Bogdan Dit, Rocco Oliveto, Massimiliano Di Penta, Denys Poshyvanyk, and Andrea De Lucia. 2016. Parameterizing and Assembling IR- Based Solutions for SE Tasks Using Genetic Algorithms. In IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering, SANER 2016, Suita, Osaka, Japan, March 14-18, 2016 -Volume 1. 314-325. https://doi.org/10.1109/ SANER.2016.97 source
Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).
Interpretationnone givenClone pairs with very high AST similarity but low identifier similarity are likely Type-II clones.
“For example, clone pairs with very high AST similarity, but low identifiers similarity are likely to be Type-II clones (possibly parameterized clones, where all the identifiers have been systematically renamed).”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductcitationFleiss' kappa was computed to statistically assess evaluators' agreement.
“In order to statistically assess the evaluators' agreement, we compute the Fleiss' kappa [24].”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [24] 24. M. Gabel, L. Jiang, and Z. Su. [n. d.]. Scalable Detection of Semantic Clones (ICSE'08).
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
May combine two claims.
Study design and conductreasoningUsing the Qualitas.classCorpus dataset avoids potential compilation problems or inconsistencies and ensures reproducibility.
“This (i) avoids any potential problem/inconsistency in compiling projects, and (ii) ensures reproducibility.”
Quote in the paperSubstantial claimMay combine two claims.
InterpretationreasoningSimilarities from different code representations can be useful not only to detect clones, but also to classify them into types.
“Similarities from different code representations can be useful not only to detect clones, but also to classify them into types.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Premisenone givenIf bytecode is available, CFGs can be extracted as well.
“Indeed, if bytecode is available (compiled code) CFGs can be extracted as well.”
Quote in the paperNot a substantial claimMay combine two claims.
Premisenone givenAST and Bytecode representations both have a fixed vocabulary, limited by the number of AST node types and bytecode opcodes, respectively.
“In our study, AST and Bytecode representations both have a fixed vocabulary, limited respectively by the number of different AST node types and bytecode opcodes.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S4 (based).
Interpretationnone givenNo other learning-based method is known to use representations beyond identifiers and comments.
“However, we are not aware of any other learning-based approach that operates on code representations other than identifiers and comments.”
Quote in the paperNot a substantial claimClassified as probably not a substantial claim.
Study design and conductreasoningThe candidate clone sample was drawn with 95% confidence level and ±15% confidence interval.
“we randomly draw a statistically significant sample with 95% confidence level and ±15% confidence interval.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductown dataThe two combined models were trained using Random Forest with 10-fold cross-validation.
“To train the two models we rely on Random Forest employing the commonly used 10-fold cross-validation technique to partition training and test sets.”
Quote in the paperNot a substantial claimClassified as probably not a substantial claim.
Study design and conductreasoningUsing the same thresholds across representations facilitates comparison among the four representations.
“While, ideally, these thresholds should be tuned for each project and representation, we chose the same thresholds to facilitate the comparison among the four representations.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
PremisecitationRandom Forest is an effective ensemble learning method for classification, relying on decision tree learning and bagging.
“Random Forest is one of the most effective ensemble learning method for classification, which relies on decision tree learning and bagging [17].”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [17] 17. Bogdan Dit, Latifa Guerrouj, Denys Poshyvanyk, and Giuliano Antoniol. 2011. Can Better Identifier Splitting Techniques Help Feature Location?. In Proceedings of the 2011 IEEE 19th International Conference on Program Comprehension (ICPC '11). IEEE Computer Society, Washington, DC, USA, 11-20. https://doi.org/10. 1109/ICPC.2011.47 source
Probably not a substantial claim: may not pass S2 (checkable).
Interpretationnone givenThe paper's results should be useful for any software engineering task that relies on analyzing code similarities.
“We argue that our results should be useful for any SE task that relies on analyzing code similarities.”
Quote in the paperNot a substantial claimClassified as probably not a substantial claim.
PremisecitationDeep learning can effectively replace manual feature engineering for clone detection when code is represented as a stream of identifiers.
“Recent work has shown, when using a stream of identifiers to represent the code, that Deep Learning (DL) can effectively replace manual feature engineering for the task of clone detection.”
- Also stated in: § 1 INTRODUCTION · plain
“one recent example by White et al. [74] shows that DL can effectively replace manual feature engineering for the task of clone detection.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites White et al. [74]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Also stated in: § 1 INTRODUCTION · plain
Probably not a substantial claim: may not pass S4 (based).
Premisenone givenLearning algorithms typically outperform humans at finding correlations in high-dimensional spaces.
“Secondly, performance is increased because generally, learning algorithms are more efficient than humans at discovering correlations in high dimensional spaces.”
Quote in the paperNot a substantial claimClassified as probably not a substantial claim.
Study design and conductnone givenThree authors independently evaluated the clone candidate samples.
“Three authors independently evaluated the clone candidate samples.”
Quote in the paperSubstantial claimClassified as probably not a substantial claim. May combine two claims.
Study design and conductnone givenThe final dataset was obtained by two-judges agreement, with a candidate marked true positive if at least two of three evaluators classified it as such.
“we computed the two-judges agreement to obtain the final dataset (e.g., a candidate clone was marked as a true positive if at least two of the three evaluators classified it as such).”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Interpretationown dataThe lower performance at class level could be due to the smaller dataset available (483 methods vs 362 classes).
“The lower performance at class-level could be due to the smaller dataset available (i.e., 483 methods vs 362 classes).”
Quote in the paperNot a substantial claimThe quote only partly states this claim.
Interpretationown dataThe small overlap among candidate sets suggests that the representations complement each other.
“suggests that these representations complement each other.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductnone givenThe number of instances and percentages for exclusive candidates are computed only on the manually validated sample.
“Note that the number of instances and percentages are computed only on the manually validated sample.”
Quote in the paperNot a substantial claimMay combine two claims.
Interpretationown dataThe low correlation values suggest that distances computed with different representations do not correlate and provide different perspectives about code pair similarity.
“their low value suggest that distances computed with different representations do not correlate and provide different perspectives about the similarity of code pairs.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S2 (checkable).
InterpretationreasoningThis allows SE researchers to make a more targeted choice of code representation when applying representation-DL algorithms to SE tasks.
“This allows for a more targeted choice by SE researchers of a code representation when applying representation-DL algorithms to a SE tasks.”
Quote in the paperNot a substantial claimClassified as probably not a substantial claim.
Study design and conductreasoningThe approach was not compared against code clone detection techniques because the focus is on a general technique rather than building a code clone detector tool.
“We do not compare our approach against code clone detection techniques since the focus of this paper is to show a general technique on how to learn similarities from multiple code representations, rather than building a code clone detector tool.”
Quote in the paperSubstantial claimClassified as probably not a substantial claim. May combine two claims.
Study design and conductreasoningTo mitigate the external validity threat, the approach was applied in different contexts and two datasets, Projects and Libraries, were used.
“To mitigate this threat, we applied our approach in different contexts and used two different datasets; Projects and Libraries.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Study design and conductnone givenAll Libraries, including Apache commons libraries, are publicly available, ensuring replicability.
“All the Libraries, including all the Apache commons libraries, are publicly available, ensuring the replicability of the study.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductnone givenAll results are available in the online appendix.
“All the results are available in our online appendix.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S2 (checkable), S3 (load-bearing).
InterpretationreasoningThese findings speak to the vast amount of SE tasks that benefit from analyzing multiple representations of code.
“These findings speak to the vast amount of SE tasks which benefit from analyzing multiple representations of the code.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S2 (checkable).
InterpretationreasoningThis work emphasizes attributes that different code representations can accentuate.
“This work also emphasizes the attributes that different code representations can accentuate.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductcitationAll evaluations are publicly available.
“Also, all our evaluations are publicly available [2].”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [2] 2. M. Allamanis, E. Barr, C. Bird, and C. Sutton. [n. d.]. Suggesting Accurate Method and Class Names (FSE'15).
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Probably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductown dataTwo-judge agreement was computed on the evaluated candidates.
“Then, we computed two-judge agreement on the evaluated candidates.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Interpretationnone givenThe results using the selected datasets might not generalize to other projects.
“The results obtained in our study using the selected datasets might not generalize to other projects.”
Quote in the paperNot a substantial claimMay combine two claims.
InterpretationreasoningRepresentation extraction steps are implemented for Java, but all subsequent steps are language-agnostic because they rely on a corpus of sentences with arbitrary tokens.
“While the representation extraction steps are implemented for Java, all the subsequent steps are completely language-agnostic because they rely on a corpus of sentences with arbitrary tokens.”
Quote in the paperSubstantial claim- Rests on an assumption: Recursive Autoencoders have previously been applied in multiple domains and with various input types, including natural language, source code, and images.
Probably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductreasoningOther clone-focused datasets such as BigCloneBench were not used because extracting CFG and Bytecode required compiled code.
“We did not utilize other clone-focused datasets (e.g., such as BigCloneBench [66]) since in order to extract some representations (i.e., CFG and Bytecode) we needed compiled code.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [66] 66. Ricardo Terra, Luis Fernando Miranda, Marco Tulio Valente, and Roberto S. Bigonha. 2013. Qualitas.class Corpus: A Compiled Version of the Qualitas Corpus. Software Engineering Notes 38, 5 (2013), 1-4. source
Classified as probably not a substantial claim.
Study design and conductown dataThe complementarity claim is supported by complementarity metrics and a correlation test.
“We support this claim by performing different analyses: (i) complementarity metrics; and (ii) correlation test.”
Quote in the paperSubstantial claimClassified as probably not a substantial claim.
Study design and conductnone givenThree evaluators independently checked the candidates.
“To mitigate such threat, we employed three evaluators who independently checked the candidates.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductnone givenFor Projects, a subset of the Qualitas.class corpus, diverse systems in size and domain were selected, focusing on popular ones.
“For Projects, which is a subset of systems from the Qualitas.classcorpus, we selected diverse systems in terms of size and domain, focusing on popular ones.”
Quote in the paperNot a substantial claimMay combine two claims.
InterpretationreasoningReusability eliminates a large timesink native to DL approaches and broadens applicability.
“This eliminates a large timesink, native to DL approaches, and broadens the applicability of our approach.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductnone givenThe approach was instantiated in different use case scenarios and datasets.
“We instantiated our approach in different use case scenarios and datasets.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductreasoningThe approach was applied only to Java code.
“Another threat in this category is related to the fact that we apply our approach on Java code only.”
Quote in the paperNot a substantial claim
The paper relies on this without support.
Deep learning models require a long time to train.
“One of the drawbacks of DL-based models is their long training time.”
The paper relies on this without support.
Enumerators tend to have bytecode structures that are highly similar even when their constants differ.
“Enumerators have a very similar bytecode structure even if containing different constants.”
The paper relies on this without support.
Recursive Autoencoders have previously been applied in multiple domains and with various input types, including natural language, source code, and images.
“As a matter of fact, Recursive Autoencoders have been used in several contexts with different inputs such as natural language, source code, images.”
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Class-level Type III results contradict the stated minimums
MinorThe text says every clone type other than Type IV has precision of at least 74% and recall of at least 75%. The table gives class-level Type III clones 61% precision and 59% recall.
“while other clone types achieve a precision ≥ 74% and a recall ≥ 75%.”
“| Type III | 74 | 75 | 75 | 61 | 59 | 60 |”
Clone-detection citation identifies the wrong author
MinorThe text attributes the clone-detection work to White et al. at reference 74, but reference 74 is an entry by Zhou on ensemble learning.
“one recent example by White et al. [74] shows that DL can effectively replace manual feature engineering for the task of clone detection.”
“74. Zhi-Hua Zhou. 2009. Ensemble Learning. Springer US, Boston, MA, 270-273. https://doi.org/10.1007/978-0-387-73003-5_293”
Class-level Type III results fall below the claimed minimums
MinorThe paper says every clone type other than Type IV reaches at least 74% precision and 75% recall. Table 7 reports only 61% precision and 59% recall for class-level Type III clones.
“other clone types achieve a precision ≥ 74% and a recall ≥ 75%.”
“| Type III | 74 | 75 | 75 | 61 | 59 | 60 |”
Data-release citation points to a different work
MinorThe citation attached to the data-release claim points to a reference about suggesting method and class names, not to the paper's released data.
“We release all the data used in our studies [2].”
“2. M. Allamanis, E. Barr, C. Bird, and C. Sutton. [n. d.]. Suggesting Accurate Method and Class Names (FSE'15).”
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538 · see citing works
Representation Learning: A Review and New Perspectives
Bengio, Y., Courville, A., & Vincent, P. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.50 · Cited by 13,001 · see citing works
Measuring nominal scale agreement among many raters.
Fleiss, J. L. (1971) · Psychological Bulletin · doi:10.1037/h0031619 · Cited by 8,733 · see citing works
Recursive Deep Models for Semantic Compositionality Over a Sentiment Treebank
Socher, R., Perelygin, A., Wu, J., Chuang, J., Manning, C. D., Ng, A., & Potts, C. (2013) · Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d13-1170 · Cited by 6,878 · see citing works
Convolutional networks and applications in vision
LeCun, Y., Kavukcuoglu, K., & Farabet, C. (2010) · Proceedings of 2010 IEEE International Symposium on Circuits and Systems · doi:10.1109/iscas.2010.5537907 · Cited by 2,213 · see citing works
Graph embedding techniques, applications, and performance: A survey
Goyal, P., & Ferrara, E. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.03.022 · Cited by 1,801 · see citing works
CCFinder: a multilinguistic token-based code clone detection system for large scale source code
Kamiya, T., Kusumoto, S., & Inoue, K. (2002) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2002.1019480 · Cited by 1,715 · see citing works
Asymmetric Transitivity Preserving Graph Embedding
Ou, M., Cui, P., Pei, J., Zhang, Z., & Zhu, W. (2016) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2939672.2939751 · Cited by 1,298 · see citing works
Clone detection using abstract syntax trees
Baxter, I. D., Yahin, A., Moura, L., Sant'Anna, M., & Bier, L. (2002) · Proceedings. International Conference on Software Maintenance (Cat. No. 98CB36272) · doi:10.1109/icsm.1998.738528 · Cited by 1,277 · see citing works
(2011) · Cited by 1,192 · see citing works
Semi-Supervised Recursive Autoencoders for Predicting Sentiment Distributions
Socher, R., Pennington, J., Huang, E., Ng, A. Y., & Manning, C. D. (2011) · Cited by 1,181 · see citing works
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 · see citing works
On finding duplication and near-duplication in large software systems
Baker, B. S. (2002) · Working Conference on Reverse Engineering (WCRE) · doi:10.1109/wcre.1995.514697 · Cited by 722 · see citing works
Automatically learning semantic features for defect prediction
Wang, S., Liu, T., & Tan, L. (2016) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1145/2884781.2884804 · Cited by 720 · see citing works
Convolutional Neural Networks over Tree Structures for Programming Language Processing
Mou, L., Li, G., Zhang, L., Wang, T., & Jin, Z. G. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10139 · Cited by 705 · see citing works
A language independent approach for detecting duplicated code
Ducasse, S., Rieger, M., & Demeyer, S. (1999) · IEEE International Conference on Software Maintenance (ICSM) · doi:10.1109/icsm.1999.792593 · Cited by 629 · see citing works
Identifying similar code with program dependence graphs
Krinke, J. (2002) · Working Conference on Reverse Engineering (WCRE) · doi:10.1109/wcre.2001.957835 · Cited by 623 · see citing works
Deep learning code fragments for code clone detection
White, M., Tufano, M., Vendome, C., & Poshyvanyk, D. (2016) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1145/2970276.2970326 · Cited by 613 · see citing works
Self-citationCP-Miner: finding copy-paste and related bugs in large-scale software code
Li, Z., Lu, S., Myagmar, S., & Zhou, Y. (2006) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2006.28 · Cited by 612 · see citing works
Feature location in source code: a taxonomy and survey
Dit, B., Revelle, M., Gethers, M., & Poshyvanyk, D. (2011) · Journal of Software Evolution and Process · doi:10.1002/smr.567 · Cited by 588 · see citing works
Self-citationLearning task-dependent distributed representations by backpropagation through structure
Goller, C., & Kuchler, A. (2002) · Proceedings of International Conference on Neural Networks (ICNN'96) · doi:10.1109/icnn.1996.548916 · Cited by 581 · see citing works
Using Slicing to Identify Duplication in Source Code
Komondoor, R., & Horwitz, S. (2001) · Lecture notes in computer science · doi:10.1007/3-540-47764-0_3 · Cited by 537 · see citing works
Roy, C. K., & Cordy, J. R. (2008) · 2008 16th IEEE International Conference on Program Comprehension · doi:10.1109/icpc.2008.41 · Cited by 533 · see citing works
Gu, X., Zhang, H., Zhang, D., & Kim, S. (2016) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/2950290.2950334 · Cited by 485 · see citing works
Proceedings of the 36th International Conference on Software Engineering
(2014) · doi:10.1145/2568225 · Cited by 477 · see citing works
Sajnani, H., Saini, V., Svajlenko, J., Roy, C. K., & Lopes, C. V. (2016) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1145/2884781.2884877 · Cited by 447 · see citing works
A Convolutional Attention Network for Extreme Summarization of Source CodePreprint
Allamanis, M., Peng, H. M., & Sutton, C. A. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.03001 · Cited by 436 · see citing works
DeepFix: Fixing Common C Language Errors by Deep Learning
Gupta, R., Pal, S., Kanade, A., & Shevade, S. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10742 · Cited by 426 · see citing works
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 · see citing works
Suggesting accurate method and class names
Allamanis, M., Barr, E. T., Bird, C., & Sutton, C. A. (2015) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/2786805.2786849 · Cited by 379 · see citing works
Zhou, Z. (2009) · Encyclopedia of Biometrics · doi:10.1007/978-0-387-73003-5_293 · Cited by 361 · see citing works
Identifying syntactic differences between two programs
Yang, W. (1991) · Software Practice and Experience · doi:10.1002/spe.4380210706 · Cited by 346 · see citing works
Scalable detection of semantic clones
Gabel, M., Jiang, L., & Su, Z. (2008) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1145/1368088.1368132 · Cited by 335 · see citing works
Clone Detection Using Abstract Syntax Suffix Trees
Koschke, R., Falke, R., & Frenzel, P. (2006) · Working Conference on Reverse Engineering (WCRE) · doi:10.1109/wcre.2006.18 · Cited by 323 · see citing works
SourcererCC: Scaling Code Clone Detection to Big CodePreprint
Sajnani, H., Saini, V., Svajlenko, J., Roy, C. K., & Lopes, C. V. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1512.06448 · Cited by 306 · see citing works
Wei, H.-H., & Li, M. (2017) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/423 · Cited by 296 · see citing works
Graph-based mining of multiple object usage patterns
Nguyen, T. T., Nguyen, H. A., Pham, N. H., Al-Kofahi, J. M., & Nguyen, T. N. (2009) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/1595696.1595767 · Cited by 293 · see citing works
Are deep neural networks the best choice for modeling source code?
Hellendoorn, V. J., & Devanbu, P. (2017) · Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering · doi:10.1145/3106237.3106290 · Cited by 292 · see citing works
Achieving accuracy and scalability simultaneously in detecting application clones on Android markets
Chen, K., Liu, P., & Zhang, Y. (2014) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1145/2568225.2568286 · Cited by 290 · see citing works
Convolutional Neural Networks over Tree Structures for Programming Language ProcessingPreprint
Mou, L., Li, G., Zhang, L., et al. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1409.5718 · Cited by 285 · see citing works
Identification of high-level concept clones in source code
(2005) · doi:10.1109/ase.2001.989796 · Cited by 259 · see citing works
Identifying redundancy in source code using fingerprints
(1993) · Cited by 245 · see citing works
Panichella, A., Dit, B., Oliveto, R., Penta, M. D., Poshynanyk, D., & Lucia, A. D. (2013) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1109/icse.2013.6606598 · Cited by 243 · see citing works
The plastic surgery hypothesis
Barr, E. T., Brun, Y., Dévanbu, P., Harman, M., & Sarro, F. (2014) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/2635868.2635898 · Cited by 217 · see citing works
Panichella, A., Dit, B., Oliveto, R., Penta, M. D., Poshynanyk, D., & Lucia, A. D. (2013) · Cited by 212 · see citing works
Self-citationBug Localization with Combination of Deep Learning and Information Retrieval
Lam, A. N., Nguyen, A. T., Nguyen, H. A., & Nguyen, T. N. (2017) · IEEE International Conference on Program Comprehension (ICPC) · doi:10.1109/icpc.2017.24 · Cited by 201 · see citing works
Substring matching for clone detection and change tracking
(1994) · doi:10.1109/icsm.1994.336783 · Cited by 197 · see citing works
Easy over hard: a case study on deep learning
Fu, W., & Menzies, T. (2017) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/3106237.3106256 · Cited by 195 · see citing works
Combining Deep Learning with Information Retrieval to Localize Buggy Files for Bug Reports (N)
Lam, A. N., Nguyen, A. T., Nguyen, H. A., & Nguyen, T. N. (2015) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1109/ase.2015.73 · Cited by 188 · see citing works
Parameterized Pattern Matching: Algorithms and Applications
Baker, B. S. (1996) · Journal of Computer and System Sciences · doi:10.1006/jcss.1996.0003 · Cited by 174 · see citing works
Evaluating clone detection tools with BigCloneBench
Svajlenko, J., & Roy, C. K. (2015) · 2015 IEEE International Conference on Software Maintenance and Evolution (ICSME) · doi:10.1109/icsm.2015.7332459 · Cited by 172 · see citing works
(2014) · doi:10.1145/2635868.2635901 · Cited by 159 · see citing works
Methodbook: Recommending Move Method Refactorings via Relational Topic Models
Bavota, G., Oliveto, R., Gethers, M., Poshyvanyk, D., & Lucia, A. D. (2014) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2013.60 · Cited by 154 · see citing works
Self-citationSearching for better configurations: a rigorous approach to clone evaluation
Wang, T., Harman, M., Jia, Y., & Krinke, J. (2013) · Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering · doi:10.1145/2491411.2491420 · Cited by 147 · see citing works
Learning unified features from natural and programming languages for locating buggy source code
Huo, X., Li, M., & Zhou, Z.-H. (2016) · International Joint Conference on Artificial Intelligence · Cited by 142 · see citing works
Graph-based statistical language model for code
Nguyen, A. T., & Nguyen, T. N. (2016) · Cited by 138 · see citing works
Evaluating Modern Clone Detection Tools
Svajlenko, J., & Roy, C. K. (2014) · IEEE International Conference on Software Maintenance and Evolution (ICSME) · doi:10.1109/icsme.2014.54 · Cited by 121 · see citing works
Improving software modularization via automated analysis of latent topics and dependencies
Bavota, G., Gethers, M., Oliveto, R., Poshyvanyk, D., & Lucia, A. D. (2014) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/2559935 · Cited by 117 · see citing works
Self-citationGraph-Based Statistical Language Model for Code
Nguyen, A. T., & Nguyen, T. N. (2015) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1109/icse.2015.336 · Cited by 114 · see citing works
Detecting similar software applications
McMillan, C., Grechanik, M., & Poshyvanyk, D. (2012) · Cited by 112 · see citing works
Self-citationUsing Data Fusion and Web Mining to Support Feature Location in Software
Revelle, M., Dit, B., & Poshyvanyk, D. (2010) · 2010 IEEE 18th International Conference on Program Comprehension · doi:10.1109/icpc.2010.10 · Cited by 105 · see citing works
Self-citationAn Empirical Study on the Developers ’ Perception of Software Coupling
(2013) · Cited by 95 · see citing works
Self-citation(2012) · doi:10.1007/s10664-011-9194-4 · Cited by 95 · see citing works
Self-citationCan Better Identifier Splitting Techniques Help Feature Location?
Dit, B., Guerrouj, L., Poshyvanyk, D., & Antoniol, G. (2011) · 2011 IEEE 19th International Conference on Program Comprehension · doi:10.1109/icpc.2011.47 · Cited by 89 · see citing works
Self-citationVisualizing Textual Redundancy in Legacy Source
(1994) · Cited by 84 · see citing works
Detecting similar software applications
McMillan, C., Grechanik, M., & Poshyvanyk, D. (2012) · Proceedings/Proceedings - International Conference on Software Engineering · doi:10.1109/icse.2012.6227178 · Cited by 83 · see citing works
Self-citation(2013) · doi:10.1145/2507288.2507314 · Cited by 66 · see citing works
On automatically detecting similar Android apps
Linares-Vasquez, M., Holtzhauer, A., & Poshyvanyk, D. (2016) · 2016 IEEE 24th International Conference on Program Comprehension (ICPC) · doi:10.1109/icpc.2016.7503721 · Cited by 43 · see citing works
Self-citationParameterizing and Assembling IR-Based Solutions for SE Tasks Using Genetic Algorithms
Panichella, A., Dit, B., Oliveto, R., Di Penta, M., Poshyvanyk, D., & De Lucia, A. (2016) · 2016 IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER) · doi:10.1109/saner.2016.97 · Cited by 36 · see citing works
Self-citation(2013) · doi:10.5555/2662708.2662710 · Cited by 34 · see citing works
AN EXPERIMENTAL DETERMINATION OF THE PROBABLE ERROR OF DR SPEARMAN'S CORRELATION COEFFICIENTS
STUDENT (1921) · Biometrika · doi:10.1093/biomet/13.2-3.263 · Cited by 27 · see citing works
Automatic Categorization with Deep Neural Network for Open-Source Java Projects
Nguyen, A. T., & Nguyen, T. N. (2017) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1109/icse-c.2017.118 · Cited by 18 · see citing works
A mutation analysis based benchmarking framework for clone detectors
Svajlenko, J., Roy, C. K., & Cordy, J. R. (2013) · IEEE International Workshop on Software Clones (IWSC) · doi:10.1109/iwsc.2013.6613033 · Cited by 18 · see citing works
Dit, B., Moritz, E., Linares‐Vásquez, M., Poshyvanyk, D., & Cleland‐Huang, J. (2014) · Empirical Software Engineering · doi:10.1007/s10664-014-9339-3 · Cited by 17 · see citing works
Self-citationVector abstraction and concretization for scalable detection of refactorings
Milea, N. A., Jiang, L., & Khoo, S. (2014) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/2635868.2635926 · Cited by 15 · see citing works
Jun, W. (2018) · Chapman & Hall/CRC eBooks · doi:10.1201/9781315169491-3 · Cited by 4 · see citing works
Graph Embedding Techniques, Applications, and Performance: A Survey
Goyal, P., & Ferrara, E. (2017) · arXiv · doi:10.48550/arxiv.1705.02801
An empirical study on the developers' perception of software coupling
Bavota, G., Dit, B., Oliveto, R., et al. (2013) · 2013 35th International Conference on Software Engineering (ICSE) · doi:10.1109/icse.2013.6606615
Self-citationAn Experimental Determination of the Probable Error of Dr Spearman's Correlation Coefficients
Student (1921) · Biometrika · doi:10.2307/2331754
Li, Z., & Zhou, Y. (2005) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1095430.1081755
A parallel and efficient approach to large scale clone detection
Sajnani, H., & Lopes, C. (2013) · 2013 7th International Workshop on Software Clones (IWSC) · doi:10.1109/iwsc.2013.6613042
Flagged first, then by citations
Research works printed but not linked: 9
- 2017. Online Appendix: https://sites.google.com/view/learningcodesimilarities , Source Code: https://github.com/micheletufano/AutoenCODE. ( 2017 ). 2017. Online Appendix: https://sites.google.com/view/learningcodesimilarities, Source Code: https://github.com/micheletufano/AutoenCODE. (2017).
- 10.5555/2486788.2486879 · DOI
- 10.5555/3060832.3060845 · DOI
- 10.5555/2337223.2337267 · DOI
- 10.5555/3015812.3016002 · DOI
- 10.5555/2486788.2486857 · DOI
- 10.5555/2662708.2662719 · DOI
- 10.1145/2491411.2491420 · DOI · Paper page
- 10.5555/3172077.3172312 · DOI
Cited by
Sorted by citations
A Novel Neural Source Code Representation Based on Abstract Syntax Tree
Zhang, J., Wang, X., Zhang, H., Sun, H., Wang, K., & Liu, X. (2019) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1109/icse.2019.00086 · Cited by 710 · see citing works
An Empirical Study on Learning Bug-Fixing Patches in the Wild via Neural Machine Translation
Tufano, M., Watson, C., Bavota, G., Penta, M. D., White, M., & Poshyvanyk, D. (2019) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3340544 · Cited by 370 · see citing works
Self-citationOn Learning Meaningful Code Changes Via Neural Machine Translation
Tufano, M., Pantiuchina, J., Watson, C., Bavota, G., & Poshyvanyk, D. (2019) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1109/icse.2019.00021 · Cited by 212 · see citing works
Self-citationSorting and Transforming Program Repair Ingredients via Deep Learning Code Similarities
White, M., Tufano, M., Martínez, M., Monperrus, M., & Poshyvanyk, D. (2019) · IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER) · doi:10.1109/saner.2019.8668043 · Cited by 167 · see citing works
Self-citationLi, Y., Wang, S., Nguyen, T. N., & Nguyen, S. (2019) · Proceedings of the ACM on Programming Languages · doi:10.1145/3360588 · Cited by 164 · see citing works
A Systematic Literature Review on the Use of Deep Learning in Software Engineering Research
Watson, C., Cooper, N., Palacio, D. N., Moran, K., & Poshyvanyk, D. (2022) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3485275 · Cited by 137 · see citing works
Self-citationNatural Language Generation and Understanding of Big Code for AI-Assisted Programming: A Review
Wong, M.-F., Guo, S., Hang, C. N., Ho, S., & Tan, C. W. (2023) · Entropy · doi:10.3390/e25060888 · Cited by 137 · see citing works
Functional code clone detection with syntax and semantics fusion learning
Fang, C., Liu, Z., Shi, Y., Huang, J., & Shi, Q. (2020) · ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA) · doi:10.1145/3395363.3397362 · Cited by 132 · see citing works
Code smell detection by deep direct-learning and transfer-learning
Sharma, T., Efstathiou, V., Λουρίδας, Π., & Spinellis, D. D. (2021) · Journal of Systems and Software · doi:10.1016/j.jss.2021.110936 · Cited by 149 · see citing works
InferCode: Self-Supervised Learning of Code Representations by Predicting Subtrees
Bui, N. D. Q., Yu, Y., & Jiang, L. (2021) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1109/icse43902.2021.00109 · Cited by 116 · see citing works
Deep learning-based software engineering: progress, challenges, and opportunities
Chen, X., Hu, X., Huang, Y., Jiang, H., Ji, W., Jiang, Y., Jiang, Y., Liu, B., Liu, H., Li, X., et al. (2024) · Science China Information Sciences · doi:10.1007/s11432-023-4127-5 · Cited by 114 · see citing works
Learning-Based Recursive Aggregation of Abstract Syntax Trees for Code Clone Detection
Büch, L., & Andrzejak, A. (2019) · IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER) · doi:10.1109/saner.2019.8668039 · Cited by 94 · see citing works
Shen, Z., & Chen, S. (2020) · Security and Communication Networks · doi:10.1155/2020/8858010 · Cited by 75 · see citing works
Nasrabadi, M. Z., Parsa, S. A., Ramezani, M., Roy, C. K., & Ekhtiarzadeh, M. (2023) · Journal of Systems and Software · doi:10.1016/j.jss.2023.111796 · Cited by 77 · see citing works
A Literature Review of Using Machine Learning in Software Development Life Cycle Stages
Shafiq, S., Mashkoor, A., Mayr‐Dorn, C., & Egyed, A. F. (2021) · IEEE Access · doi:10.1109/access.2021.3119746 · Cited by 79 · see citing works
A Survey of Automatic Generation of Source Code Comments: Algorithms and Techniques
Song, X., Sun, H.-L., Wang, X., & Yan, J. (2019) · IEEE Access · doi:10.1109/access.2019.2931579 · Cited by 68 · see citing works
Using Transfer Learning for Code-Related Tasks
Mastropaolo, A., Cooper, N., Palacio, D. N., Scalabrino, S., Poshyvanyk, D., Oliveto, R., & Bavota, G. (2022) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2022.3183297 · Cited by 74 · see citing works
Self-citationSuggesting natural method names to check name consistencies
Nguyen, S., Phan, H., Le, T., & Nguyen, T. N. (2020) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1145/3377811.3380926 · Cited by 73 · see citing works
A Survey of Automatic Source Code Summarization
Zhang, C., Wang, J., Zhou, Q., Xu, T. X., Tang, K., Gui, H., & Liu, F. (2022) · Symmetry · doi:10.3390/sym14030471 · Cited by 64 · see citing works
(2020) · doi:10.1145/3324884.3416562 · Cited by 58 · see citing works
Code search based on context-aware code translation
Sun, W., Fang, C., Chen, Y., et al. (2022) · Proceedings/Proceedings - International Conference on Software Engineering · doi:10.1145/3510003.3510140 · Cited by 56 · see citing works
deGraphCS : Embedding Variable-based Flow Graph for Neural Code Search
Zeng, C., Yu, Y., Li, S., Xia, X., Wang, Z., Geng, M., Bai, L., Dong, W., & Liao, X. (2022) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3546066 · Cited by 53 · see citing works
Challenging Machine Learning-Based Clone Detectors via Semantic-Preserving Code Transformations
Zhang, W., Guo, S., Zhang, H., Sui, Y., Xue, Y., & Xu, Y. (2023) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2023.3240118 · Cited by 54 · see citing works
Did We Miss Something Important? Studying and Exploring Variable-Aware Log Abstraction
Li, Z., Luo, C., Chen, T.-H. P., Shang, W., He, S., Lin, Q., & Zhang, D. (2023) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1109/icse48619.2023.00078 · Cited by 56 · see citing works
A survey on machine learning techniques applied to source code
Sharma, T., Kechagia, M., Georgiou, S., Tiwari, R., Vats, I., Moazen, H., & Sarro, F. (2023) · Journal of Systems and Software · doi:10.1016/j.jss.2023.111934 · Cited by 130 · see citing works
Modeling Functional Similarity in Source Code With Graph-Based Siamese Networks
Mehrotra, N., Agarwal, N., Gupta, P., Anand, S., Lo, D., & Purandare, R. (2021) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2021.3105556 · Cited by 45 · see citing works
Li, Z., Chen, T.-H. P., & Shang, W. (2020) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1145/3324884.3416636 · Cited by 41 · see citing works
Multi-triage: A multi-task learning framework for bug triage
Aung, T. W. W., Wan, Y., Huo, H., & Sui, Y. (2021) · Journal of Systems and Software · doi:10.1016/j.jss.2021.111133 · Cited by 40 · see citing works
Fast Code Clone Detection Based on Weighted Recursive Autoencoders
Zeng, J., Ben, K., Li, X., & Zhang, X. (2019) · IEEE Access · doi:10.1109/access.2019.2938825 · Cited by 41 · see citing works
Abdu, A., Zhai, Z., Algabri, R., Abdo, H. A., Hamad, K., & Al–antari, M. A. (2022) · Mathematics · doi:10.3390/math10173120 · Cited by 36 · see citing works
Zhao, Z., Yang, B., Li, G., Liu, H., & Jin, Z. G. (2021) · Journal of Systems and Software · doi:10.1016/j.jss.2021.111108 · Cited by 38 · see citing works
Source Code Summarization with Structural Relative Position Guided Transformer
Gong, Z., Gao, C., Wang, Y., Gu, W., Peng, Y., & Xu, Z. (2022) · IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER) · doi:10.1109/saner53432.2022.00013 · Cited by 39 · see citing works
Ding, Z., Li, H., Shang, W., & Chen, T.-H. P. (2022) · Empirical Software Engineering · doi:10.1007/s10664-022-10118-5 · Cited by 34 · see citing works
Yang, Y., Hu, X., Gao, Z.-P., Chen, J.-F., Ni, C., Xia, X., & Lo, D. (2024) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2023.3347898 · Cited by 35 · see citing works
Identifying Redundancies in Fork-based Development
Ren, L., Zhou, S., Kästner, C., & Wąsowski, A. (2019) · IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER) · doi:10.1109/saner.2019.8668023 · Cited by 32 · see citing works
Post2Vec: Learning Distributed Representations of Stack Overflow Posts
Xu, B., Hoang, T., Sharma, A. B., Yang, C., Xia, X., & Lo, D. (2021) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2021.3093761 · Cited by 32 · see citing works
Deep learning approaches for bad smell detection: a systematic literature review
Alazba, A., Aljamaan, H., & Alshayeb, M. (2023) · Empirical Software Engineering · doi:10.1007/s10664-023-10312-z · Cited by 30 · see citing works
Deep Learning for Code Intelligence: Survey, Benchmark and Toolkit
Wan, Y., Bi, Z., He, Y., Zhang, J., Zhang, H., Sui, Y., Xu, G., Jin, H., & Yu, P. S. (2024) · ACM Computing Surveys · doi:10.1145/3664597 · Cited by 34 · see citing works
A deep learning approach to program similarity
Marastoni, N., Giacobazzi, R., & Preda, M. D. (2018) · doi:10.1145/3243127.3243131 · Cited by 31 · see citing works
A systematic mapping study of source code representation for deep learning in software engineering
Samoaa, P., Bayram, F., Salza, P., & Leitner, P. (2022) · IET Software · doi:10.1049/sfw2.12064 · Cited by 29 · see citing works
Keller, P., Kaboré, A. K., Plein, L., Klein, J., Traon, Y. L., & Bissyandé, T. F. (2021) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3485135 · Cited by 27 · see citing works
LoGenText: Automatically Generating Logging Texts Using Neural Machine Translation
Ding, Z., Li, H., & Shang, W. (2022) · IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER) · doi:10.1109/saner53432.2022.00051 · Cited by 31 · see citing works
Utilizing Source Code Embeddings to Identify Correct Patches
Csuvik, V., Horvath, D., Horváth, F., & Vidács, L. (2020) · IEEE International Workshop on Intelligent Bug Fixing (IBF) · doi:10.1109/ibf50092.2020.9034714 · Cited by 29 · see citing works
HELoC: Hierarchical Contrastive Learning of Source Code Representation
Wang, X., Wu, Q., Zhang, H.-Y., Lyu, C., Jiang, X., Zheng, Z., Lyu, L., & Hu, S. (2022) · IEEE International Conference on Program Comprehension · doi:10.1145/3524610.3527896 · Cited by 27 · see citing works
Detecting Condition-Related Bugs with Control Flow Graph Neural Network
Zhang, J., Wang, X., Zhang, H., Sun, H., Liu, X., Hu, C., & Liu, Y. (2023) · ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA) · doi:10.1145/3597926.3598142 · Cited by 25 · see citing works
Modeling Vocabulary for Big Code Machine LearningPreprint
Babii, H., Janes, A., & Robbes, R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.01873 · Cited by 22 · see citing works
Software engineering meets deep learning
Ferreira, F., Silva, L. L., & Valente, M. T. (2021) · ACM Symposium on Applied Computing · doi:10.1145/3412841.3442029 · Cited by 23 · see citing works
Source Code Level Word Embeddings in Aiding Semantic Test-to-Code Traceability
Csuvik, V., Kicsi, A., & Vidács, L. (2019) · IEEE/ACM International Symposium on Software and Systems Traceability (SST) · doi:10.1109/sst.2019.00016 · Cited by 23 · see citing works
A Mocktail of Source Code Representations
(2021) · doi:10.1109/ase51524.2021.9678551 · Cited by 22 · see citing works
Style-Analyzer: Fixing Code Style Inconsistencies with Interpretable Unsupervised Algorithms
Markovtsev, V., Long, W., Mougard, H., Slavnov, K., & Bulychev, E. (2019) · International Conference on Mining Software Repositories (MSR) · doi:10.1109/msr.2019.00073 · Cited by 20 · see citing works
Evaluating Human-AI Partnership for LLM-based Code Migration
Omidvar-Tehrani, B., Ishaani, M., & Anubhai, A. (2024) · CHI Conference Extended Abstracts on Human Factors in Computing Systems (CHI EA) · doi:10.1145/3613905.3650896 · Cited by 20 · see citing works
A Source Code Similarity Based on Siamese Neural Network
Xie, C., Wang, X., Qian, C., & Mengqi, W. (2020) · Applied Sciences · doi:10.3390/app10217519 · Cited by 19 · see citing works
Toward a Theory of Causation for Interpreting Neural Code Models
Nader Palacio, D., Velasco, A., Cooper, N., Rodriguez, A., Moran, K., & Poshyvanyk, D. (2024) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2024.3379943 · Cited by 18 · see citing works
Self-citationDing, Z.-S., Tang, Y., Cheng, X., Li, H., & Shang, W.-Y. (2023) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3624740 · Cited by 29 · see citing works
Exploring the applicability of low-shot learning in mining software repositories
Ott, J., Atchison, A., & Linstead, E. J. (2019) · Journal Of Big Data · doi:10.1186/s40537-019-0198-z · Cited by 17 · see citing works
Towards effective AI-powered agile project managementPreprint
Dam, H. K., Tran, T., Grundy, J., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.10578 · Cited by 17 · see citing works
Quradaa, F. H., Shahzad, S., & Almoqbily, R. S. (2024) · PLoS ONE · doi:10.1371/journal.pone.0296858 · Cited by 16 · see citing works
A controlled experiment of different code representations for learning-based program repair
Namavar, M., Nashid, N., & Mesbah, A. (2022) · Empirical Software Engineering · doi:10.1007/s10664-022-10223-5 · Cited by 17 · see citing works
A review of automatic source code summarization
Zhang, X., Hou, X., Qiao, X., & Song, W. (2024) · Empirical Software Engineering · doi:10.1007/s10664-024-10553-6 · Cited by 18 · see citing works
MISIM: An End-to-End Neural Code Similarity System.
(2020) · Cited by 17 · see citing works
BigCloneBench Considered Harmful for Machine Learning
Krinke, J., & Ragkhitwetsagul, C. (2022) · IEEE International Workshop on Software Clones (IWSC) · doi:10.1109/iwsc55060.2022.00008 · Cited by 17 · see citing works
Review Sharing via Deep Semi-Supervised Code Clone Detection
Guo, C., Yang, H., Huang, D., Zhang, J., Dong, N., Xu, J., & Zhu, J. (2020) · IEEE Access · doi:10.1109/access.2020.2966532 · Cited by 16 · see citing works
Fine-grained code-comment semantic interaction analysis
Geng, M., Wang, S., Dong, D., Gu, S., Peng, F., Ruan, W., & Liao, X. (2022) · IEEE International Conference on Program Comprehension (ICPC) · doi:10.1145/3524610.3527887 · Cited by 15 · see citing works
Synergy between Machine/Deep Learning and Software Engineering: How Far Are We?Preprint
Wang, S., Huang, L., Ge, J., Zhang, T., Feng, H., Li, M., Zhang, H., & Ng, V. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.05515 · Cited by 9 · see citing works
MulCode: A Multi-task Learning Approach for Source Code Understanding
Wang, D., Yu, Y., Li, S., Dong, W., Wang, J., & Liao, Q. (2021) · IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER) · doi:10.1109/saner50967.2021.00014 · Cited by 15 · see citing works
Machine-learning supported vulnerability detection in source code
Sonnekalb, T. (2019) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/3338906.3341466 · Cited by 14 · see citing works
Code Clone Detection with Hierarchical Attentive Graph Embedding
Ji, X., Liu, L., & Zhu, J. (2021) · International Journal of Software Engineering and Knowledge Engineering · doi:10.1142/s021819402150025x · Cited by 14 · see citing works
On Measuring Vulnerable JavaScript Functions in the Wild
(2022) · doi:10.1145/3488932.3497769 · Cited by 13 · see citing works
Benchmarking Causal Study to Interpret Large Language Models for Source Code
Rodriguez-Cardenas, D., Palacio, D. N., Khati, D., Burke, H., & Poshyvanyk, D. (2023) · 2023 IEEE International Conference on Software Maintenance and Evolution (ICSME) · doi:10.1109/icsme58846.2023.00040 · Cited by 14 · see citing works
Self-citationEvaluation of Textual Similarity Techniques in Code Level Traceability
Csuvik, V., Kicsi, A., & Vidács, L. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-24305-0_40 · Cited by 14 · see citing works
Towards Learning Generalizable Code Embeddings Using Task-agnostic Graph Convolutional Networks
Ding, Z., Li, H., Shang, W., & Chen, T.-H. P. (2022) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3542944 · Cited by 12 · see citing works
Using Large-Scale Anomaly Detection on Code to Improve Kotlin Compiler
Bryksin, T., Petukhov, V., Alexin, I., Prikhodko, S., Shpilman, A., Kovalenko, V., & Povarov, N. (2020) · International Conference on Mining Software Repositories (MSR) · doi:10.1145/3379597.3387447 · Cited by 14 · see citing works
A Survey on Machine Learning Techniques for Source Code AnalysisPreprint
Sharma, T., Kechagia, M., Georgiou, S., Tiwari, R. K., Vats, I., Moazen, H., & Sarro, F. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.09610 · Cited by 56 · see citing works
A hybrid code representation learning approach for predicting method names
Zhang, F., Chen, B., Li, R., & Peng, X. (2021) · Journal of Systems and Software · doi:10.1016/j.jss.2021.111011 · Cited by 10 · see citing works
InferCode: Self-Supervised Learning of Code Representations by Predicting SubtreesPreprint
Bui, N. D. Q., Yu, Y., & Jiang, L. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.07023 · Cited by 9 · see citing works
Guo, C., Huang, D., Dong, N., Ye, Q., Xu, J., Fan, Y., Yang, H., & Xu, Y. (2019) · IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER) · doi:10.1109/saner.2019.8668037 · Cited by 9 · see citing works
Embedding Context as Code Dependencies for Neural Program Repair
Nashid, N., Sintaha, M., & Mesbah, A. (2023) · IEEE International Conference on Software Testing, Verification and Validation (ICST) · doi:10.1109/icst57152.2023.00018 · Cited by 9 · see citing works
Software system comparison with semantic source code embeddings
Karakatič, S., Miloševič, A., & Heričko, T. (2022) · Empirical Software Engineering · doi:10.1007/s10664-022-10122-9 · Cited by 8 · see citing works
Machine Learning for Software Engineering: A Systematic MappingPreprint
Shafiq, S., Mashkoor, A., Mayr‐Dorn, C., & Egyed, A. F. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.13299 · Cited by 11 · see citing works
Clone Detection on Large Scala Codebases
Rahman, W., Xu, Y., Pu, F., Xuan, J., Jia, X., Basios, M., Kanthan, L., Li, L., Wu, F., & Xu, B. (2020) · IEEE International Workshop on Software Clones (IWSC) · doi:10.1109/iwsc50091.2020.9047640 · Cited by 9 · see citing works
FCNN: Simple neural networks for complex code tasks
Sun, X., Liu, T., Liu, C., & Dong, W. (2024) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2024.101970 · Cited by 10 · see citing works
An Empirical Study on Automatically Detecting AI-Generated Source Code: How Far are We?
Suh, H., Tafreshipour, M., Li, J., Bhattiprolu, A., & Ahmed, I. (2025) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1109/icse55347.2025.00064 · Cited by 11 · see citing works
Exploring Plausible Patches Using Source Code Embeddings in JavaScript
Csuvik, V., Horváth, D., Lajkó, M., & Vidács, L. (2021) · IEEE/ACM International Workshop on Automated Program Repair (APR) · doi:10.1109/apr52552.2021.00010 · Cited by 7 · see citing works
SparseCoder: Advancing source code analysis with sparse attention and learned token pruning
Yang, X., Jakubowski, M. H., Li, K., Yu, H., & Menzies, T. (2024) · Empirical Software Engineering · doi:10.1007/s10664-024-10558-1 · Cited by 6 · see citing works
Reducing False Positives of Static Bug Detectors Through Code Representation Learning
Yang, Y., Wen, M., Gao, X. Y., Zhang, Y., & Sun, H. (2024) · IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER) · doi:10.1109/saner60148.2024.00075 · Cited by 7 · see citing works
Introducing Privacy in Screen Event Frequency Analysis for Android Apps
Zhang, H., Latif, S., Bassily, R., & Rountev, A. (2019) · IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM) · doi:10.1109/scam.2019.00037 · Cited by 6 · see citing works
Hammad, M., Babur, Ö., Basit, H. A., & van den Brand, M. (2021) · PeerJ Computer Science · doi:10.7717/peerj-cs.737 · Cited by 6 · see citing works
TransformCode: A Contrastive Learning Framework for Code Embedding via Subtree Transformation
Xian, Z., Huang, R., Towey, D., Fang, C., & Chen, Z. (2024) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2024.3393419 · Cited by 8 · see citing works
- Authors
- Tufano, M., Watson, C., Bavota, G., Di Penta, M., White, M., & Poshyvanyk, D.
- Affiliations
- William & Mary (US)
- Università della Svizzera italiana (CH)
- University of Sannio, Benevento, Italy
- Venue
- Proceedings of the 15th International Conference on Mining Software Repositories
- Publisher
- ACM
- Published
- 2018-05-28
- Pages
- 542-553
- OpenAlex
- W2883359218
- Cited by
- 158
- References
- 75
- Citations by year
- 2026: 6 · 2025: 11 · 2024: 20 · 2023: 22 · 2022: 31 · 2021: 29 · 2020: 20 · 2019: 18 · 2018: 1
- FWCI
- 13.34
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- International Conference on Mining Software Repositories (MSR) (publishedVersion)
- Funders
- NSF (CCF-1525902)
- Topics
- Physical Sciences › Computer Science › Information Systems › Software Engineering Research
- Physical Sciences › Computer Science › Software › Software Testing and Debugging Techniques
- Physical Sciences › Computer Science › Information Systems › Software Engineering Techniques and Practices
- Keywords
- code similarity, clone detection, source code representation, abstract syntax tree, control flow graph, bytecode, feature engineering
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.
Claims read under definition version 3 (extract-v3) on 2026-09-28.
Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-09-28.
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