SearcharxivSearch

arXiv subjects

Shijian Wu

Publications and source records attributed to Shijian Wu.

2 recordsLinked to original sources

A Multi-Agent Framework for Automated Exploit Generation with Constraint-Guided Comprehension and Reflection

Open-source libraries are widely used in modern software development, introducing significant security vulnerabilities. While static analysis tools can identify potential vulnerabilities at scale, they often generate overwhelming reports with high false positive rates. Automated Exploit Generation (AEG) emerges as a promising solution to confirm vulnerability authenticity by generating an exploit. However, traditional AEG approaches based on fuzzing or symbolic execution face path coverage and constraint-solving problems. Although LLMs show great potential for AEG, how to effectively leverage them to comprehend vulnerabilities and generate corresponding exploits is still an open question. To address these challenges, we propose Vulnsage, a multi-agent framework for AEG. Vulnsage simulates human security researchers' workflows by decomposing the complex AEG process into multiple specialized sub-agents: Code Analyzer Agent, Code Generation Agent, Validation Agent, and a set of Reflection Agents, orchestrated by a central supervisor through iterative cycles. Given a target program, the Code Analyzer Agent performs static analysis to identify potential vulnerabilities and collects relevant information for each one. The Code Generation Agent then utilizes an LLM to generate candidate exploits. The Validation Agent and Reflection Agents form a feedback-driven self-refinement loop that uses execution traces and runtime error analysis to either improve the exploit iteratively or reason about the false positive alert. Experimental evaluation demonstrates that Vulnsage succeeds in generating 34.64\% more exploits than state-of-the-art tools such as \explodejs. Furthermore, Vulnsage has successfully discovered and verified 146 zero-day vulnerabilities in real-world scenarios, demonstrating its practical effectiveness for assisting security assessment in software supply chains.

cs.SE

Admissible solutions of delay Schwarzian differential equations

In this paper, we study delay differential equations involving the Schwarzian derivative $S(f,z)$, expressed in the form \begin{equation*} f(z+1)f(z-1) + a(z)S(f,z) =R(z,f(z))= \frac{P(z,f(z))}{Q(z,f(z))} \end{equation*} where $a(z)$ is rational, $P(z,f)$ and $Q(z,f)$ are coprime polynomials in $f$ with rational coefficients. Our main result shows that if a subnormal transcendental meromorphic solution exists, then the rational function $R(z,f)=P(z,f)/Q(z,f)$ satisfies $°_fR\leq 7$ and $°_fP\leq °_fQ +2$, where $°_fR =\max\{°_fP, °_fQ\}.$ Furthermore, for any rational root $b_1$ of $Q(z,f)$ in $f$ with multiplicity $k$, we show that $k \leq 2$. Finally, a classification of such equations is provided according to the multiplicity structure of the roots of $Q(z,f)$. Some examples are given to support these results.

math.CV