Semantic Evolution over Populations for LLM-Guided Automated Program Repair

View PDF

Abstract:Large language models (LLMs) have recently shown strong potential for automated program repair (APR), particularly through iterative refinement that generates and improves candidate patches. However, state-of-the-art iterative refinement LLM-based APR approaches cannot fully address challenges, including maintaining useful diversity among repair hypotheses, identifying semantically related repair families, composing complementary partial fixes, exploiting structured failure information, and escaping structurally flawed search regions. In this paper, we propose a Population-Based Semantic Evolution framework for APR iterative refinement, called EvolRepair, that formulates LLM-based APR as a semantic evolutionary algorithm. EvolRepair reformulates the search paradigm of classic genetic algorithm for APR, but replaces its syntax-based operators with semantics-aware components powered by LLMs and structured execution feedback. Candidate repairs are organized into behaviorally coherent groups, enabling the algorithm to preserve diversity, reason over repair families, and synthesize stronger candidates by recombining complementary repair insights across the population. By leveraging structured failure patterns to guide search direction, EvolRepair can both refine promising repair strategies and shift toward alternative abstractions when necessary. Our experiments show that EvolRepair substantially improves repair effectiveness over existing LLM-based APR approaches.

Subjects:

Software Engineering (cs.SE)

Cite as: arXiv:2604.02134 [cs.SE]

(or arXiv:2604.02134v1 [cs.SE] for this version)

https://doi.org/10.48550/arXiv.2604.02134

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Cuong Chi Le [view email] [v1] Thu, 2 Apr 2026 15:08:58 UTC (1,231 KB)