End-to-End Certified Graph Colouring
Paper i proceeding, 2026
Applied combinatorial optimization has witnessed a revolution in performance since the turn of the millennium, but the complexity of modern solvers is making bugs an ever more serious concern. The most promising remedy is to make solvers certifying, so that they use proof logging to generate machine-verifiable proofs of correctness. We present the first example of state-of-the-art certified graph colouring by equipping the solver ZykovColor with VeriPB proof logging. Combined with the formally verified CakePB checker, this provides end-to-end formally certified results. An experimental evaluation shows excellent results with only moderate overhead for proof logging and checking.
certifying algorithms
proof logging
graph colouring
Författare
Simon Dold
Universität Basel
Wietze Koops
Köpenhamns universitet
Lunds universitet
Jakob Nordström
Lunds universitet
Köpenhamns universitet
Yong Kiam Tan
Nanyang Technological University
Agency for Science, Technology and Research (A*STAR)
George Katsirelos
Université Paris-Saclay
Universite Paul Sabatier Toulouse III
Magnus Myreen
Chalmers, Data- och informationsteknik, Formella metoder
Göteborgs universitet
Andy Oertel
Köpenhamns universitet
Lunds universitet
Leibniz International Proceedings in Informatics, LIPIcs
18688969 (ISSN)
Vol. 379 219783959774321 (ISBN)
32nd International Conference on Principles and Practice of Constraint Programming, CP 2026
Lisbon, Portugal,
Lisbon, Portugal,
De nästa 700 verifierade kompilatorerna
Vetenskapsrådet (VR) (2021-05165), 2022-01-01 -- 2025-12-31.
Ämneskategorier (SSIF 2025)
Datavetenskap (datalogi)
DOI
10.4230/LIPIcs.CP.2026.21