Software Verification with ITPs Should Use Binary Code Extraction to Reduce the TCB - (Short Paper).

LCF-style provers emphasise that all results are secured by logical inference, and yet their current facilities for code extraction or code generation fall short of this high standard. This paper argues that extraction mechanisms with a small trusted computing base (TCB) ought to be used instead, pointing out that the recent CakeML and OEuf projects show that this is possible in HOL and within reach in Coq.