Lina Gong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Lina Gong has a total of 101 co-authors. Here are the top co-authors by number of shared publications:
- Mingqiang Wei
Nanjing University of Aeronautics and Astronautics, Nanjing, China
15 shared publications - Zhiqiu Huang
College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China
10 shared publications - Shujuan Jiang
School of Computer Science and Technology, Engineering Research Center of Mine Digitalization Ministry of Education, China University of Mining and Technology, Xuzhou, China
7 shared publications - Xuefeng Yan
Nanjing University of Aeronautics and Astronautics
6 shared publications - Yu Zhao
School of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China
6 shared publications - Haoxiang Zhang
Queen's University, Kingston, ON, Canada
5 shared publications
Latest Publications
- Open Access
- 1 January 2026
- Published by Institution of Engineering and Technology (IET) in IET Software
- Vol. 2026 (1)
VulFinder: A Multi‐Agent‐Driven Test Generation Framework for Guiding Vulnerability Reachability Analysis
Software engineering promotes the reuse of software components to accelerate the development process; however, reusing third‐party components in AI4SE’s software supply chain (SSC) can introduce vulnerability risks. Once a new vulnerability in a third‐party component emerges, developers need to determine whether the current project is affected by the vulnerability, that is, assess the vulnerability reachability issue in the SSC, which requires a significant amount of manpower and resources for assessment. To address this issue, we propose VulFinder, a multi‐agent‐driven framework for automated vulnerability reachability validation. VulFinder begins by using static code analysis tools to construct function call paths between downstream applications and dependency vulnerability APIs. Leveraging a multi‐agent mechanism comprising a distillator, discriminator, generator, and validator, VulFinder iteratively generates exploit tests for methods along the call graph, effectively validating vulnerability reachability by executing these tests on downstream applications. We evaluate the performance of VulFinder across different programming language ecosystems, which were constructed from vulnerability datasets for Java and Python. Experiments show that VulFinder achieves 21% accuracy improvement over the state‐of‐the‐art tool VESTA and a 7% accuracy improvement over the popular baseline tool TRANSFER on the Java dataset and also demonstrates robust generalizability on the Python dataset, significantly reducing false positives and false negatives and delivering an average efficiency improvement of over 1.5 times. We recommend that researchers and practitioners use VulFinder in practice, which integrates the code comprehension capabilities of large language models (LLMs) with the multi‐agent framework to reduce false alarms and missed alarms in the reachability of vulnerabilities in SSC.
- 1 January 2026
- Published by Institution of Engineering and Technology (IET) in IET Software
- Vol. 2026 (1)
Open AccessVulFinder: A Multi‐Agent‐Driven Test Generation Framework for Guiding Vulnerability Reachability Analysis
Software engineering promotes the reuse of software components to accelerate the development process; however, reusing third‐party components in AI4SE’s software supply chain (SSC) can introduce vulnerability risks. Once a new vulnerability in a third‐party component emerges, developers need to determine whether the current project is affected by the vulnerability, that is, assess the vulnerability reachability issue in the SSC, which requires a significant amount of manpower and resources for assessment. To address this issue, we propose VulFinder, a multi‐agent‐driven framework for automated vulnerability reachability validation. VulFinder begins by using static code analysis tools to construct function call paths between downstream applications and dependency vulnerability APIs. Leveraging a multi‐agent mechanism comprising a distillator, discriminator, generator, and validator, VulFinder iteratively generates exploit tests for methods along the call graph, effectively validating vulnerability reachability by executing these tests on downstream applications. We evaluate the performance of VulFinder across different programming language ecosystems, which were constructed from vulnerability datasets for Java and Python. Experiments show that VulFinder achieves 21% accuracy improvement over the state‐of‐the‐art tool VESTA and a 7% accuracy improvement over the popular baseline tool TRANSFER on the Java dataset and also demonstrates robust generalizability on the Python dataset, significantly reducing false positives and false negatives and delivering an average efficiency improvement of over 1.5 times. We recommend that researchers and practitioners use VulFinder in practice, which integrates the code comprehension capabilities of large language models (LLMs) with the multi‐agent framework to reduce false alarms and missed alarms in the reachability of vulnerabilities in SSC.
- 24 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 52 (1) , 116-136
Low-Cost Testing for Path Coverage of MPI Programs Using Surrogate-Assisted Changeable Multi-Objective Optimization
A target path of Message Passing Interface (MPI) programs typically consists of several target sub-paths. During solving a test case that cover the target path using an intelligent optimization algorithm, we often find that there are some hard-to-cover target sub-paths, which limit the testing efficiency of the entire target path. Therefore, this paper proposes an approach of low-cost testing for path coverage of MPI programs using surrogate-assisted changeable multi-objective optimization, which is used to further improve the effectiveness and efficiency of test case generation. The proposed approach first establishes a changeable multi-objective optimization model, which is used to guide the generation of test cases. During solving the changeable multi-objective optimization model using an intelligent optimization algorithm, we then determine each hard-to-cover target sub-path and form a corresponding sample set. Finally, we manage the surrogate model corresponding to each hard-to-cover target sub-path based on the formed sample set, and select superior evolutionary individuals to really execute the MPI program under test, thus reducing the cost and times of program execution. The proposed approach has been applied to path coverage testing of several benchmark MPI programs, and compared with several state-of-the-art approaches. The experimental results show that the proposed approach significantly improves the effectiveness and efficiency of generating test cases.
- 24 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 52 (1) , 116-136
Low-Cost Testing for Path Coverage of MPI Programs Using Surrogate-Assisted Changeable Multi-Objective Optimization
A target path of Message Passing Interface (MPI) programs typically consists of several target sub-paths. During solving a test case that cover the target path using an intelligent optimization algorithm, we often find that there are some hard-to-cover target sub-paths, which limit the testing efficiency of the entire target path. Therefore, this paper proposes an approach of low-cost testing for path coverage of MPI programs using surrogate-assisted changeable multi-objective optimization, which is used to further improve the effectiveness and efficiency of test case generation. The proposed approach first establishes a changeable multi-objective optimization model, which is used to guide the generation of test cases. During solving the changeable multi-objective optimization model using an intelligent optimization algorithm, we then determine each hard-to-cover target sub-path and form a corresponding sample set. Finally, we manage the surrogate model corresponding to each hard-to-cover target sub-path based on the formed sample set, and select superior evolutionary individuals to really execute the MPI program under test, thus reducing the cost and times of program execution. The proposed approach has been applied to path coverage testing of several benchmark MPI programs, and compared with several state-of-the-art approaches. The experimental results show that the proposed approach significantly improves the effectiveness and efficiency of generating test cases.
- Open Access
DCA-LUT: Deep Chromatic Alignment with 5D LUT for Purple Fringing Removal
Purple fringing, a persistent artifact caused by Longitudinal Chromatic Aberration (LCA) in camera lenses, has long degraded the clarity and realism of digital imaging. Traditional solutions rely on complex and expensive apochromatic (APO) lens hardware and the extraction of handcrafted features, ignoring the data-driven approach. To fill this gap, we introduce DCA-LUT, the first deep learning framework for purple fringing removal. Inspired by the physical root of the problem, the spatial misalignment of RGB color channels due to lens dispersion, we introduce a novel Chromatic-Aware Coordinate Transformation (CA-CT) module, learning an image-adaptive color space to decouple and isolate fringing into a dedicated dimension. This targeted separation allows the network to learn a precise ``purple fringe channel", which then guides the accurate restoration of the luminance channel. The final color correction is performed by a learned 5D Look-Up Table (5D LUT), enabling efficient and powerful% non-linear color mapping. To enable robust training and fair evaluation, we constructed a large-scale synthetic purple fringing dataset (PF-Synth). Extensive experiments in synthetic and real-world datasets demonstrate that our method achieves state-of-the-art performance in purple fringing removal.
Open AccessDCA-LUT: Deep Chromatic Alignment with 5D LUT for Purple Fringing Removal
Purple fringing, a persistent artifact caused by Longitudinal Chromatic Aberration (LCA) in camera lenses, has long degraded the clarity and realism of digital imaging. Traditional solutions rely on complex and expensive apochromatic (APO) lens hardware and the extraction of handcrafted features, ignoring the data-driven approach. To fill this gap, we introduce DCA-LUT, the first deep learning framework for purple fringing removal. Inspired by the physical root of the problem, the spatial misalignment of RGB color channels due to lens dispersion, we introduce a novel Chromatic-Aware Coordinate Transformation (CA-CT) module, learning an image-adaptive color space to decouple and isolate fringing into a dedicated dimension. This targeted separation allows the network to learn a precise ``purple fringe channel", which then guides the accurate restoration of the luminance channel. The final color correction is performed by a learned 5D Look-Up Table (5D LUT), enabling efficient and powerful% non-linear color mapping. To enable robust training and fair evaluation, we constructed a large-scale synthetic purple fringing dataset (PF-Synth). Extensive experiments in synthetic and real-world datasets demonstrate that our method achieves state-of-the-art performance in purple fringing removal.
- 28 July 2025
- Published by Springer Nature in Automated Software Engineering
- Vol. 32 (2) , 1-35
MCL-VD: Multi-modal contrastive learning with LoRA-enhanced GraphCodeBERT for effective vulnerability detection
- 28 July 2025
- Published by Springer Nature in Automated Software Engineering
- Vol. 32 (2) , 1-35
MCL-VD: Multi-modal contrastive learning with LoRA-enhanced GraphCodeBERT for effective vulnerability detection
- 26 July 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 296
Evaluating the Interactions between class overlap and class imbalance for software defect prediction
- 26 July 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 296
Evaluating the Interactions between class overlap and class imbalance for software defect prediction
- 24 June 2025
- Published by Elsevier in Neural Networks
- Vol. 191, 107739
Rethinking mixture of rain removal via depth-guided adversarial learning
- 24 June 2025
- Published by Elsevier in Neural Networks
- Vol. 191, 107739
Rethinking mixture of rain removal via depth-guided adversarial learning
- Open Access
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 510-521
Unraveling the Characterization and Propagation of Security Vulnerabilities in TensorFlow-based Deep Learning Software Supply Chain
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 510-521
Open AccessUnraveling the Characterization and Propagation of Security Vulnerabilities in TensorFlow-based Deep Learning Software Supply Chain
- Open Access
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 142-146
UITrans: Seamless UI Translation from Android to HarmonyOS
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 142-146
Open AccessUITrans: Seamless UI Translation from Android to HarmonyOS
- 11 February 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 272
An empirical study of best practices for code pre-trained models on software engineering classification tasks
- 11 February 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 272
An empirical study of best practices for code pre-trained models on software engineering classification tasks
- 6 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 31 (10) , 6648-6660
PointCG: Self-Supervised Point Cloud Learning via Joint Completion and Generation
The core of self-supervised point cloud learning lies in setting up appropriate pretext tasks, to construct a pre-training framework that enables the encoder to perceive 3D objects effectively. In this article, we integrate two prevalent methods, masked point modeling (MPM) and 3D-to-2D generation, as pretext tasks within a pre-training framework. We leverage the spatial awareness and precise supervision offered by these two methods to address their respective limitations: ambiguous supervision signals and insensitivity to geometric information. Specifically, the proposed framework, abbreviated as PointCG, consists of a Hidden Point Completion (HPC) module and an Arbitrary-view Image Generation (AIG) module. We first capture visible points from arbitrary views as inputs by removing hidden points. Then, HPC extracts representations of the inputs with an encoder and completes the entire shape with a decoder, while AIG is used to generate rendered images based on the visible points’ representations. Extensive experiments demonstrate the superiority of the proposed method over the baselines in various downstream tasks. Our code will be made available upon acceptance.
- 6 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 31 (10) , 6648-6660
PointCG: Self-Supervised Point Cloud Learning via Joint Completion and Generation
The core of self-supervised point cloud learning lies in setting up appropriate pretext tasks, to construct a pre-training framework that enables the encoder to perceive 3D objects effectively. In this article, we integrate two prevalent methods, masked point modeling (MPM) and 3D-to-2D generation, as pretext tasks within a pre-training framework. We leverage the spatial awareness and precise supervision offered by these two methods to address their respective limitations: ambiguous supervision signals and insensitivity to geometric information. Specifically, the proposed framework, abbreviated as PointCG, consists of a Hidden Point Completion (HPC) module and an Arbitrary-view Image Generation (AIG) module. We first capture visible points from arbitrary views as inputs by removing hidden points. Then, HPC extracts representations of the inputs with an encoder and completes the entire shape with a decoder, while AIG is used to generate rendered images based on the visible points’ representations. Extensive experiments demonstrate the superiority of the proposed method over the baselines in various downstream tasks. Our code will be made available upon acceptance.