2018· International Journal of Applied Data Science & Modern Computing· Vol 1, pp. 01-17· 0 citations
TL;DR
An explainable fault localization framework that combines program analysis, runtime tracing, and interpretable machine learning techniques to identify, rank, and justify the root causes of failures in neural-augmented codebases is proposed.
Abstract
Modern software development increasingly integrates neural models such as code completion engines, automated refactoring systems, and learned optimization modules into traditional codebases, creating hybrid environments commonly referred to as neural-augmented codebases. While these systems achieve significant productivity gains, debugging them presents unique challenges due to the opaque reasoning processes of neural components. Conventional fault localization techniques are insufficient, as they cannot effectively attribute errors originating from model-generated code, neural decision boundaries, or interactions between learned and symbolic components. This paper proposes an explainable fault localization framework that combines program analysis, runtime tracing, and interpretable machine learning techniques to identify, rank, and justify the root causes of failures in neural-augmented codebases. By integrating explainability mechanisms such as attention heatmaps, causal dependency graphs, and interpretable embeddings, the framework enhances developer trust, reduces debugging cost, and provides actionable diagnostic insights. Experimental evaluation on real-world hybrid systems demonstrates improved fault detection accuracy, reduced false positives, and higher interpretability scores compared to state-of-the-art approaches. The results show that explainability is not merely an auxiliary feature, but a critical enabler of scalable, safe adoption of neural components in modern software engineering workflows.
The findings suggest that hidden states are a robust and informative resource for estimating functional code correctness, supporting a two-stage workflow that combines response-level risk screening with targeted line-level prioritization.
This work recasts vulnerability discovery as an input-prediction task with a closed, deterministic ground truth, and decomposes discovery into three task modes over 22 real-world C/C++ programs spanning 15 domains, finding constraint inference, not navigation, is the dominant bottleneck.
Yuan-Xiang Shi, Jia-Yi Lin, Xuan-Yong Lin et al.· 0 citations
This work proposes tHinter, an automated approach that frames translation error localization as a differential testing task, and integrates mixed-factorial user studies, expert validation, and SWOT-based strategic analysis to assess the perceived helpfulness and resilience within the rapidly evolving LLM landscape.
Shengnan Wu, Xin-Yu Sun, Xin Wang et al.· ACM Transactions on Software...· 0 citations
This article presents SEMA-GUARD, a framework that uses semantic analysis and graph neural networks to identify flaws in assembly code, and results imply that including semantic information in graph-based models may be a successful method for identifying vulnerabilities in compiled code.
Goanna is introduced, a novel type checker for Haskell that focuses on improving error diagnostics, and shows performance constraints when diagnosing large programs containing complex errors, but remains responsive enough to provide real-time debugging assistance for small to medium-sized programs.
Shuai Fu, Tim Dwyer, Peter James Stuckey et al.· International Conference on...· 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.