SearcharxivSearch

arXiv subjects

Guihong Wang

Publications and source records attributed to Guihong Wang.

3 recordsLinked to original sources

VeriScale: Adversarial Test-Suite Scaling for Verifiable Code Generation

As large language models (LLMs) are increasingly deployed for software engineering, constructing high-quality benchmarks is crucial for evaluating not just the functional correctness, but also the formal verifiability of generated code. However, existing benchmarks are limited by the quantity and quality of positive and negative test cases, leading to an overestimation of model capabilities in generating specifications and implementations. To address this, we propose VeriScale, a novel framework driven by the adversarial implementations. It consists of two stages: test-suite expansion to construct diverse and challenging test cases, and test-suite reduction to distill them into compact yet discriminative suites. While VeriScale is general, we instantiate it on Verina to construct VerinaPlus, which expands the original test suites by over 83$\times$, and VerinaLite, a lightweight 14$\times$ variant. Our experiments across eight state-of-the-art LLMs demonstrate that VerinaPlus exposes substantial model weaknesses hidden by the original benchmark, evidenced by sharp score drops on both SpecGen and CodeGen tasks, whereas VerinaLite maintains this discriminative power at a fraction of the evaluation cost. The enhanced benchmarks and source code are publicly available at https://github.com/XiaoyangLiu-sjtu/VeriScale.

cs.LG

Semi-Discrete in Time Method for Time-Dependent Equations by Random Neural Basis

Neural network-based solvers for partial differential equations (PDEs) have attracted considerable attention, yet they often face challenges in accuracy and computational efficiency. In this work, we focus on time-dependent PDEs and observe that coupling space and time in a single network can increase the difficulty of approximation. To address this, we propose a semi-discrete in time method (SDTM) which leverages classical numerical time integrators and random neural basis (RNB). Additional adaptive operations are introduced to enhance the network's ability to capture features across scales to ensure uniform approximation accuracy for multi-scale PDEs. Numerical experiments demonstrate the framework's effectiveness and confirm the convergence of the temporal integrator as well as the network's approximation performance.

math.NA

Numerical Stability for Differential Equations with Memory

In this work, we systematically investigate linear multi-step methods for differential equations with memory. In particular, we focus on the numerical stability for multi-step methods. According to this investigation, we give some sufficient conditions for the stability and convergence of some common multi-step methods, and accordingly, a notion of A-stability for differential equations with memory. Finally, we carry out the computational performance of our theory through numerical examples.

math.NA