Search

In recent years, defect prediction techniques based on deep learning have become a prominent research topic in the field of software engineering. These techniques can identify potential defects without executing the code. However, existing approaches mostly concentrate on determining the presence of defects at the method-level code, lacking the ability to precisely classify specific defect categories. Consequently, this undermines the efficiency of developers in locating and rectifying defects. Furthermore, in practical software development, new projects often lack sufficient defect data to train high-accuracy deep learning models. Models trained on historical data from existing projects frequently struggle to achieve satisfactory generalization performance on new projects. Hence, this paper initially reformulates the traditional binary defect prediction task into a multi-label classification problem, employing defect categories described in the Common Weakness Enumeration (CWE) as fine-grained predictive labels. To enhance the model performance in cross-project scenarios, this paper proposes a multi-source domain adaptation framework that integrates adversarial training and attention mechanisms. Specifically, the proposed framework employs adversarial training to mitigate domain (i.e., software projects) discrepancies, and further utilizes domain-invariant features to capture feature correlations between each source domain and the target domain. Simultaneously, the proposed framework employs a weighted maximum mean discrepancy as an attention mechanism to minimize the representation distance between source and target domain features, facilitating model in learning more domain-independent features. The experiments on 8 real-world open-source projects show that the proposed approach achieves significant performance improvements compared to state-of-the-art baselines., Comment: 17 pages, in Chinese language, 8 figures (Due to length constraints of the abstract field, please refer to the original PDF file for the full content of abstract.)

Bug fixing holds significant importance in software development and maintenance. Recent research has made notable progress in exploring the potential of large language models (LLMs) for automatic bug fixing. However, existing studies often overlook the collaborative nature of bug resolution, treating it as a single-stage process. To overcome this limitation, we introduce a novel stage-wise framework named STEAM in this paper. The objective of STEAM is to simulate the interactive behavior of multiple programmers involved in various stages across the bug's life cycle. Taking inspiration from bug management practices, we decompose the bug fixing task into four distinct stages: bug reporting, bug diagnosis, patch generation, and patch verification. These stages are performed interactively by LLMs, aiming to imitate the collaborative abilities of programmers during the resolution of software bugs. By harnessing the collective contribution, STEAM effectively enhances the bug-fixing capabilities of LLMs. We implement STEAM by employing the powerful dialogue-based LLM -- ChatGPT. Our evaluation on the widely adopted bug-fixing benchmark demonstrates that STEAM has achieved a new state-of-the-art level of bug-fixing performance., Comment: 13 pages, 8 figures

Despite their ability to aid developers in detecting potential defects early in the software development life cycle, static analysis tools often suffer from precision issues (i.e., high false positive rates of reported alarms). To improve the availability of these tools, many automated warning identification techniques have been proposed to assist developers in classifying false positive alarms. However, existing approaches mainly focus on using hand-engineered features or statement-level abstract syntax tree token sequences to represent the defective code, failing to capture semantics from the reported alarms. To overcome the limitations of traditional approaches, this paper employs deep neural networks' powerful feature extraction and representation abilities to generate code semantics from control flow graph paths for warning identification. The control flow graph abstractly represents the execution process of a given program. Thus, the generated path sequences of the control flow graph can guide the deep neural networks to learn semantic information about the potential defect more accurately. In this paper, we fine-tune the pre-trained language model to encode the path sequences and capture the semantic representations for model building. Finally, this paper conducts extensive experiments on eight open-source projects to verify the effectiveness of the proposed approach by comparing it with the state-of-the-art baselines., Comment: 17 pages, in Chinese language, 9 figures

Generating meaningful assert statements is one of the key challenges in automated test case generation, which requires understanding the intended functionality of the tested code. Recently, deep learning-based models have shown promise in improving the performance of assert statement generation. However, existing models only rely on the test prefixes along with their corresponding focal methods, yet ignore the developer-written summarization. Based on our observations, the summarization contents usually express the intended program behavior or contain parameters that will appear directly in the assert statement. Such information will help existing models address their current inability to accurately predict assert statements. This paper presents a novel summarization-guided approach for automatically generating assert statements. To derive generic representations for natural language (i.e., summarization) and programming language (i.e., test prefixes and focal methods), we leverage a pre-trained language model as the reference architecture and fine-tune it on the task of assert statement generation. To the best of our knowledge, the proposed approach makes the first attempt to leverage the summarization of focal methods as the guidance for making the generated assert statements more accurate. We demonstrate the effectiveness of our approach on two real-world datasets when compared with state-of-the-art models., Comment: Preprint, to appear in the Journal of Computer Science and Technology (JCST)

Automated program repair is a crucial task for improving the efficiency of software developers. Recently, neural-based techniques have demonstrated significant promise in generating correct patches for buggy code snippets. However, most existing approaches arbitrarily treat the buggy context without any analysis to capture the semantic relationship between the buggy statement and its context. Additionally, we observe that existing neural models may output an unaltered patch consistent with the input buggy code snippet, which fails to be the correct human-written one for fixing the given bug. To address the aforementioned limitations, we present in this paper a novel neural program repair framework called \approach, which adapts the general pre-trained language model for fixing single-line Java bugs. We make the first attempt to use program slicing to extract contextual information directly related to the given buggy statement as repair ingredients from the corresponding program dependence graph and eliminate unaltered patches using an intuitive but effective filter mechanism. We demonstrate the effectiveness of \approach on five benchmarks when compared with state-of-the-art baselines., Comment: 12 pages, 7 figures

Quantum Griffiths singularity is characterized by the divergence of the dynamical critical exponent with the activated scaling law and has been widely observed in various two-dimensional superconductors. Recently, the direct activated scaling analysis with the irrelevant correction has been proposed and successfully used to analyze the experimental data of crystalline PdTe2 and polycrystalline \b{eta}-W films, which provides new evidence of quantum Griffiths singularity. Here we show that the direct activated scaling analysis is applicable to the experimental data in different superconducting films, including tri-layer Ga films and LaAlO3/SrTiO3 interface superconductor. When taking the irrelevant correction into account, we calculate the corrected sheet resistance at ultralow temperatures. The scaling behavior of the corrected resistance in a comparably large temperature regime and the theoretical fitting of the phase boundary give unambiguous evidence of quantum Griffiths singularity. Compared to the previous method based on the finite size scaling, the direct activated scaling analysis represents a more direct and precise way to analyze the experimental data of quantum Griffiths singularity in diverse two-dimensional superconductors.

The flux quantization is a key indication of electron pairing in superconductors. For example, the well-known h/2e flux quantization is considered strong evidence for the existence of the charge-2e, two-electron Cooper pairs. Here we report evidence for multi-charge flux quantization in mesoscopic ring devices fabricated using the transition-metal kagome superconductor CsV3Sb5. We perform systematic magneto-transport measurements and observe unprecedented quantization of magnetic flux in units of h/4e and h/6e in magnetoresistance oscillations. Specifically, at low temperatures, magnetoresistance oscillations with period h/2e are detected, as expected from the flux quantization for charge-2e superconductivity. We find that the h/2e oscillations are suppressed and replaced by resistance oscillations with h/4e periodicity when temperature is increased. Increasing the temperature further suppresses the h/4e oscillations and robust resistance oscillations with h/6e periodicity emerge as evidence for charge-6e flux quantization. Our observations provide the first experimental evidence for the existence of multi-charge flux quanta and emergent quantum matter exhibiting higher-charge superconductivity in the strongly fluctuating region above the charge-2e Cooper pair condensate, revealing new insights into the intertwined and vestigial electronic order in kagome superconductors.