首页> 外文会议>Automated deduction-CADE-16 >Abstraction-based relevancy testing for model elimination
【24h】

Abstraction-based relevancy testing for model elimination

机译:基于抽象的相关性测试以消除模型

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

摘要

In application areas like formal software verification or in connection with lemma use, the success of automated theorem provers strongly depends on their ability to choos from a huge number of given axioms only some relevant ones. We present a new technique for deleting irrelevant clauses for model elimination proof procedures which is based on the use of abstractions. We analyze general conditions under which abstractions are well-suited for choosing useful clauses and investigate whether certain abstractions are applicable. So-called symbol abstractions are further examined in a case study which, e.g., introduces new techniques for the automatic generation of abstractions. We evaluate our techniques by means of experiments performed with the prover Setheo.
机译:在诸如正式软件验证或与引理使用相关的应用领域中,自动定理证明者的成功很大程度上取决于他们从大量给定公理中选择某些相关公理的能力。我们提出了一种基于抽象的使用来删除模型消除证明程序的不相关子句的新技术。我们分析了抽象适合选择有用子句的一般条件,并研究了某些抽象是否适用。在案例研究中进一步研究了所谓的符号抽象,例如,引入了自动生成抽象的新技术。我们通过与证明人Setheo进行的实验来评估我们的技术。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号