Generating Equivalent Transformation Rules from Specifications of Problems

• Item type: Trans(1)
• 公開日: 1999-05-15
• タイトル: Generating Equivalent Transformation Rules from Specifications of Problems
• タイトル / 言語: en
• タイトル: Generating Equivalent Transformation Rules from Specifications of Problems
• 言語: jpn
• キーワード / 主題Scheme: Other
• キーワード / 主題: 発表概要
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Department of System and Information Engineering Hokkaido University
• 著者所属: Department of System and Information Engineering Hokkaido University
• 著者所属: Department of System and Information Engineering Hokkaido University
• 著者所属(英): en
• 著者所属(英): Department of System and Information Engineering, Hokkaido University
• 著者所属(英): en
• 著者所属(英): Department of System and Information Engineering, Hokkaido University
• 著者所属(英): en
• 著者所属(英): Department of System and Information Engineering, Hokkaido University
• 著者名: KIYOSHI, AKAMA; HIDEKATSU, KOIKE; EIICHI, MIYAMOTO
• 著者名(英): Kiyoshi, Akama; Hidekatsu, Koike; Eiichi, Miyamoto
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: This paper proposes a new method for synthesis of programs from specifications using a new computation model called the "Equivalent Transformation model" (ET model). In the ET model specifications are represented by a set of (extended) definite clauses and the main part of the synthesis of programs is the generation of new equivalent transformation rules from the specification. In the ET model programs may be improved by adoption of each new rule and finally an efficient program may be obtained. The rule generation is different from the program transformation in Prolog where a set of definite clauses (specification) is transformed into a new set of definite clauses (which is regarded as a program in logic programming). In order to generate rules a new concept of meta-descriptions is introduced each of which represents (infinite) d[escriptions by instantiation. A meta-destription is said to be transformed equivalently iff all thd descriptions that are obtained from it by instantiation are transformed equivalently. An ET rule is obtainLed from each pair of meta-descriptions that are equivalent. Meta descriptions are transformed in terms of meta-rules. Since we can use many meta-rules corresponding to unfolding folding and other PT rules the proposed method can increase efficiency in computation at least as much as unfold/fold transformation in logic programming does. One of the most important characteristics of the proposed method is modularity. A meta-rule is modular in the sense that its correctness can be judged independently of other meta-rules. Meta-rules can be applied in any order while program transformation rules for logic prograrms can not.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: This paper proposes a new method for synthesis of programs from specifications, using a new computation model, called the "Equivalent Transformation model" (ET model). In the ET model, specifications are represented by a set of (extended) definite clauses, and the main part of the synthesis of programs is the generation of new equivalent transformation rules from the specification. In the ET model, programs may be improved by adoption of each new rule, and finally an efficient program may be obtained. The rule generation is different from the program transformation in Prolog, where a set of definite clauses (specification) is transformed into a new set of definite clauses (which is regarded as a program in logic programming). In order to generate rules, a new concept of meta-descriptions is introduced, each of which represents (infinite) d[escriptions by instantiation. A meta-destription is said to be transformed equivalently iff all thd descriptions, that are obtained from it by instantiation are transformed equivalently. An ET rule is obtainLed from each pair of meta-descriptions that are equivalent. Meta descriptions are transformed in terms of meta-rules. Since we can use many meta-rules corresponding to unfolding, folding, and other PT rules, the proposed method can increase efficiency in computation at least as much as unfold/fold transformation in logic programming does. One of the most important characteristics of the proposed method is modularity. A meta-rule is modular in the sense that its correctness can be judged independently of other meta-rules. Meta-rules can be applied in any order, while program transformation rules for logic prograrms can not.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA11464814
• 書誌情報: 情報処理学会論文誌プログラミング（PRO）; 巻 40, 号 SIG04(PRO3), p. 74-74, 発行日 1999-05-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7802
• 出版者 / 言語: ja
• 出版者: 情報処理学会