A Systematic Study of LLM-Based Architectures for Automated Patching

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Xu, Qingxiao, Sheng, Ze, Chen, Zhicheng, Huang, Jeff
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908859177631744
author Xu, Qingxiao
Sheng, Ze
Chen, Zhicheng
Huang, Jeff
author_facet Xu, Qingxiao
Sheng, Ze
Chen, Zhicheng
Huang, Jeff
contents Large language models (LLMs) have shown promise for automated patching, but their effectiveness depends strongly on how they are integrated into patching systems. While prior work explores prompting strategies and individual agent designs, the field lacks a systematic comparison of patching architectures. In this paper, we present a controlled evaluation of four LLM-based patching paradigms -- fixed workflow, single-agent system, multi-agent system, and general-purpose code agents -- using a unified benchmark and evaluation framework. We analyze patch correctness, failure modes, token usage, and execution time across real-world vulnerability tasks. Our results reveal clear architectural trade-offs: fixed workflows are efficient but brittle, single-agent systems balance flexibility and cost, and multi-agent designs improve generalization at the expense of substantially higher overhead and increased risk of reasoning drift on complex tasks. Surprisingly, general-purpose code agents achieve the strongest overall patching performance, benefiting from general-purpose tool interfaces that support effective adaptation across vulnerability types. Overall, we show that architectural design and iteration depth, rather than model capability alone, dominate the reliability and cost of LLM-based automated patching.
format Preprint
id arxiv_https___arxiv_org_abs_2603_01257
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle A Systematic Study of LLM-Based Architectures for Automated Patching
Xu, Qingxiao
Sheng, Ze
Chen, Zhicheng
Huang, Jeff
Cryptography and Security
Software Engineering
Large language models (LLMs) have shown promise for automated patching, but their effectiveness depends strongly on how they are integrated into patching systems. While prior work explores prompting strategies and individual agent designs, the field lacks a systematic comparison of patching architectures. In this paper, we present a controlled evaluation of four LLM-based patching paradigms -- fixed workflow, single-agent system, multi-agent system, and general-purpose code agents -- using a unified benchmark and evaluation framework. We analyze patch correctness, failure modes, token usage, and execution time across real-world vulnerability tasks. Our results reveal clear architectural trade-offs: fixed workflows are efficient but brittle, single-agent systems balance flexibility and cost, and multi-agent designs improve generalization at the expense of substantially higher overhead and increased risk of reasoning drift on complex tasks. Surprisingly, general-purpose code agents achieve the strongest overall patching performance, benefiting from general-purpose tool interfaces that support effective adaptation across vulnerability types. Overall, we show that architectural design and iteration depth, rather than model capability alone, dominate the reliability and cost of LLM-based automated patching.
title A Systematic Study of LLM-Based Architectures for Automated Patching
topic Cryptography and Security
Software Engineering
url https://arxiv.org/abs/2603.01257