Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering · 2022 · 20 citations · 35 references
ComputingComputer ScienceMachine LearningSoftware EngineeringStatistical LearningAbstract Syntax TreesData-flow AnalysisGraph-based LearningParsingSyntactic AnalysisCall Graph ConstructionGraph PruningPruningRandom Forest ClassificationSemantic FeaturesSource Code StructureStructural Graph FeaturesTransformer-based Classification
Constructing a static call graph requires trade-offs between soundness and precision. Program analysis techniques for constructing call graphs are unfortunately usually imprecise. To address this problem, researchers have recently proposed call graph pruning empowered by machine learning to post-process call graphs constructed by static analysis. A machine learning model is built to capture information from the call graph by extracting structural features for use in a random forest classifier. It then removes edges that are predicted to be false positives. Despite the improvements shown by machine learning models, they are still limited as they do not consider the source code semantics and thus often are not able to effectively distinguish true and false positives.
35
The Measurement of Observer Agreement for Categorical Data
J. Richard Landis, Gary G. Koch · Biometrics · 1977 · 78.9K citations · Full text
Laurens van der Maaten, Geoffrey E. Hinton · Journal of Machine Learning Research · 2008 · 35.7K citations
A Comprehensive Survey on Transfer Learning
Fuzhen Zhuang, Zhiyuan Qi, Keyu Duan et al. · Proceedings of the IEEE · 2020 · 6.2K citations
CodeBERT: A Pre-Trained Model for Programming and Natural Languages
Zhangyin Feng, Daya Guo, Duyu Tang et al. · 2020 · 2.4K citations · Full text