解决多智能体代码协作中并发写入的准入难题
ATM: CID-Brokered Pre-Write Admission for Multi-Agent Code Co-Synthesis
- 用内容标识符经纪商实现写入意图的原子化与准入控制
- 在12个场景下验证了系统可审计且具备有限回滚能力
- 适合需要严格治理的代码协作系统开发者参考
多智能体大模型系统可将软件工程任务分解为规划、生成、验证和修复,但核心问题在于:在执行共享修改前,必须决定哪些并发写入意图可并行处理、哪些需确定性组合或串行化,哪些应直接拒绝。本文提出AI原子框架(ATM),作为单一治理域内软件代理的规范基础治理架构。ATM将任务意图、仓库范围、写入准入、验证及证据责任整合为统一治理链。内容标识符(CID)经纪商作为共享修改准入子系统,适配器引导的原子化将写入意图映射为语义原子和有界区域;当持久原子映射覆盖不完整时,虚拟原子提供临时可审计治理单元以支持保守比对与路由。受控的共享写入最终由中立托管者执行,而非提议代理。评估包含12个场景的确定性设计矩阵、3个归档运行案例、ATM-AdmissionBench、3个同文件边界案例、为期三周的外部采用者研究以及一个操作恢复路由基准。结果表明,在观测的单域设置下,系统具备可行性、可审计性与有界可恢复性,但未宣称广义比较优势或跨克隆治理能力。
原文摘要 · Abstract (English)
Multi-agent LLM systems can decompose software-engineering work into planning, generation, validation, and repair, but a narrower systems problem remains: before any governed shared mutation is applied, a system must decide which concurrently formed write intents may proceed in parallel, which require deterministic composition or serialization, and which must take a fail-closed path. We address this problem with the AI-Atomic-Framework (ATM), a specification-grounded governance substrate for software agents operating within a single governance domain. ATM binds task intent, repository scope, write admission, validation, and evidence obligations into one governance chain. A Content Identifier (CID) broker serves as the shared-mutation admission subsystem. Adapter-guided atomization maps write intents to semantic atoms and bounded regions; when persistent atom-map coverage is incomplete, virtual atoms provide temporary auditable governance units for conservative comparison and routing. Governed shared writes are ultimately applied by a neutral steward rather than directly by proposing agents. Evaluation combines controlled, field, adoption, and extension evidence, including a 12-scenario deterministic design matrix, three archived runner cases, ATM-AdmissionBench, three archived same-file boundary cases, a three-week external-adopter study, and an operational recovery-routing benchmark. The results support feasibility, auditability, and bounded recoverability within the observed single-domain settings, but do not claim broad comparative superiority or cross-clone governance.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。