首页> 外文会议>International Conference on Interactive Theorem Proving >Software Verification with ITPs Should Use Binary Code Extraction to Reduce the TCB (Short Paper)
【24h】

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

机译:使用ITPS的软件验证应使用二进制代码提取以减少TCB(短文)

获取原文

摘要

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 CEuf projects show that this is possible in HOL and within reach in Coq.
机译:LCF样式的普通强调所有结果都是通过逻辑推理获得的,但他们目前的代码提取或代码生成设施缺少这一高标准。本文认为,具有小值得信赖的计算基础(TCB)的提取机制应该被使用,指出最近的Cakeml和CEUF项目表明,在HOL和COQ中的范围内,这是可能的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号