Vehicle:神经网络验证器与交互式定理证明器的接口
Vehicle: Interfacing Neural Network Verifiers with Interactive Theorem Provers
摘要:
神经网络的验证是当前自动定理证明中的一个热点问题。进展非常迅速,现在有各种各样的工具可以验证具有数十万个节点的网络的属性。从理论上讲,这为验证使用神经网络组件的大型控制系统打开了大门。然而,虽然工作已经成功地将这些验证的结果,以证明个别系统的更大的属性,目前还没有通用的方法来弥合验证和交互式定理证明(ITP)之间的差距。在本文中,我们提出了车辆,我们的解决方案,这个问题。车辆配备了一个表达领域特定的语言,用于说明神经网络规范,可以编译为验证器和ITP。它通过使用标准ONNX文件作为网络的单一规范表示,克服了以前类似ITP形式化中的可维护性和可扩展性问题。我们证明了它的实用性,使用它连接神经网络验证器Marabou到Agda,然后正式验证由神经网络驾驶的汽车永远不会离开道路,即使面对不可预测的侧风和不完美的传感器。该网络具有超过20,000个节点,因此该证明比关于ITP中的神经网络增强系统的先前证明提高了3个数量级。
英文摘要:
Verification of neural networks is currently a hot topic in automated theorem proving. Progress has been rapid and there are now a wide range of tools available that can verify properties of networks with hundreds of thousands of nodes. In theory this opens the door to the verification of larger control systems that make use of neural network components. However, although work has managed to incorporate the results of these verifiers to prove larger properties of individual systems, there is currently no general methodology for bridging the gap between verifiers and interactive theorem provers (ITPs). In this paper we present Vehicle, our solution to this problem. Vehicle is equipped with an expressive domain specific language for stating neural network specifications which can be compiled to both verifiers and ITPs. It overcomes previous issues with maintainability and scalability in similar ITP formalisations by using a standard ONNX file as the single canonical representation of the network. We demonstrate its utility by using it to connect the neural network verifier Marabou to Agda and then formally verifying that a car steered by a neural network never leaves the road, even in the face of an unpredictable cross wind and imperfect sensors. The network has over 20,000 nodes, and therefore this proof represents an improvement of 3 orders of magnitude over prior proofs about neural network enhanced systems in ITPs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。