arXiv AI By Yuto Tanaka, Issei Sato

Fix Initial Programs and Iteratively Refine Repair Instructions Toward Non-Elimination Multi-Turn Program Correction

Read the original on arXiv AI →

arXiv:2604. 23989v2 Announce Type: replace-cross Abstract: Recent work on large language models (LLMs) has emphasized the importance of scaling inference compute.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Sep 3

Dictionary-Guided Mutation Operators for Automated HDL Repair

The paper introduces a dictionary-guided HDL repair system that uses ANTLR-derived mutation vocabularies and a simulation-divergence fault localization module to generate syntactically valid Verilog mutations. The mutation operator performs token substitutions, insertions, and deletions via regex matching, while the fault localization scores source lines based on proximity to diverging output wires, guiding the search. Evaluated on the CirFix benchmark, the approach achieves correct repairs on 14 bug variants, including a multi-bug case, and outperforms CirFix with an 18x speedup on a two-edit benchmark.

By Maisha Mastora, Dean Sullivan
arXiv Computation and Language
2d ago

ReMCTS: Reflection-Enhanced Monte Carlo Tree Search for Code Generation

ReMCTS is a Monte Carlo Tree Search–style framework that enhances code generation by large language models (LLMs). It organizes program candidates as tree states, retains branch‑local debugging context, and retrieves failure experience across branches, distinguishing failed checks from unavailable evidence. Experiments on HumanEval and MBPP‑Sanitized show that visible‑test ReMCTS improves performance over direct generation in 8 of 10 model‑dataset pairs, while a pilot on HumanEval‑X C++ demonstrates compatibility with compiler‑backed execution.

By Huifei Wang, Xinying Huang, Yiheng Sun, Yifan Yuan