Software reliability is an important part of reliability assurance for complex engineering systems, and timely fault diagnosis supports safe and continuous operation. After a test failure, statement-level fault localization ranks source-code lines for early inspection. Representation-based approaches can operate without a coverage matrix by extracting line-level hidden states from a frozen large language model for code (code LLM), but their downstream readout and training objective are not necessarily aligned with source-window ranking and buggy-version-level evaluation. We propose SeqRankFL, a sequence-aware ranker for LLM-based code representations. It combines a bidirectional long short-term memory network (BiLSTM), which follows code order within a source window, with a Hybrid objective that joins binary cross-entropy (BCE) and the listwise learning-to-rank loss ListNet. On the source-window ranking task using windows of at most 128 physical lines within known buggy files from BugsInPy and Defects4J, relative to a matched LLMAO-style Transformer+BCE reference that shares the same representations, splits, and evaluation protocol, SeqRankFL raises the equally weighted Top-1 from 51.31% to 58.58%, an absolute gain of 7.27 percentage points, with consistent improvements on both datasets. Further controlled analyses show that multi-depth layer mixing and syntax scope mainly improve average ranks, whereas control-flow/data-flow graphs and failure behavior have condition-dependent effects across models, languages, and project partitions. The controlled results identify the listwise objective as the primary driver of the Top-1 improvement, with the BiLSTM readout providing an additional architecture-dependent gain under the ranking-aware objective.
D. An, Shi-Hai Wang, Bin Liu et al.· Mathematics· 0 citations
With the in-depth advancement of hardware-software integration in smart cities and industrial systems, cybersecurity vulnerability threats have become increasingly severe. Graph Neural Network (GNN)-based vulnerability detection technologies have been widely adopted due to their efficient modeling capabilities for code semantics and structures. However, the “black-box” nature of their prediction process severely restricts their practical deployment. Existing general-purpose GNN explanation methods fail to consider the differential impacts of edge types in code graphs on vulnerability formation in vulnerability explanation scenarios, leading to disconnection from the requirements of vulnerability explanation. To address this issue, this paper proposes a vulnerability explanation method integrating learnable edge-type weights, denoted as GE4Vul. This method introduces learnable edge-type weights and L2 regularization constraints, and generates fine-grained explanations pointing to vulnerable code lines through weighted edge mask calculation and node importance ranking. Experiments on three real-world open-source project datasets (FFmpeg, ImageMagick, and radare2) demonstrate that GE4Vul achieves superior explanation accuracy compared to GNNExplainer and PGExplainer, providing targeted technical support for subsequent vulnerability cause analysis and remediation.
Yu Liu, Bin Liu, Shihai Wang et al.· 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.