Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof

Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Abstrakt

In recent work, we formalized the theory of optimal-size sorting networks with the goal of extracting a verified checker for the large-scale computer-generated proof that 25 comparisons are optimal when sorting 9 inputs, which required more than a decade of CPU time and produced 27 GB of proof witnesses. The checker uses an untrusted oracle based on these witnesses and is able to verify the smaller case of 8 inputs within a couple of days, but it did not scale to the full proof for 9 inputs. In this paper, we describe several non-trivial optimizations of the algorithm in the checker, obtained by appropriately changing the formalization and capitalizing on the symbiosis with an adequate implementation of the oracle. We provide experimental evidence of orders of magnitude improvements to both runtime and memory footprint for 8 inputs, and actually manage to check the full proof for 9 inputs.
OriginalsprogEngelsk
TitelIntelligent Computer Mathematics : Proceedings of the 8th Conference on Intelligent Computer Mathematics (CICM 2015)
RedaktørerManfred Kerber, Jacques Carette, Cezary Kaliszyk, Florian Rabe, Volker Sorge
ForlagSpringer
Publikationsdato2015
Sider55-70
ISBN (Trykt)978-3-319-20614-1
ISBN (Elektronisk)978-3-319-20615-8
DOI
StatusUdgivet - 2015
Begivenhed8th International Conference on Intelligent Computer Mathematics - Washington, USA
Varighed: 13. jul. 201517. jul. 2015

Konference

Konference8th International Conference on Intelligent Computer Mathematics
LandUSA
ByWashington
Periode13/07/201517/07/2015
NavnLecture Notes in Computer Science
Vol/bind9150
ISSN0302-9743

Fingeraftryk

Dyk ned i forskningsemnerne om 'Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof'. Sammen danner de et unikt fingeraftryk.

Citationsformater