• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

1994 Fiscal Year Final Research Report Summary

EXPLANATION-BASED LEARNING AND REFORMATION FOR PROGRAM GENERATION,TRANSFORMATION,AND VERIFICATION

Research Project

Project/Area Number 04650298
Research Category

Grant-in-Aid for General Scientific Research (C)

Allocation TypeSingle-year Grants
Research Field 情報工学
Research InstitutionHokkaido University

Principal Investigator

KURIHARA Masahito  Hokkaido Univ., Fac.of Eng., Associate Professor, 工学部, 助教授 (50133707)

Project Period (FY) 1992 – 1994
KeywordsTerm rewriting system / Program generation / Termination / Verification / EBL / Completion / Reflection / Module
Research Abstract

This research aims at developing foundations and applications of explanation-based learning (EBL) techniques for the domain of program generation, transformation, and verification, which is one of the most active area of research field in software science. The results of the research are divided into five parts, each corresponding to a single chapter of the final report. The first two results provide the theoretical foundation of the research, while the other three present the results concerning verification, generation, and transformation, respectively. The are summarizad as follows :
1.Meta-facility for a class of equational languages has been developed. This ensures that EBL mechanisms can be incorporated in the reflective framework of the languages.
2.Modularity in the framework of equational languages has been studied. In paticular, the modularity of simple termination, which plays an important role in verification and generation, has been formally proved.
3.The EBL has been applied to the verification of termination of term rewriting systems. The technique has successfully improved the efficiency of the overall system.
4.The EBL has been applied to the program generation based on Kunth-Bendix completion of term rewriting systems. The technique has allowed us to develop an efficient procedure for completion with multiple reduction orderings.
5.A program tarnsformation technique which preserves termination has been studied and applied to the analysis of composable combination of term rewriting systems. The EBL is related to the process of generalizing known techniques of tranformation.

  • Research Products

    (12 results)

All Other

All Publications (12 results)

  • [Publications] 栗原正仁: "Modularity of simple termination of term rewriting systems with shared constructors" Theoretical Computer Science. 103. 273-282 (1992)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 栗原 正仁: "Using ATMS to efficiently verify the termination of rewrite rule programs" International Journal of Software Engineering and Knowledge Engineering. 2. 547-565 (1992)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 栗原 正仁: "Another representation of integers in logic" Trans.of Information Processing Society of Japan. 34. 536-538 (1993)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 近藤 久: "複数の簡約順序のもとでの項書換えシステム完備化手続き" 電子情報通信学会論文誌. J78-D-I. 1-10 (1995)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 栗原 正仁: "Modularity in noncopying term rewriting" Theoretical Computer Science. 140(発表予定). 1-31 (1995)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 栗原 正仁: "Decomposable termination of composable term rewriting systems" IEICE Transactions on Information and Systems. E78-D(発表予定). 1-7 (1995)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] M.Kurihara and A.Ohuchi: "Modularity of simple termination of term rewriting systems with shared constructors" Theoretical Comput.Sci.103. 273-282 (1992)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] M.Kurihara, H.Kondo and A.Ohuchi: "Using ATMS to efficiently verify the termination of rewrite rule programs" Intern.J.of Software Eng.and Knowledge Eng.2. 547-565 (1992)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] M.Kurihara and A.Ohuchi: "Another representation of integers in logic" Trans.of IPSJ. 34. 536-538 (1993)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] H.Kondo, M.Kurihara and A.Ohuchi: "Completion of term rewriting systems with multiple reduction orderings" Trans, IEICE. J78-D-I. 1-10 (1995)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] M.Kurihara and A.Ohuchi: "Modularity in noncopying term rewriting" Theoretical Comput.Sci.140 (to appear). 1-31 (1995)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] M.Kurihara and A.Ohuchi: "Decomposable termination of composable term rewriting systems" IEICE Trans.on Information and Systems. E78-D (to appear). 1-7 (1995)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 1996-04-15  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi