CascadeFix: Multi-Location Program Repair via Cascading Planning and Generation (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for automating program repair face insufficient bug dependency modeling and inadequate global repair planning when addressing semantically complex multi-location bugs. |
| Approach: | They propose a multi-location automatic repair method via cascading planning and generation . they propose to model dependencies among bugs and cluster them to ensure rationality . |
| Outcome: | The proposed method resolves 84 multi-location bugs, achieving a 31% improvement over current methods. |
Similar Papers
SynFix: Dependency-Aware Program Repair via RelationGraph Analysis (2025.findings-acl)
Copied to clipboard
Xunzhu Tang, Jiechao Gao, Jin Xu, Tiezhu Sun, Yewei Song, Saad Ezzini, Wendkûuni C. Ouédraogo, Jacques Klein, Tegawendé F. Bissyandé
| Challenge: | Existing methods for resolving repository-level debugging are limited by their interdependencies. |
| Approach: | They propose a RelationGraph-based approach that integrates large language models with structural search and synchronization techniques for coordinated program repair across codebases. |
| Outcome: | SynFix resolves 52.33% of issues in SWE-bench-lite, 55.8% in Swe-bech-verified and 29.86% in S WE-beach-full. |
Grammar-Based Patches Generation for Automated Program Repair (2021.findings-acl)
Copied to clipboard
| Challenge: | Automated program repair (APR) aims to find an automatic solution to program language bugs without human intervention. |
| Approach: | They propose a grammar-based rule-rule model which regards the repair process as the transformation of grammar rules and employs a tree-based self-attention approach to guarantee grammar correctness. |
| Outcome: | The proposed model outperforms the state-of-the-art models on a Java dataset in terms of generated code accuracy. |
RePair: Automated Program Repair with Process-based Feedback (2024.findings-acl)
Copied to clipboard
| Challenge: | Commercial-scale language models (LMs) have taken APR to unprecedented levels, but they are limited by parameters and humans interact with them through explicit prompts. |
| Approach: | They propose a method that utilizes process supervision to improve program repair by allowing users to input feedback from compilers and test cases. |
| Outcome: | The proposed method outperforms large outcome-based generation methods and is inspired by strategies used in programming competitions. |
Jointly Learning to Repair Code and Generate Commit Message (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing work performs code repair and commit message generation independently. |
| Approach: | They propose a cascaded method to repair program codes and generate commit messages in a unified framework. |
| Outcome: | The proposed model significantly outperforms baselines on a buggy-fixed-commit dataset. |
Code Reffix: A Benchmark for Reflection-Guided Code Repair with Large Language Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing benchmarks focus on the repair generation capability of LLMs, lacking fine-grained evaluation of reflection. |
| Approach: | They propose a benchmark with oracle reflections and a dual-task protocol to decouple evaluation of reflection from repair. |
| Outcome: | The proposed benchmarks show that underperforming reflection capabilities remain a bottleneck for code repair. |
Towards Low-Resource Automatic Program Repair with Meta-Learning and Pretrained Language Models (2023.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances in deep learning (DL) based APR models have demonstrated promising results by learning from large-scale bug-fix examples in a data-driven manner. |
| Approach: | They propose a meta-learning framework integrated with code pretrained language models to generate fixes for low-resource bugs with limited training samples. |
| Outcome: | The proposed framework learns better error-specific knowledge from high-resource bugs through efficient first-order meta-learning optimization, which allows for a faster adaptation to the target low-resourced bugs. |
MultiFix: Learning to Repair Multiple Errors by Optimal Alignment Learning (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches fix a single error in a line, but it is inevitable to iterate until no errors remain. |
| Approach: | They propose a sequence-to-sequence learning framework for fixing multiple program errors at once . they pare an erroneous program with an optimal alignment to the correct program . |
| Outcome: | The proposed approach achieves state-of-the-art on a dataset of 6,975 erroneous C programs . the proposed framework is based on an edit-distance-based data labeling approach . |
SynthFix: Adaptive Neuro-Symbolic Code Vulnerability Repair (2026.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) struggle with complex semantic and structural correctness required for automated code repair. |
| Approach: | They propose a hybrid neural-symbolic framework that unifies code synthesis with compiler-informed symbolic feedback to improve LLM-based vulnerability repair. |
| Outcome: | The proposed framework improves code repair accuracy and efficiency over strong SFT and RFT training strategies on the FixJS and CodeFlaws benchmarks. |
Fix-Filter-Fix: Intuitively Connect Any Models for Effective Bug Fixing (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches for bug fixing lack generality and use only textual or structured information. |
| Approach: | They propose an intuitive yet effective general framework called Fix-Filter-Fix for bug fixing that connects models with their filter mechanism to filter out the last model’s unchanged fix to the next. |
| Outcome: | The proposed framework can quantify and accurately calculate the lifting effect of the model. |
Programming over Thinking: Efficient and Robust Multi-Constraint Planning (2026.acl-long)
Copied to clipboard
| Challenge: | Existing large language model approaches lack flexibility in multi-constraint planning . SCOPE achieves state-of-the-art performance while lowering cost and latency . |
| Approach: | They propose a framework that disentangles query-specific problem reasoning from generic code execution. |
| Outcome: | The Scalable Code Planning Engine achieves state-of-the-art performance while lowering cost and latency. |