首页> 外文会议>International Conference on Concurrency Theory(CONCUR 2007); 20070903-08; Lisbon(PT) >Automatic Derivation of Compositional Rules in Automated Compositional Reasoning
【24h】

Automatic Derivation of Compositional Rules in Automated Compositional Reasoning

机译:自动合成推理中的合成规则的自动推导

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Soundness of compositional reasoning rules depends on computational models and sometimes is rather involved. Verifiers are therefore forced to mould their problems into a handful of sound compositional rules known to them. In this paper, a syntactic approach to establishing soundness of compositional rules in automated compositional reasoning is presented. Not only can our work justify all compositional rules known to us, but also derive new circular rules by intuitionistic reasoning automatically. Invertibility issues are also briefly discussed in the paper.
机译:组成推理规则的健全性取决于计算模型,有时会涉及到。因此,验证者被迫将他们的问题塑造成他们已知的少数合理的构图规则。本文提出了一种在自动构图推理中建立构图规则合理性的句法方法。我们的工作不仅可以证明我们已知的所有组成规则,而且还可以通过直觉推理自动得出新的循环规则。本文还简要讨论了可逆性问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号