用神经网络把难懂的验证证书翻译成自然语言,又快又准。
Cycle-Consistent Neural Explanation of Formal Verification Certificates
- 双向神经网络+符号验证器,确保解释和证书互相匹配。
- 90%解释正确率,比多大模型组合快860倍,还支持离线使用。
- 适合需要可解释性验证结果的金融合规、安全系统等场景。
形式化验证生成机器可检查的证书,证明时序性质是否满足或违反,但对非专业人员仍不透明。本文提出一种循环一致的神经架构,将验证证书转换为忠实的自然语言解释。前向网络NN1将证书映射为解释,逆向网络NN2从解释重建证书,符号验证器闭环提供可微分的忠实度代理。指针生成机制通过直接复制证书中的状态名实现词汇锚定。在420个测试证书上评估,涵盖六种验证方法(有界证明、k-归纳、归纳不变式、环形路径、可达性、见证对)及正反两种结论,数据来自包含207个命名状态的金融合规领域。训练后的架构结合混合推理路由策略,在12个类别中胜出10个,其中3个达到100%保真度,整体循环验证保真度达90.0%,优于多大模型少样本基线(最佳组合76.1%)13.9个百分点。该模型推理速度达每证书185毫秒,较全量多模型基线(160秒)快860倍,支持离线运行、确定性输出且无单次推理成本。结果表明,针对结构化证书解释的专用模型性能显著优于通用大模型提示,同时规避了云端推理的部署限制。
原文摘要 · Abstract (English)
Formal verification produces machine-checkable certificates that attest to the satisfaction or violation of temporal properties, yet these certificates remain opaque to non-specialist stakeholders. We propose a cycle-consistent neural architecture that generates faithful natural language explanations of verification certificates. A forward network NN1 maps certificates to explanations, and an inverse network NN2 reconstructs certificates from explanations; a symbolic verifier closes the loop, providing a differentiable faithfulness proxy. A pointer-generator mechanism ensures lexical grounding by copying state names directly from the certificate. We evaluate on 420 test certificates spanning six verification methods (bounded proof, k-induction, inductive invariant, lasso, reachability, witness pair) in both YES and NO verdict variants, drawn from a financial compliance domain with 207 named states. Our trained architecture, combined with a hybrid inference-time routing strategy, achieves 90.0% cycle-verified soundness, surpassing a multi- LLM few-shot baseline (76.1% for the best of 16 LLM combinations across four frontier models) by 13.9 percentage points. The neural model wins on 10 of 12 verdict/kind categories, with three categories reaching 100% soundness. The architecture offers 860x faster inference (185 ms vs. 160 s per certificate for the full multi-LLM baseline), offline operation, deterministic outputs, and zero per-inference cost. These results demonstrate that trained specialization outperforms general-purpose LLM prompting for structured certificate explanation, while eliminating the deployment constraints of cloud-based inference.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。