arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2512.09758cs.LO
收藏

面向语言模型引导的TLA+证明自动化

Towards Language Model Guided TLA+ Proof Automation

Northeastern University(东北大学)

Yuhao Zhou, Stavros Tripakis

AI总结:

本文提出基于语言模型的TLA+证明自动化方法,通过引导分层分解和符号证明者验证,提升证明效率并减少错误。

摘要:

形式化定理证明与TLA+提供系统规范的严格保证,但构建证明需要大量专业知识和努力。尽管大型语言模型在自动化基于战术的定理证明器(如Lean)的证明方面显示出潜力,但直接将其方法应用于TLA+面临显著挑战,因为TLA+证明系统具有分层证明结构。我们提出了一种基于提示的方法,利用LLM引导复杂证明义务的分层分解为更简单的子声明,同时依赖符号证明者进行验证。我们的关键见解是约束LLM生成标准化的声明分解而非完整的证明,显著减少了语法错误。我们还引入了一个包含119个定理的基准测试集,这些定理改编自(1)已建立的数学集合和(2)分布式协议的归纳证明。我们的方法在基准测试集上一致优于基线方法。

英文摘要:

Formal theorem proving with TLA+ provides rigorous guarantees for system specifications, but constructing proofs requires substantial expertise and effort. While large language models have shown promise in automating proofs for tactic-based theorem provers like Lean, applying these approaches directly to TLA+ faces significant challenges due to the hierarchical proof structure of the TLA+ proof system. We present a prompt-based approach that leverages LLMs to guide hierarchical decomposition of complex proof obligations into simpler sub-claims, while relying on symbolic provers for verification. Our key insight is to constrain LLMs to generate normalized claim decompositions rather than complete proofs, significantly reducing syntax errors. We also introduce a benchmark suite of 119 theorems adapted from (1) established mathematical collections and (2) inductive proofs of distributed protocols. Our approach consistently outperforms baseline methods across the benchmark suite.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑