### Resumé

Originalsprog | Engelsk |
---|---|

Titel | Intelligent Computer Mathematics : Proceedings of the 8th Conference on Intelligent Computer Mathematics (CICM 2015) |

Redaktører | Manfred Kerber, Jacques Carette, Cezary Kaliszyk, Florian Rabe, Volker Sorge |

Forlag | Springer |

Publikationsdato | 2015 |

Sider | 55-70 |

ISBN (Trykt) | 978-3-319-20614-1 |

ISBN (Elektronisk) | 978-3-319-20615-8 |

DOI | |

Status | Udgivet - 2015 |

Begivenhed | 8th International Conference on Intelligent Computer Mathematics - Washington, USA Varighed: 13. jul. 2015 → 17. jul. 2015 |

### Konference

Konference | 8th International Conference on Intelligent Computer Mathematics |
---|---|

Land | USA |

By | Washington |

Periode | 13/07/2015 → 17/07/2015 |

Navn | Lecture Notes in Computer Science |
---|---|

Vol/bind | 9150 |

ISSN | 0302-9743 |

### Fingeraftryk

### Citer dette

*Intelligent Computer Mathematics: Proceedings of the 8th Conference on Intelligent Computer Mathematics (CICM 2015)*(s. 55-70). Springer. Lecture Notes in Computer Science, Bind. 9150 https://doi.org/10.1007/978-3-319-20615-8_4

}

*Intelligent Computer Mathematics: Proceedings of the 8th Conference on Intelligent Computer Mathematics (CICM 2015).*Springer, Lecture Notes in Computer Science, bind 9150, s. 55-70, 8th International Conference on Intelligent Computer Mathematics, Washington, USA, 13/07/2015. https://doi.org/10.1007/978-3-319-20615-8_4

**Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof.** / Cruz-Filipe, Luís; Schneider-Kamp, Peter.

Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review

TY - GEN

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

AU - Cruz-Filipe, Luís

AU - Schneider-Kamp, Peter

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-319-20615-8_4

DO - 10.1007/978-3-319-20615-8_4

M3 - Article in proceedings

SN - 978-3-319-20614-1

T3 - Lecture Notes in Computer Science

SP - 55

EP - 70

BT - Intelligent Computer Mathematics

A2 - Kerber, Manfred

A2 - Carette, Jacques

A2 - Kaliszyk, Cezary

A2 - Rabe, Florian

A2 - Sorge, Volker

PB - Springer

ER -