首页> 外文会议>Intelligent computer mathematics >Pervasive Parallelism in Highly-Trustable Interactive Theorem Proving Systems
【24h】

Pervasive Parallelism in Highly-Trustable Interactive Theorem Proving Systems

机译:高可信度交互式定理证明系统中的普遍并行性

获取原文
获取原文并翻译 | 示例

摘要

Interactive theorem proving is a technology of fundamental importance for mathematics and computer-science. It is based on expressive logical foundations and implemented in a highly trustable way. Applications include huge mathematical proofs and semi-automated verifications of complex software systems. Interactive development of larger and larger proofs increases the demand for computing power, which means explicit parallelism on current multicore hardware.
机译:交互式定理证明是一种对数学和计算机科学至关重要的技术。它基于表达逻辑基础,并以高度可信赖的方式实现。应用程序包括庞大的数学证明和复杂软件系统的半自动验证。越来越大的证据的交互式开发增加了对计算能力的需求,这意味着当前多核硬件上的显式并行性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号