End-to-End Verification for Subgraph Solving

Modern subgraph-finding algorithm implementations consist of thousands of lines of highly optimized code, and this complexity raises questions about their trustworthiness. Recently, some state-of-the-art subgraph solvers have been enhanced to output machine-verifiable proofs that their results are correct. While this significantly improves reliability, it is not a fully satisfactory solution, since end-users have to trust both the proof checking algorithms and the translation of the high-level graph problem into a low-level 0-1 integer linear program (ILP) used for the proofs. In this work, we present the first formally verified toolchain capable of full end-to-end verification for subgraph solving, which closes both of these trust gaps. We have built encoder frontends for various graph problems together with a 0-1 ILP (a.k.a. pseudo-Boolean) proof checker, all implemented and formally verified in the CakeML ecosystem. This toolchain is flexible and extensible, and we use it to build verified proof checkers for both decision and optimization graph problems, namely, subgraph isomorphism, maximum clique, and maximum common (connected) induced subgraph. Our experimental evaluation shows that end-to-end formal verification is now feasible for a wide range of hard graph problems.

Authors

• Stephan Gocht Lund University, Lund, Sweden University of Copenhagen, Copenhagen, Denmark
• Ciaran McCreesh University of Glasgow, Scotland (UK)
• Magnus O. Myreen Chalmers University of Technology, Gothenburg, Sweden
• Jakob Nordström University of Copenhagen, Copenhagen, Denmark Lund University, Lund, Sweden
• Andy Oertel Lund University, Lund, Sweden University of Copenhagen, Copenhagen, Denmark
• Yong Kiam Tan Institute for Infocomm Research (I2R), A*STAR, Singapore

Keywords

• CSO: Constraint Optimization
• CSO: Solvers and Tools
• SO: Combinatorial Optimization