Jul 2026· Annual International Computer Software and Applications Conference· pp. 3206-3215· 0 citations· 30 references
Computer Science
Abstract
Fault localization is a critical phase in software testing and debugging which significantly impacts the efficiency of software fault repair. Existing fault localization research predominantly focuses on the method or statement level, while variable level localization remains less explored. Although variable level techniques offer finer-grained clues closer to root causes, current approaches typically rely on isolated statistical analysis. They fail to capture the complex structural dependencies among program entities, which limits their effectiveness in tracing error propagation. To address this, we propose GVFL, a variable level fault localization method that utilizes graph representation learning to capture complex structural dependencies. It first employs decision trees to select critical variables strongly associated with failures. Then, it constructs a variable relationship graph to capture the dependencies among these variables. Finally, it utilizes graph representation learning to compute suspiciousness scores for fault localization. To evaluate the performance of GVFL, we conduct an empirical study on 835 real faults from the widely used Defects4J v2.0.0 dataset. The results show that GVFL locates a total of 210, 566, and 844 faulty variable positions on Top-1, Top-5, and Top-10 metrics, respectively. It outperforms state-of-the-art FL techniques, including IsoVar, SmartFL, and VarDT. We further analyze the impact of different graph neural network models and variable attributes on GVFL performance. Experimental results indicate that GGAT achieves the best performance for GVFL. Furthermore, all three variable attributes significantly influence the effectiveness of GVFL, with variable value features being the most important.
In large-scale systems, fault localization remains expensive because bug reports are often ambiguous and incomplete. In practice, developers rely heavily on runtime logs and coverage data as critical clues for reasoning about how faults propagate through systems. However, these rich diagnostic signals are rarely integr...
Zheyuan Lin, Yang Feng, Jian-Jun Chen et al.· Fall Joint Computer Conferen...· 0 citations
A PRISMA-informed structured topical review of 87 studies is presented and a strategic agenda covering leakage-resistant datasets, uncertainty-aware graph construction, repository-level evaluation, cost-effective Graph–LLM collaboration, and graph-guided autonomous vulnerability repair is developed.
Yuan He, Haikun Lv, Xingrong Li et al.· Information· 0 citations
The Heterogeneous Graph Feature Enhancer (HGFE) is proposed, an interface-preserving feature enhancement framework for downstream fault-localization models that consume feature matrices or feature vectors that consume feature matrices or feature vectors.
Wei Zheng, Ang Xu, Xin Fan et al.· Software quality journal· 0 citations
The LLM-Enhanced Component Dependency Evolution Graph (CDEG) framework is proposed, a hybrid representation that fuses structural features extracted by Tree-sitter with semantic embeddings derived from a fine-tuned LLM, effectively distinguishing backported patches from code refactoring.
Yuan-Jun Gao, Hong-Zhou Wu, Yu-Jia Luo et al.· Mathematics· 0 citations
Experimental results show that MulFetFL effectively locates 293, 295 and 298 bugs within Top-1/Top-3/Top-5 ranks, significantly outperforming state-of-the-art bug localization methods across a range of benchmark designs.
CoFiLoc first performs structured bug report denoising to extract high-value technical information, and then progressively narrows the candidate space by integrating lightweight dynamic execution evidence, stack-trace-guided structural signals, and dual semantic-lexical ranking, before applying LLM-based reasoning over...
Nham Cao, Nhut Tien Nguyen, Thanh Nguyen· International Conference on...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.