首页> 外文期刊>International Journal of Innovative Computing Information and Control >ET-BASED BIDIRECTIONAL SEARCH FOR PROVING FORMULAS IN THE CLASS (ε)S
【24h】

ET-BASED BIDIRECTIONAL SEARCH FOR PROVING FORMULAS IN THE CLASS (ε)S

机译:基于ET的双向搜索以证明(ε)S类的公式

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

摘要

In this paper, we propose a new method for proving the correctness of Logical Equivalences (LEs) in a newly defined class called (ε)S. Proving the correctness of LEs is important for guaranteeing the correctness of Equivalent Transformation (ET) rules made from LEs. ET rules are useful for constructing correct sequential and parallel programs. The proposed method proves the equivalence of the declarative meaning of two definite clause sets using a bidirectional search that starts from two different points simultaneously. In the proposed method, the two definite clause sets at the starting points are transformed by ET rules. The method can generate ET rules that are essential for advancing the proof along with the general unfolding rules that are given before computing the proof. Class (ε)S is a superclass of the classes proposed in past studies and therefore covers the LEs they contain.
机译:在本文中,我们提出了一种新方法来证明新定义的类(ε)S中的逻辑对等(LE)的正确性。证明LE的正确性对于保证LE制定的等效变换(ET)规则的正确性很重要。 ET规则对于构造正确的顺序和并行程序很有用。所提出的方法通过同时从两个不同点开始的双向搜索来证明两个定语从句集的声明性含义的等效性。在提出的方法中,通过ET规则转换起点处的两个确定子句集。该方法可以生成对于推进证明必不可少的ET规则,以及在计算证明之前给出的常规展开规则。 (ε)S类是过去研究中提出的类的超类,因此涵盖了其中包含的LE。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号