SearcharxivSearch

arXiv subjects

Zijun Feng

Publications and source records attributed to Zijun Feng.

3 recordsLinked to original sources

GoAT-X: A Graph of Auditing Thoughts for Securing Token Transactions in Cross-Chain Contracts

Cross-chain bridges, the critical infrastructure of the multi-chain ecosystem, have become a primary target for attackers, resulting in over $2.8 billion in losses due to subtle implementation flaws. Existing defenses, such as bytecode-level static analysis, are ill-equipped to handle the semantic complexity of cross-chain interactions, while LLM-based approaches, which can understand source code, struggle with hallucinatory reasoning over complex, multi-contract dependencies. In this paper, we propose GoAT-X, a framework that shifts automated cross-chain smart contract codebases auditing from heuristic pattern matching toward systematic first-principles verification. GoAT-X structures the audit process as a Graph of Auditing Thoughts, explicitly mirroring how human experts decompose, reason about, and validate security logic. By anchoring LLM reasoning in statically extracted data flows and explicitly linking abstract security properties to concrete code implementations, the framework constrains semantic reasoning within well-defined structural and state boundaries. Within this constrained space, GoAT-X treats missing constraints and adversarial bypass paths in cross-chain logic as first-class vulnerability targets and dynamically explores reasoning paths to identify exploitable semantic gaps. We evaluate GoAT-X on a comprehensive benchmark covering all known cross-chain token transaction attacks. GoAT-X achieves 92% recall on fine-grained audit points and 95% coverage of vulnerable projects, while identifying 117 confirmed risks in the wild with low operational cost, establishing a new standard for scalable, logic-driven cross-chain security.

cs.CR

Stabilization with Closed-loop DOA Enlargement: An Interval Analysis Approach

In this paper, the stabilization problem with closed-loop domain of attraction (DOA) enlargement for discrete-time general nonlinear plants is solved. First, a sufficient condition for asymptotic stabilization and estimation of the closed-loop DOA is given. It shows that, for a given Lyapunov function, the negative-definite and invariant set in the state-control space is a stabilizing controller set and its projection along the control space to the state space can be an estimate of the closed-loop DOA. Then, an algorithm is proposed to approximate the negative-definite and invariant set for the given Lyapunov function, in which an interval analysis algorithm is used to find an inner approximation of sets as precise as desired. Finally, a solvable optimization problem is formulated to enlarge the estimate of the closed-loop DOA by selecting an appropriate Lyapunov function from a positive-definite function set. The proposed method try to find a unstructured controller set (namely, the negative-definite and invariant set) in the state-control space rather than design parameters of a structured controller in traditional synthesis methods.

eess.SY

Interval-driven discrete-time general nonlinear robust control: stabilization with closed-loop robust DOA enlargement

This paper presents new results that allow one to address the discrete-time general nonlinear robust control problem. The uncertain system is described by a general nonlinear function set characterized by the nominal model and the corresponding modeling error bound. Traditional synthesis methods design parameters of a structured robust controller. The key aim of this paper is to find an unstructured robust controller set in the state-control space, which enlarges the estimate of the closed-loop robust domain of attraction (RDOA). Based on the interval analysis arithmetic, a numerical method to estimate the unstructured robust controller set is proposed and the rigorous convergence analysis is given. The existing RDOA results are constrained by the level-set of the Lyapunov function, whereas the results in this paper remove this limitation. Furthermore, a solvable optimization problem is formulated so the estimate of RDOA is enlarged by selecting a Lyapunov function from a Lyapunov function set of sum-of-squares polynomials. The method is then validated by a specific case simulation study and results show more extensive RDOA than the previous methods.

math.OC