2026-07-22T06:32:44Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:16726 2024-03-06T10:58:09Z ddc:004 open_access

Accelerating Verified-Compiler Development with a Verified Rewriting Engine Gross, Jason Erbsen, Andres Philipoom, Jade Poddar-Agrawal, Miraya Chlipala, Adam compiler verification rewriting engines cryptography Compilers are a prime target for formal verification, since compiler bugs invalidate higher-level correctness guarantees, but compiler changes may become more labor-intensive to implement, if they must come with proof patches. One appealing approach is to present compilers as sets of algebraic rewrite rules, which a generic engine can apply efficiently. Now each rewrite rule can be proved separately, with no need to revisit past proofs for other parts of the compiler. We present the first realization of this idea, in the form of a framework for the Coq proof assistant. Our new Coq command takes normal proved theorems and combines them automatically into fast compilers with proofs. We applied our framework to improve the Fiat Cryptography toolchain for generating cryptographic arithmetic, producing an extracted command-line compiler that is about 1000× faster while actually featuring simpler compiler-specific proofs. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jason Gross and Andres Erbsen and Jade Philipoom and Miraya Poddar-Agrawal and Adam Chlipala 2022 Is Part Of LIPIcs, Volume 237, 13th International Conference on Interactive Theorem Proving (ITP 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ITP.2022.17 urn:nbn:de:0030-drops-167262 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2022.17 eng https://creativecommons.org/licenses/by/4.0/legalcode