用组合式验证框架提升智能系统的可靠性保障能力
ScenicProver: A Framework for Compositional Probabilistic Verification of Learning-Enabled Systems
- 基于概率编程语言构建可组合系统描述,支持黑箱与可解释组件并存
- 通过合约机制整合测试、形式证明等多类证据,在相同算力下获得更强概率保证
- 适合自动驾驶等复杂智能系统的安全验证,尤其适用于有外部组件保证的场景
学习型网络物理系统(CPS)的完整验证长期面临挑战,主要源于黑箱组件和复杂现实环境。现有工具要么仅适用于特定类型系统,要么将系统作为整体进行测试,缺乏在复杂现实环境中对学习型CPS进行组合式分析的通用框架。本文提出ScenicProver,基于概率编程语言Scenic,支持:(1) 通过清晰接口描述系统组件,涵盖可解释代码到黑箱;(2) 使用扩展线性时序逻辑(含任意Scenic表达式)定义组件间的假设-保证合约;(3) 通过测试生成证据,集成Lean 4进行形式化证明,或导入外部假设;(4) 系统性结合生成证据,使用合约运算符;(5) 自动生成可追溯系统级保证案例。通过自动驾驶自动紧急制动系统(融合雷达与激光传感器)的案例研究验证了有效性。利用传感器厂商提供的保证,并聚焦于不确定性条件下的测试,本方法在相同计算预算下,比整体测试获得更优的概率保证。
原文摘要 · Abstract (English)
Full verification of learning-enabled cyber-physical systems (CPS) has long been intractable due to challenges including black-box components and complex real-world environments. Existing tools either provide formal guarantees for limited types of systems or test the system as a monolith, but no general framework exists for compositional analysis of learning-enabled CPS using varied verification techniques over complex real-world environments. This paper introduces ScenicProver, a verification framework that aims to fill this gap. Built upon the Scenic probabilistic programming language, the framework supports: (1) compositional system description with clear component interfaces, ranging from interpretable code to black boxes; (2) assume-guarantee contracts over those components using an extension of Linear Temporal Logic containing arbitrary Scenic expressions; (3) evidence generation through testing, formal proofs via Lean 4 integration, and importing external assumptions; (4) systematic combination of generated evidence using contract operators; and (5) automatic generation of assurance cases tracking the provenance of system-level guarantees. We demonstrate the framework's effectiveness through a case study on an autonomous vehicle's automatic emergency braking system with sensor fusion. By leveraging manufacturer guarantees for radar and laser sensors and focusing testing efforts on uncertain conditions, our approach enables stronger probabilistic guarantees than monolithic testing with the same computational budget.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。