arXiv:2509. 24148v3 Announce Type: replace-cross Abstract: Test-Driven Development (TDD) is a widely adopted practice that requires developers to create and execute tests alongside implementation.
By Yiran Hu, Nan Jiang, Shanchao Liang, Yi Wu, Lin Tan
arXiv:2606. 12983v1 Announce Type: new Abstract: Automated testbench generation has become a critical bottleneck in large language model (LLM)-driven Register Transfer Level (RTL) workflows, where large numbers of candidate designs must be verified rapidly and reliably.
By En-Ming Huang, Yu-Hung Kao, Ren-Hao Deng, Wei-Po Hsin, Yao-Ting Hsieh, Cheng Liang, Hsiang-Yu Tsou, Mu-Chi Chen, Yu-Kai Hung, Shao-Chun Ho, Po-Hsuang Huang, Shih-Hao Hung, H. T. Kung
arXiv:2505. 13553v3 Announce Type: replace-cross Abstract: The hallucination of code generation models hinders their applicability to systems requiring higher safety standards.
By Jaewoo Jeong, Taesoo Kim, Sangdon Park
arXiv:2609.35841v1 Announce Type: cross
Abstract: Mutation testing evaluates test-suite adequacy by injecting synthetic faults into program code. However, traditional rule-based tools often generate...
By Nils Kiele, Zainab Saad, Zirui Wang, Steve Drew, Samira Ebrahimi Kahou
arXiv:2509.11252v3 Announce Type: replace-cross
Abstract: LLMs have become the mainstream approaches to code generation. Existing LLMs mainly employ autoregressive generation, i.e. generating code to...
By Chengze Li, Yitong Zhang, Jia Li, Liyi Cai, Ge Li
The paper introduces SWE-Flux, a repository‑level benchmark designed to test large language models’ ability to reason about runtime behavior. It contains 480 execution‑grounded instances from 12 real Python repositories, with gold answers automatically harvested from instrumented test executions. Evaluation of five LLMs shows the task remains difficult, with the best model achieving only 37% accuracy, and the benchmark can generate challenging variants through input perturbation.
By Hamed Taherkhani, Mohammad Abdollahi, Melika Sepidband, Hridya Dhulipala, Tien N. Nguyen, Hadi Hemmati
arXiv:2606. 27474v1 Announce Type: cross Abstract: How should we evaluate generation systems that combine autoregressive (AR) and diffusion decoding?
By Aditi Gupta, Neel Mishra, Kushagra Trivedi, Pawan Kumar
The paper introduces Prefix-Denoising Consistency (PDC), a test‑time self‑verification technique for Diffusion Language Models (DLMs). PDC leverages the stability of correct output trajectories by splitting a generated sentence at an intermediate point and regenerating the remainder conditioned on the fixed prefix. Experiments on mathematical and commonsense reasoning benchmarks show that PDC consistently improves initial samples, outperforms independent generations under computational constraints, and remains robust across different unmasking strategies and parameter settings.
By Yuki Ichihara, Naoto Iwase, Mohammad Atif Quamar, Junpei Komiyama
Diffusion Language Models (DLMs) have recently become increasingly competitive with autoregressive (AR) models, and even outperform them on certain tasks. Unlike AR models, DLMs produce output through...
arXiv:2607. 22880v1 Announce Type: cross Abstract: Recent advances in large language models (LLMs) have driven growing interest in using LLMs to automate test generation.
By Junda Zhao, Shurui Zhou, Eldan Cohen
The paper introduces CopyGen, a lightweight copy-constrained decoding plugin for frozen large language models that improves exact span reproduction. CopyGen decomposes copying into three decisions—when to copy, how far to copy, and when to stop—using adaptive logit adjustments during verification to emit the longest valid prefix. Across three LLM backbones and four benchmark tasks, it boosts average exact match by 35% relative without finetuning and further improves by 4% with SFT, while also accelerating generation.
By Jinghui Zhang, Lang Gao, Zongfang Liu, Ruihong Zeng, Zirui Song, Rui Yan, Kentaro Inui, Xiuying Chen
The paper introduces a training‑free structured suffix modeling technique to accelerate Diffusion Language Models (DLMs). It partitions the suffix into local, middle, and tail regions, retaining varying numbers of tokens per region and incorporating previous decoding results into current token representations. Experiments on three DLMs show significant speedups—up to 72.81× in long‑sequence inference—while often improving performance, and the method is compatible with existing acceleration strategies.
By Zifeng Cheng, Keda Li, Zhiwei Jiang, Cong Wang, Fei Shen, Qing Gu