For the formal verification of neural networks, a trained neural network is typically converted into a representation that a theorem prover can process. Since the verification results apply only to the converted network, the conversion is critical and must be trustworthy. This paper introduces the first formally verified neural network converter for a theorem prover, specifically the interactive theorem prover Coq. The verified converter contributes a reliable verification of neural networks within Coq by narrowing the gap between the execution and the verification environment of neural networks.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A Formally Verified Neural Network Converter for the Interactive Theorem Prover Coq

  • Leo Alexander Gummersbach,
  • Kim Völlinger,
  • Andrei Aleksandrov

摘要

For the formal verification of neural networks, a trained neural network is typically converted into a representation that a theorem prover can process. Since the verification results apply only to the converted network, the conversion is critical and must be trustworthy. This paper introduces the first formally verified neural network converter for a theorem prover, specifically the interactive theorem prover Coq. The verified converter contributes a reliable verification of neural networks within Coq by narrowing the gap between the execution and the verification environment of neural networks.