Lei Liu

Lei Liu

Auto-generated profile, based on publicly available information

Lei Liu

Jilin University

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 April 2025 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
XLXun Li
Xun Li
LLLei Liu
Lei Liu
YLYuzhou Liu
Yuzhou Liu
YZYu Zhao
Yu Zhao
PZPeng Zhang
Peng Zhang
HLHuaxiao Liu
Huaxiao Liu
Malware detection is a critical issue in software engineering as it directly threatens user information security. Existing approaches often focus on individual modality (either source code or binary code) for the detection, but it ignores to effectively exploit the complementary information between them. This limits the detection performance, especially in complex and evasive malware scenarios. In this paper, we take Android applications written in Java as objects, and provide a novel fine-grained multimodal fusion method with large pre-trained models to combine the features from source and binary codes for the malware detection. For the source code modality, we employ the graphical user interface (GUI) as a framework to segment the source code into snippets, and use a pre-trained programming language model to extract feature representations. For the binary code modality, we convert binary code into grayscale images and fine-tune a pre-trained vision model to extract features indirectly. We then implement cross-modal attention and devise a contrastive loss to align features across modalities, supplementing this with supervised classification loss to refine the multimodal fusion process specifically for malware detection. Our experiments, conducted using the Data-MD and Data-MC benchmarks, demonstrate that our approach achieves a precision of 0.977 and a recall of 0.984 in detecting malware. This underscores the advantages of using large pre-trained models for feature representation and the fusion of information across different modalities for effective malware detection.


1 January 2014 in Information Sciences
Verified
Journal Article
Closed access
LLLei Liu
Lei Liu
PZPeng Zhang
Peng Zhang
RFRong Fan
Rong Fan
RZRui Zhang
Rui Zhang
HYHongji Yang
Hongji Yang

3 June 2024 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
SBShuotong Bai
Shuotong Bai
HLHuaxiao Liu
Huaxiao Liu
EDEnyan Dai
Enyan Dai
LLLei Liu
Lei Liu
Links between issues and pull requests (PRs) assist GitHub developers in tackling technical challenges, gaining development inspiration, and improving repository maintenance. In realistic repositories, these links are still insufficiently established. Aiming at this situation, existing works focus on issues and PRs themselves and employ text similarity with additional information like issue size to predict issue-PR links, yet their effectiveness is unsatisfactory. The limitation is that issues and PRs are not isolated on GitHub. Rather, they are related to multiple GitHub sources, including repositories and submitters, which, through their diverse relationships, can supply potential and crucial knowledge about technical domains, developmental insights, and cross-repository technical details. To this end, we propose A uto IP L inker (AIPL), which introduces the heterogeneous graph to model multiple GitHub sources with their relationships. Further, it leverages the metapath-based technique to reveal and incorporate the potential information for a more comprehensive understanding of issues and PRs. Firstly, we identify 4 types of GitHub sources related to issues and PRs (repositories, users, issues, PRs) as well as their relationships, and model them into task-specific heterogeneous graphs. Next, we analyze information transmitted among issues or PRs to reveal which knowledge is crucial for them. Based on our analysis, we formulate a series of metapaths and employ the metapath-based technique to incorporate various information for learning the knowledge-aware embedding of issues and PRs. Finally, we can infer whether an issue and a PR can be linked based on their embedding. We evaluate the performance of AIPL on real-world data sets collected from GitHub. The results show that, compared to the baselines, AIPL can achieve average improvements of 15.94&, 15.19&, 20.52&, and 18.50& in terms of Accuracy, Precision, Recall, and F1-score.

29 June 2016 in International Journal of Automation and Computing
Verified
Journal Article
Closed access
PDF file
DNDang-Dang Niu
Dang-Dang Niu
LLLei Liu
Lei Liu
XZXin Zhang
Xin Zhang
SLShuai Lü
Shuai Lü
ZLZhuang Li
Zhuang Li

11 June 2018 in AI Communications
Verified
Journal Article
Closed access
PDF file
DNDangdang Niu
Dangdang Niu
LLLei Liu
Lei Liu
SLShuai Lü
Shuai Lü
Several efficient SAT-based methods for computing the preferred extensions in (abstract) argumentation frameworks (AF) are proposed lately. However, only complete SAT solvers have been exploited so far. It is a natural question that how the appealing