Searcharxiv⌕ Search

arXiv subjects

Xiaohu Yang

Publications and source records attributed to Xiaohu Yang.

At least 73 records · Page 4Linked to original sources

Detecting LLM-generated Code with Subtle Modification by Adversarial Training

With the rapid development of Large Language Models (LLMs), their powerful code-generation capabilities have been widely applied in tasks like code completion and automated development, demonstrating the value of improving coding efficiency. However, the extensive use of LLM-generated code also raises several new challenges. On the one hand, issues such as the regulation of code provenance, copyright disputes, and code quality have become increasingly concerning. How to effectively detect LLM-generated code and ensure its compliant and responsible use has become a critical and urgent issue. On the other hand, in practical applications, LLM-generated code is often subject to manual modifications, such as variable renaming or structural adjustments. Although some recent studies have proposed training-based and zero-shot methods for detecting LLM-generated code, these approaches show insufficient robustness when facing modified LLM-generated code, and there is a lack of an effective solution. To address the real-world scenario where LLM-generated code may undergo minor modifications, we propose CodeGPTSensor+, an enhanced version of CodeGPTSensor, which employs adversarial training to improve robustness against input perturbations. CodeGPTSensor+ integrates an adversarial sample generation module, Multi-objective Identifier and Structure Transformation (MIST), which systematically generates both high-quality and representative adversarial samples. This module effectively enhances the model's resistance against diverse adversarial attacks. Experimental results on the HMCorp dataset demonstrate that CodeGPTSensor+ significantly improves detection accuracy on the adversarial test set while maintaining high accuracy on the original test set, showcasing superior robustness compared to CodeGPTSensor.

cs.SE↗

Exploring the signature of assembly bias and modified gravity using small-scale clusterings of galaxies

We apply a halo velocity bias model, $γ_{f}$, within the Aemulus simulation suite for General Relativity (GR) to investigate its efficacy in identifying the signature of assembly bias and Modified Gravity (MG). In the investigation of assembly bias, utilizing galaxy clustering data ranging from scales of $0.1 - 60 \text{Mpc}\,h^{-1}$, we discover that our emulator model accurately recreates the cosmological parameters, $Ω_m$ and $σ_8$, along with the velocity bias $γ_{f}$, staying well within the 1-$σ$ error margins, provided that assembly bias is considered. Ignoring assembly bias can considerably alter our model constraints on parameters $Ω_m$ and $σ_8$ if the test sample includes assembly bias. Using our emulator for MG simulations, which encompasses two Dvali-Gabadadze-Porrati models (DGP; N1, N5) and two $f(R)$ models (F4, F6), we can effectively identify a robust signature of modified gravity, for models such as DGP-N1 and $f(R)$-F4, as indicated by a noticeable deviation of $γ_{f}$ from unity. Using the velocity dispersion of dark matter halos to effectively represent the underlying strength of the velocity field of these MG simulations, we find that the simple $γ_{f}$ model can recover the truth with minimal bias. These evaluations indicate that our simple halo-velocity bias model is capable of detecting significant MG characteristics, although additional methodologies should be pursued to improve model constraints.

astro-ph.CO↗

Re-Evaluating Code LLM Benchmarks Under Semantic Mutation

In the era of large language models (LLMs), code benchmarks have become an important research area in software engineering and are widely used by practitioners. These benchmarks evaluate the performance of LLMs on specific code-related tasks, such as code understanding and generation. A critical step in constructing code benchmarks is the design of prompts. However, as existing code benchmarks typically rely on a single prompt template per task, they are prone to the issue of prompt sensitivity, where minor prompt variations could result in substantial performance variations, leading to unreliable evaluations of model capabilities. While previous studies have explored prompt sensitivity, their experimental designs and findings are limited to traditional natural language processing (NLP) tasks. In this paper, we present an empirical study to investigate prompt sensitivity in code benchmarks. We first propose a general framework that modifies prompt templates in a manner that preserves both their semantics and their structure as much as possible. Based on the framework, we conduct extensive experiments across eight code benchmark tasks on 10 representative open-source LLMs, with each task featuring 100 semantically similar prompt templates. We then analyze the evaluation results using various statistical metrics, focusing on both absolute and relative model performance. Our findings suggest that even slight prompt variations can lead to significant shifts in performance. Additionally, we observe that such variations can introduce inconsistencies in the performance rankings across different models. These insights highlight the need for considering prompt sensitivity when designing future code benchmarks, to ensure more reliable and accurate evaluation of LLM capabilities.

cs.SE↗

Activation Approximations Can Incur Safety Vulnerabilities Even in Aligned LLMs: Comprehensive Analysis and Defense

Large Language Models (LLMs) have showcased remarkable capabilities across various domains. Accompanying the evolving capabilities and expanding deployment scenarios of LLMs, their deployment challenges escalate due to their sheer scale and the advanced yet complex activation designs prevalent in notable model series, such as Llama, Gemma, Mistral. These challenges have become particularly pronounced in resource-constrained deployment scenarios, where mitigating inference bottlenecks is imperative. Among various recent efforts, activation approximation has emerged as a promising avenue for pursuing inference efficiency, sometimes considered indispensable in applications such as private inference. Despite achieving substantial speedups with minimal impact on utility, even appearing sound and practical for real-world deployment, the safety implications of activation approximations remain unclear. In this work, we fill this critical gap in LLM safety by conducting the first systematic safety evaluation of activation approximations. Our safety vetting spans seven state-of-the-art techniques across three popular categories (activation polynomialization, activation sparsification, and activation quantization), revealing consistent safety degradation across ten safety-aligned LLMs. To overcome the hurdle of devising a unified defense accounting for diverse activation approximation methods, we perform an in-depth analysis of their shared error patterns and uncover three key findings. We propose QuadA, a novel safety enhancement method tailored to mitigate the safety compromises introduced by activation approximations. Extensive experiments and ablation studies corroborate QuadA's effectiveness in enhancing the safety capabilities of LLMs after activation approximations.

cs.CR↗

The Jiutian simulations for the CSST extra-galactic surveys

We provide an overview of the Jiutian simulations, a hybrid simulation suite for the China Space Survey Telescope (CSST) extragalactic surveys. It consists of four complementary modules: the primary runs with high resolutions with the fiducial concordance cosmology, the emulator runs exploring the parameter uncertainties around the fiducial cosmology, the reconstruction runs intended for recovering the observed Universe position by position, and the extension runs employing extended cosmologies beyond the standard model. For the primary runs, two independent pipelines are adopted to construct subhaloes and merger trees. On top of them, four sets of mock galaxy light-cone catalogs are produced from semi-analytical models and subhalo abundance matching, providing a variety of observational properties including galaxy SED, emission lines, lensing distortions, and mock images. The 129 emulator runs are used to train the CSST emulator, achieving one percent accuracy in predicting the matter power spectrum over $k\leq 10h{\rm Mpc}^{-1}$ and $z\leq 2$. The reconstruction runs employ a number of subgrid baryonic models to predict the evolution and galaxy population resembling certain regions in the real Universe with constrained initial conditions, enabling controlled investigation of galaxy formation on top of structure formation. The extension runs cover models with warm dark matter, $f(R)$ gravity, interacting dark energy, and nonzero neutrino masses, revealing differences in the cosmic structure under alternative cosmological models. We introduce the specifications for each run, the data products derived from them, the corresponding pipeline developments, and present some main tests. Using the primary runs, we also show that the subhalo peak mass functions of different levels are approximately universal. These simulations form a comprehensive and open library for CSST surveys and beyond.

astro-ph.CO↗

Gamma Analytical Modeling Evolution (GAME) I: The physical implications of deriving the stellar mass functions from z=0 to z=8

The $Γ$ growth model is an effective parameterization employed across various scientific disciplines and scales to depict growth. It has been demonstrated that the cosmic star formation rate density (CSFRD) can also be described broadly by this pattern, i.e. $\frac{dM(T)}{dT} = M_{z,0}\, \times \frac{β^α}{Γ(α)} \, T^{α-1} e^{-β\, T }$ M$_{\odot}$ Gyr$^{-1}$, where $M_{z,0}$ is the stellar mass at $z$ = 0, $α= 3.0$, $β= 0.5 $ Gyr$^{-1}$ and $T$ describes time. We use the identical $Γ$ growth pattern given by the CSFRD to extend the present day (z = 0) stellar mass bins $M_{\ast}(T)$ of the Galaxy Stellar Mass Function (GSMF) and investigate if we are able to reproduce observations for the high redshift GSMFs. Surprisingly, our scheme describes successfully the evolution of the GSMF over 13.5 Gyrs, especially for objects with intermediate and low masses. We observe some deviations that manifest {\it solely} at very high redshifts ($z > 1.5$, i.e. more than 9.5 Gyr ago) and {\it specifically} for very small and exceedingly massive objects. We discuss the possible solutions (e.g. impacts of mergers) for these offsets. Our formalism suggests that the evolution of the GSMF is set by simple (few parameters) and physically motivated arguments. The parameters $β$ and $α$ are theoretically consistent within a multi-scale context and are determined from the dynamical time scale ($β$) and the radial distribution of the accreting matter ($α$). We demonstrate that both our formalism and state-of-the-art simulations are consistent with recent GSMFs derived from JWST data at high redshifts.

astro-ph.GA↗

Luminosity and stellar mass functions of faint photometric satellites around spectroscopic central galaxies from DESI Year-1 Bright Galaxy Survey

We measure the luminosity functions (LFs) and stellar mass functions (SMFs) of photometric satellite galaxies around spectroscopically identified isolated central galaxies (ICGs). The photometric satellites are from the DESI Legacy Imaging Surveys (DR9), while the spectroscopic ICGs are selected from the DESI Year-1 BGS sample. We can measure satellite LFs down to $r$-band absolute magnitudes of $M_{r,\mathrm{sat}}\sim-7$, around ICGs as small as $7.1<\log_{10}M_{\ast,\mathrm{ICG}}/\mathrm{M_\odot}<7.8$, with the stellar mass of ICGs measured by the DESI Fastspecfit pipeline. The satellite SMF can be measured down to $\log_{10}M_{\ast,\mathrm{sat}}/\mathrm{M_\odot}\sim 5.5$. Interestingly, we discover that the faint/low-mass end slopes of satellite LFs/SMFs become steeper with the decrease in the stellar masses of host ICGs, with smaller and nearby host ICGs capable of being used to probe their fainter satellites.. The steepest slopes are $-2.298\pm0.656$ and $-$2.888$\pm$0.916 for satellite LF and SMF, respectively. Detailed comparisons are performed between the satellite LFs around ICGs selected from DESI BGS or from the SDSS NYU-VAGC spectroscopic Main galaxies over $7.1<\log_{10}M_{\ast,\mathrm{ICG}}/\mathrm{M_\odot}<11.7$, showing reasonable agreements, but we show that the differences between DESI and SDSS stellar masses for ICGs play a role to affect the results. We also compare measurements based on DESI Fastspecfit and Cigale stellar masses used to bin ICGs, with the latter including the modeling of AGN based on WISE photometry, and we find good agreements in the measured satellite LFs by using either of the DESI stellar mass catalogs.

astro-ph.GA↗

Why Does My Transaction Fail? A First Look at Failed Transactions on the Solana Blockchain

Solana is an emerging blockchain platform, recognized for its high throughput and low transaction costs, positioning it as a preferred infrastructure for Decentralized Finance (DeFi), Non-Fungible Tokens (NFTs), and other Web 3.0 applications. In the Solana ecosystem, transaction initiators submit various instructions to interact with a diverse range of Solana smart contracts, among which are decentralized exchanges (DEXs) that utilize automated market makers (AMMs), allowing users to trade cryptocurrencies directly on the blockchain without the need for intermediaries. Despite the high throughput and low transaction costs of Solana, the advantages have exposed Solana to bot spamming for financial exploitation, resulting in the prevalence of failed transactions and network congestion. Prior work on Solana has mainly focused on the evaluation of the performance of the Solana blockchain, particularly scalability and transaction throughput, as well as on the improvement of smart contract security, leaving a gap in understanding the characteristics and implications of failed transactions on Solana. To address this gap, we conducted a large-scale empirical study of failed transactions on Solana, using a curated dataset of over 1.5 billion failed transactions across more than 72 million blocks. Specifically, we first characterized the failed transactions in terms of their initiators, failure-triggering programs, and temporal patterns, and compared their block positions and transaction costs with those of successful transactions. We then categorized the failed transactions by the error messages in their error logs, and investigated how specific programs and transaction initiators are associated with these errors...

cs.SE↗

Bibliometric Analysis of Scientific Publications on Blockchain Research and Applications

Since the introduction of Bitcoin in 2008, blockchain technology has garnered widespread attention. Scholars from various research fields, countries, and institutions have published a significant number of papers on this subject. However, there is currently a lack of comprehensive analysis specifically focusing on the scientific publications in the field of blockchain. To conduct a comprehensive analysis, we compiled a corpus of 41,497 publications in blockchain research from 2008 to 2023 using the Clarivate databases. Through bibliometric and citation analyses, we gained valuable insights into the field. Our study offers an overview of the blockchain research landscape, including country, institution, authorship, and subject categories. Additionally, we identified Emerging Research Areas (ERA) using the co-citation clustering approach, examining factors such as recency, growth, and contributions from different countries/regions. Furthermore, we identified influential publications based on citation velocity and analyzed five representative Research Fronts in detail. This analysis provides a fine-grained examination of specific areas within blockchain research. Our findings contribute to understanding evolving trends, emerging applications, and potential directions for future research in the multidisciplinary field of blockchain.

cs.DL↗

Galaxy and halo properties around cosmic filaments from Sloan Digital Sky Survey Data Release 7 and the ELUCID simulation

Using galaxies from the Sloan Digital Sky Survey Data Release 7 (SDSS DR7) along with haloes from the dark matter only constrained ELUCID (Exploring the Local Universe with the reConstructed Initial Density field) simulation, we examine the properties of galaxies and haloes with respect to their distance to cosmic filaments, determined by the medial-axis thinning technique of the COsmic Web Skeleton (COWS) method. Our findings suggest that galaxies or subhaloes grow in mass as they approach these filaments. Galaxies exhibit a redder colour and diminished specific star formation rates as they approach these filaments. Additionally, older subhaloes tend to be more common near the central regions of these filaments. Elliptical galaxies are more frequently found than spiral galaxies in the central regions of the filaments. Lower-mass galaxies typically display reduced sizes in proximity to filaments, whereas higher-mass galaxies tend to exhibit increased sizes when close to filaments. Moreover, the concentration and spin of the haloes grow as they approach the filaments. These findings support the notion that the large-scale structure of the universe, characterized by cosmic web structures, plays a vital role in shaping galaxy and halo properties.

astro-ph.CO↗

Zero-Shot Cross-Domain Code Search without Fine-Tuning

Code search aims to retrieve semantically relevant code snippets for natural language queries. While pre-trained language models (PLMs) have shown remarkable performance in this task, they struggle in cross-domain scenarios, often requiring costly fine-tuning or facing performance drops in zero-shot settings. RAPID, which generates synthetic data for model fine-tuning, is currently the only effective method for zero-shot cross-domain code search. Despite its effectiveness, RAPID demands substantial computational resources for fine-tuning and needs to maintain specialized models for each domain, underscoring the need for a zero-shot, fine-tuning-free approach for cross-domain code search. The key to tackling zero-shot cross-domain code search lies in bridging the gaps among domains. In this work, we propose to break the query-code matching process of code search into two simpler tasks: query-comment matching and code-code matching. Our empirical study reveals the strong complementarity among the three matching schemas in zero-shot cross-domain settings, i.e., query-code, query-comment, and code-code matching. Based on the findings, we propose CodeBridge, a zero-shot, fine-tuning-free approach for cross-domain code search. Specifically, CodeBridge uses Large Language Models (LLMs) to generate comments and pseudo-code, then combines query-code, query-comment, and code-code matching via PLM-based similarity scoring and sampling-based fusion. Experimental results show that our approach outperforms the state-of-the-art PLM-based code search approaches, i.e., CoCoSoDa and UniXcoder, by an average of 21.4% and 24.9% in MRR, respectively, across three datasets. Our approach also yields results that are better than or comparable to those of the zero-shot cross-domain code search approach RAPID, which requires costly fine-tuning.

cs.SE↗

LLM4SZZ: Enhancing SZZ Algorithm with Context-Enhanced Assessment on Large Language Models

The SZZ algorithm is the dominant technique for identifying bug-inducing commits and serves as a foundation for many software engineering studies, such as bug prediction and static code analysis. Researchers have proposed many variants to enhance the SZZ algorithm's performance since its introduction. The majority of them rely on static techniques or heuristic assumptions, making them easy to implement, but their performance improvements are often limited. Recently, a deep learning-based SZZ algorithm has been introduced to enhance the original SZZ algorithm. However, it requires complex preprocessing and is restricted to a single programming language. Additionally, while it enhances precision, it sacrifices recall. Furthermore, most of variants overlook crucial information, such as commit messages and patch context, and are limited to bug-fixing commits involving deleted lines. The emergence of large language models (LLMs) offers an opportunity to address these drawbacks. In this study, we investigate the strengths and limitations of LLMs and propose LLM4SZZ, which employs two approaches (i.e., rank-based identification and context-enhanced identification) to handle different types of bug-fixing commits. We determine which approach to adopt based on the LLM's ability to comprehend the bug and identify whether the bug is present in a commit. The context-enhanced identification provides the LLM with more context and requires it to find the bug-inducing commit among a set of candidate commits. In rank-based identification, we ask the LLM to select buggy statements from the bug-fixing commit and rank them based on their relevance to the root cause. Experimental results show that LLM4SZZ outperforms all baselines across three datasets, improving F1-score by 6.9% to 16.0% without significantly sacrificing recall.

cs.SE↗

A widely applicable Galaxy Group finder Using Machine Learning

Galaxy groups are essential for studying the distribution of matter on a large scale in redshift surveys and for deciphering the link between galaxy traits and their associated halos. In this work, we propose a widely applicable method for identifying groups through machine learning techniques in real space taking into account the impact of redshift distortion. Our methodology involves two neural networks: one is a classification model for identifying central galaxy groups, and the other is a regression model for predicting the mass of these groups. Both models input observable galaxy traits, allowing future applicability to real survey data. Testing on simulated datasets indicates our method accurately identifies over $92\%$ of groups with $\mathrm{M}_{vir} \geq 10^{11}h^{-1}\mathrm{M}_\odot$, with $80\%$ achieving a membership completeness of at least $80\%$. The predicted group masses vary by less than 0.3 dex across different mass scales, even in the absence of a priori data. Our network adapts seamlessly to expand to sparse samples with a flux limit of $m_{r} < 14$, to high redshift samples at $z=1.08$, and to galaxy samples from the TNG300 hydrodynamical simulation without further training. Furthermore, the framework can easily adjust to real surveys by training on redshift distorted samples without needing parameter changes. Careful consideration of different observational effects in redshift space makes it promising that this method will be applicable to real galaxy surveys.

astro-ph.CO↗

Generating Mitigations for Downstream Projects to Neutralize Upstream Library Vulnerability

Third-party libraries are essential in software development as they prevent the need for developers to recreate existing functionalities. However, vulnerabilities within these libraries pose significant risks to dependent projects. Upgrading dependencies to secure versions is not feasible to neutralize vulnerabilities without patches or in projects with specific version requirements. Moreover, repairing the vulnerability proves challenging when the source code of the library is inaccessible. Both the state-of-the-art automatic vulnerability repair and automatic program repair methods fail to address this issue. Therefore, mitigating library vulnerabilities without source code and available patches is crucial for a swift response to potential security attacks. Existing tools encounter challenges concerning generalizability and functional security. In this study, we introduce LUMEN to mitigate library vulnerabilities in impacted projects. Upon disclosing a vulnerability, we retrieve existing workarounds to gather a resembling mitigation strategy. In cases where a resembling strategy is absent, we propose type-based strategies based on the vulnerability reproducing behavior and extract essential information from the vulnerability report to guide mitigation generation. Our assessment of LUMEN spans 121 impacted functions of 40 vulnerabilities, successfully mitigating 70.2% of the functions, which substantially outperforms our baseline in neutralizing vulnerabilities without functionality loss. Additionally, we conduct an ablation study to validate the rationale behind our resembling strategies and type-based strategies.

cs.SE↗

What Makes a Good TODO Comment?

Software development is a collaborative process that involves various interactions among individuals and teams. TODO comments in source code play a critical role in managing and coordinating diverse tasks during this process. However, this study finds that a large proportion of open-source project TODO comments are left unresolved or take a long time to be resolved. About 46.7\% of TODO comments in open-source repositories are of low-quality (e.g., TODOs that are ambiguous, lack information, or are useless to developers). This highlights the need for better TODO practices. In this study, we investigate four aspects regarding the quality of TODO comments in open-source projects: (1) the prevalence of low-quality TODO comments; (2) the key characteristics of high-quality TODO comments; (3) how are TODO comments of different quality managed in practice; and (4) the feasibility of automatically assessing TODO comment quality. Examining 2,863 TODO comments from Top100 GitHub Java repositories, we propose criteria to identify high-quality TODO comments and provide insights into their optimal composition. We discuss the lifecycle of TODO comments with varying quality. we construct deep learning-based methods that show promising performance in identifying the quality of TODO comments, potentially enhancing development efficiency and code quality.

cs.SE↗

Future Cosmology: New Physics and Opportunity from the China Space Station Telescope (CSST)

The China Space Station Telescope (CSST) is the next-generation Stage~IV survey telescope. It can simultaneously perform multi-band imaging and slitless spectroscopic wide- and deep-field surveys in ten years and an ultra-deep field (UDF) survey in two years, which are suitable for cosmological studies. Here we review several CSST cosmological probes, such as weak gravitational lensing, two-dimensional (2D) and three-dimensional (3D) galaxy clustering, galaxy cluster abundance, cosmic void, Type Ia supernovae (SNe Ia), and baryonic acoustic oscillations (BAO), and explore their capabilities and prospects in discovering new physics and opportunities in cosmology. We find that CSST will measure the matter distribution from small to large scales and the expansion history of the Universe with extremely high accuracy, which can provide percent-level stringent constraints on the properties of dark energy and dark matter and precisely test the theories of gravity.

astro-ph.CO↗

CSST Large Scale Structure Analysis Pipeline: III. Emission-line Redshift Measurement for Slitless Spectra

The China Space Station Telescope (CSST) is a forthcoming space-based optical telescope designed to co-orbit with the Chinese Space Station. With a planned slitless spectroscopic survey spanning a broad wavelength range of $255-1000$nm and an average spectral resolution exceeding 200, the CSST holds significant potential for cosmic large-scale structure analysis. In this study, we focus on redshift determinations from slitless spectra through emission line analysis within the CSST framework. Our tailored redshift measurement process involves identifying emission lines in one-dimensional slitless spectra, aligning observed wavelengths with their rest-frame counterparts from prominent galaxy emissions, and calculating wavelength shifts to determine redshifts accurately. To validate our redshift measurement algorithm, we leverage simulated spectra generated by the CSST emulator for slitless spectroscopy. The outcomes demonstrate a remarkable redshift completeness exceeding 95 per cent for emission line galaxies (ELGs), alongside a purity surpassing 85 per cent. The redshift uncertainty remains impressively below than $\sim 0.001$. Notably, when concentrating on galaxies with more than three matched emission lines, the completeness of ELGs and the purity of measurable galaxies can reach 98 per cent and 97 per cent, respectively. Furthermore, we explore the influence of parameters like magnitude, spectral signal-to-noise ratio, and redshift on redshift completeness and purity. The discussion also delves into redshift degeneracies stemming from emission-line matching confusion. Our developed redshift measurement process will be applied to extensive simulated datasets and forthcoming CSST slitless spectroscopic observations for further cosmological and extragalactic analyses.

astro-ph.CO↗

Vulnerability-Triggering Test Case Generation from Third-Party Libraries

Open-source third-party libraries are widely used in software development. These libraries offer substantial advantages in terms of time and resource savings. However, a significant concern arises due to the publicly disclosed vulnerabilities within these libraries. Existing automated vulnerability detection tools often suffer from false positives and fail to accurately assess the propagation of inputs capable of triggering vulnerabilities from client projects to vulnerable code in libraries. In this paper, we propose a novel approach called VULEUT (Vulnerability Exploit Unit Test Generation), which combines vulnerability exploitation reachability analysis and LLM-based unit test generation. VULEUT is designed to automatically verify the exploitability of vulnerabilities in third-party libraries commonly used in client software projects. VULEUT first analyzes the client projects to determine the reachability of vulnerability conditions. And then, it leverages the Large Language Model (LLM) to generate unit tests for vulnerability confirmation. To evaluate the effectiveness of VULEUT, we collect 32 vulnerabilities from various third-party libraries and conduct experiments on 70 real client projects. Besides, we also compare our approach with two representative tools, i.e., TRANSFER and VESTA. Our results demonstrate the effectiveness of VULEUT, with 229 out of 292 generated unit tests successfully confirming vulnerability exploitation across 70 client projects, which outperforms baselines by 24%.

cs.SE↗