RefactorPlatform is an open‑source harness that standardizes the evaluation of repository‑scale refactoring agents by fixing the environment and systematically varying design choices such as model backbone, execution regime, and prompt specificity. Each run operates in an isolated workspace, logs detailed telemetry, and verifies changes with AST‑based checks. Experiments on 100 RefactorBench tasks show that AST‑aware chunking improves performance by 25‑30%, a lean retrieval‑augmented single agent outperforms a sub‑agent configuration, and retrieval’s accuracy gains offset its token overhead, keeping cost per successful refactoring unchanged.
By Aziz Ben Amor, Drish Mali, Mann Acharya, Vijayasri Iyer, S\'ebastien Brati\`eres
REFINE is a tool-agnostic, evidence-aware multi-agent approach that generates Java file-level refactoring candidates by combining static analysis, smell-informed planning, LLM-based transformation, and automated re-analysis. In experiments on 450 Java files from 15 open-source systems, REFINE reduced detected code smells by 68–73% across three LLM configurations, achieving higher median reductions with smaller edits compared to a direct-prompt baseline. However, the tool’s outputs still pose risks such as assert/fail-call changes and public-method removal, requiring compilation, testing, dependency analysis, and human review before deployment.
By Muhammad Waseem, Aakash Ahmad, Pekka Abrahamsson
arXiv:2606. 03743v1 Announce Type: new Abstract: While Large Language Models (LLMs) have shown strong performance in generating formal proofs, their outputs often remain less readable, modular, maintainable, and reusable than proofs in mature formal mathematics libraries.
By Yiming Fu, Peixuan Liu, Zichen Wang, Kun yuan
arXiv:2607. 17352v1 Announce Type: new Abstract: Designing effective Lean proof agents is a central challenge in formal mathematical reasoning.
By Yuqing Li, Zeguan Wu, Yu Gan, Junyu Liu
The paper introduces a compiler-guided adaptive proof search framework for Lean 4 theorem proving, addressing the challenge of context-dependent proofs in real-world projects. It balances exploration and exploitation by generating diverse starting points via dual-model generation and resampling when stagnation occurs, while refining promising states using compiler-grounded pairwise comparison. Experiments on seven Lean 4 projects from miniCTX‑v2 demonstrate that the method improves average pass rates by 12.8 percentage points within a pass@32 budget and reduces LLM calls by 21.9 % compared to pass@k baselines.
By Zhuo Liu, Ding Yu, Hangfeng He
arXiv:2605.22875v2 Announce Type: replace
Abstract: Long-horizon mathematical reasoning fails less often because a model cannot produce a valid next step than because an agent fails to maintain and e...
By Zelin Zhao, Bo Yuan, Yuchen Zhu, Jaemoo Choi, Yongxin Chen