Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker
Logic in Computer Science
2016-11-30 v2
Abstract
Since the proof of the four color theorem in 1976, computer-generated proofs have become a reality in mathematics and computer science. During the last decade, we have seen formal proofs using verified proof assistants being used to verify the validity of such proofs. In this paper, we describe a formalized theory of size-optimal sorting networks. From this formalization we extract a certified checker that successfully verifies computer-generated proofs of optimality on up to 8 inputs. The checker relies on an untrusted oracle to shortcut the search for witnesses on more than 1.6 million NP-complete subproblems.
Keywords
Cite
@article{arxiv.1502.05209,
title = {Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker},
author = {Luís Cruz-Filipe and Peter Schneider-Kamp},
journal= {arXiv preprint arXiv:1502.05209},
year = {2016}
}
Comments
IMADA-preprint-cs