Tag
A position paper proposing Warranted Reuse Claims (WRC) and Warrant-Preserving Evidence Transport (WPET) as a formal framework for deciding which historical evidence remains admissible for reusing LLM-agent skills as contexts change. It contributes a formalized problem statement, design obligations, and a reporting protocol rather than an implemented verifier.
A paper on using lightweight formal methods (reference models, property-based testing, stateless model checking) to validate the distributed metadata index of Amazon S3 Express One Zone, showing the approach scales sustainably to production engineering.
Five national income tax codes (US, France, UK, Germany, Japan) were encoded as open-source Lean programs and audited against official government software and tables, uncovering live errors in irs.gov, French tax calculators, GOV.UK/HMRC tools, the US Code, and OECD data, plus newly discovered tax loopholes.
The paper introduces BernBRS, a scalable framework for certified backward reachability analysis of DeepBernNets, computing certified inner and outer approximations of the Backward Reachable Set via activation-pattern-based refinement of the input space cover, demonstrated on Half-Cheetah and TinyBERT-derived models.
The paper bridges closest-world counterfactual semantics and feature-based formal XAI by introducing conjunctive counterfactual explanations (CFXps), establishing structural links to abductive (AXps) and contrastive (CXps) explanations, and showing efficient computation on tree ensembles and neural networks.
Tom 7's noperts repository presents formalized results on non-Rupert polyhedra, including a Lean-verified 7-vertex "Septopert" — the smallest possible Nopert — plus proofs that every convex polyhedron with six or fewer vertices is Rupert, completing the classification of Platonic/Archimedean/Catalan solids.
A reflective essay marking 100 years since Hilbert's program, tracing how Gödel's incompleteness and Turing's halting problem defeated it, and arguing that AI agents powered by proof assistants like Lean now realize Hilbert's 'proof machine' with profound consequences for mathematics and computer science.
作者提出一个基于模板/表单模式的中介器架构,将不可信用户输入限制在带校验的类型化表单内,从而把 prompt injection 与具备副作用的行动智能体隔离,并给出了形式化模型与安全性质。
Lean4AgenticRL 提出了首个基于 Lean4 形式化框架的多层级过程奖励方法,用于开放式 agentic RL 训练,并训练出 LAR-9B/27B 模型,其中 LAR-27B 在 TerminalBench-2.1 上达到 77.3%,显著超越同规模领先模型。
该论文提出 DRAGO 框架,用确定性的形式化诊断替代无依据的 LLM 批评来修复 LLM 生成的形式化规范,在五个基准上将规范回归率从 11.8% 降至 1.3%,并显著提升答案准确率。
FRACTAL 提出一种自相似的多智能体编排架构,通过递归目标分解在每层复用五组件结构,并给出通信复杂度、收敛保证与分解深度的形式化界限。
该论文提出一种层次化反馈引导的LLM规划框架,将自然语言指令转换为多组件信息物理系统(CPS)的可执行任务计划与STL约束,并通过诊断反馈修正不一致,GPT-5在七个场景上达到87.9%的成功率。
ASMC 是一个将 Ghidra 的 p-code 汇编语义提升到 CBMC GOTO IR 的开源工具,用于对 x86-64 汇编进行有界模型检查,支持汇编验证、翻译验证与 C 级规格断言等多种用途。
HOL Light Tutorial 提供了一套循序渐进的快速入门指南,通过分级示例帮助用户快速上手 HOL Light 定理证明器,涵盖安装、OCaml 基础、项与类型、命题逻辑、重写与战术等核心内容。
提出一种以程序验证器为奖励信号的智能体强化学习框架,通过读取验证器诊断信息(而非二元判决)并加入完整性审计,显著提升Qwen3系列模型在DafnyBench和SWE-Proof等验证基准上的正确率(最高达100%)。
Terence Tao presents "Math 2.0" slides from a Caltech 2026 talk, discussing how AI and formal methods are set to transform mathematical research and proving.
A practitioner reports 1,680 paired A/B trials showing that classic Unix and CS formalisms (Circuit Breaker FSM, SysV init-d runlevels, git bisect, Design-by-Contract, 2PC+WAL, EBNF) dramatically outperform verbose English prompt rules for LLM agent reliability, arguing that prompting is essentially static symbol linkage on high-frequency training-corpus constructs.
该论文提出 BRaVeS(DNRS)框架,通过不变锚点、深度感知注意力与 Lyapunov 共识机制约束智能体推理的自主性,防止认知漂移,并在工业控制仿真中验证了有限步收敛与零安全违规。
Law&Order is a neuro-symbolic framework that combines LLM synthesis with cell-level symbolic verification and iterative error repair to automatically formalize tax forms into executable programs, achieving 100% accuracy on 51 held-out TaxCalcBench returns compared to 66% for the best LLM alone.
The paper introduces a simple doxastic deontic logic combining Chellas' Minimal Deontic Logic with multi-agent KD45 to handle norm-guided decision making under conflicting norms and unreliable beliefs, defining the Doxastic Norm Compliance Optimization Problem and showing when it reduces to weighted partial MaxSAT in polynomial time.