Paper:
Language: English:

Design of Nondeterministic Program Termination Based on the Equivalent Transformation Computation Model

Itaru Takarajima^, Kiyoshi Akama^, Ikumi Imani^, and Hiroshi Mabuchi^****

^Department of Commerce, Nagoya Gakuin University, 1350 Kami-Shinano, Seto, Aichi 480-1298, Japan
^Information Initiative Center, Hokkaido University, Sapporo, Japan
^Department of Foreign Studies, Nagoya Gakuin University, Seto, Japan
^****Faculty of Software and Information Science, Iwate Prefectural University, Iwate, Japan

Received: February 22, 2005

Accepted: December 21, 2005

Keywords: termination, nondeterministic program, equivalent transformation

Journal ref: Journal of Advanced Computational Intelligence and Intelligent Informatics, Vol.10, No.3 pp. 349-361, 2006

Abstract

We studied the termination of nondeterministic programs, which play an important, basic role in program synthesis, and provide a foundation for proving program termination. The class of programs we consider here is based on the equivalent transformation (ET) computation model. Computation with this model involves the succesive application of rules to sets of clauses.
Since the ET model has more expressive terms and rules than other programming languages, program termination is difficult to prove: we must take into account all possible changes of terms made by various rules. We propose a sufficient condition of ET program termination that proves termination by checking each rule in a given program. We also provide an algorithm for this check.

[Notice]
* "Preview" is the first 2 pages of the article. You don't need the registration.
* To read the PDF file you will then need to download and install the Adobe Reader.
Adobe Reader is free and available for download here: