TY - GEN
T1 - Vehicle
T2 - 10th International Conference on Formal Structures for Computation and Deduction 2025
AU - Daggitt, Matthew L.
AU - Kokke, Wen
AU - Atkey, Robert
AU - Komendantskaya, Ekaterina
AU - Slusarz, Natalia
AU - Arnaboldi, Luca
N1 - Publisher Copyright:
© Matthew L. Daggitt, Wen Kokke, Robert Atkey, Ekaterina Komendantskaya, Natalia Slusarz, and Luca Arnaboldi;
PY - 2025/7/7
Y1 - 2025/7/7
N2 - Neuro-symbolic programs, i.e. programs containing both machine learning components and traditional symbolic code, are becoming increasingly widespread. Finding a general methodology for verifying such programs is challenging due to both the number of different tools involved and the intricate interface between the “neural” and “symbolic” program components. In this paper we present a general decomposition of the neuro-symbolic verification problem into parts, and examine the problem of the embedding gap that occurs when one tries to combine proofs about the neural and symbolic components. To address this problem we then introduce Vehicle-standing as an abbreviation for a “verification condition language” - an intermediate programming language interface between machine learning frameworks, automated theorem provers, and dependently-typed formalisations of neuro-symbolic programs. Vehicle allows users to specify the properties of the neural components of neuro-symbolic programs once, and then safely compile the specification to each interface using a tailored typing and compilation procedure. We give a high-level overview of Vehicle's overall design, its interfaces and compilation & type-checking procedures, and then demonstrate its utility by formally verifying the safety of a simple autonomous car controlled by a neural network, operating in a stochastic environment with imperfect information.
AB - Neuro-symbolic programs, i.e. programs containing both machine learning components and traditional symbolic code, are becoming increasingly widespread. Finding a general methodology for verifying such programs is challenging due to both the number of different tools involved and the intricate interface between the “neural” and “symbolic” program components. In this paper we present a general decomposition of the neuro-symbolic verification problem into parts, and examine the problem of the embedding gap that occurs when one tries to combine proofs about the neural and symbolic components. To address this problem we then introduce Vehicle-standing as an abbreviation for a “verification condition language” - an intermediate programming language interface between machine learning frameworks, automated theorem provers, and dependently-typed formalisations of neuro-symbolic programs. Vehicle allows users to specify the properties of the neural components of neuro-symbolic programs once, and then safely compile the specification to each interface using a tailored typing and compilation procedure. We give a high-level overview of Vehicle's overall design, its interfaces and compilation & type-checking procedures, and then demonstrate its utility by formally verifying the safety of a simple autonomous car controlled by a neural network, operating in a stochastic environment with imperfect information.
KW - Interactive Theorem Provers
KW - Neural Network Verification
KW - Types
UR - https://www.scopus.com/pages/publications/105010700073
U2 - 10.4230/LIPIcs.FSCD.2025.2
DO - 10.4230/LIPIcs.FSCD.2025.2
M3 - Conference contribution
AN - SCOPUS:105010700073
T3 - Leibniz International Proceedings in Informatics
BT - 10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025)
A2 - Fernandez, Maribel
PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Y2 - 14 July 2025 through 20 July 2025
ER -