Paper:
Language: English:

Formalization of the Equivalent Transformation Computation Model

Kiyoshi Akama^*, and Ekawit Nantajeewarawat^**

^*Division of Large-Scale Computational Systems, Information Initiative Center, Hokkaido University, Kita 11 Nishi 5, Kita-ku, Sapporo, Hokkaido 060-0811, Japan
^**Computer Science Program, Sirindhorn International Institute of Technology, Thammasat University, P.O. Box 22, Thammasat-Rangsit Post Office, Rangsit Campus, Pathumthani 12121, Thailand

Received: February 22, 2005

Accepted: December 21, 2005

Keywords: computation model, equivalent transformation, program synthesis, program correctness, rule-based computation

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

Abstract

In the equivalent transformation (ET) computation model, a specification provides background knowledge in a problem domain and defines a set of queries of interest. A program is a set of prioritized transformation rules, and computation consists in successive reduction of queries using meaning-preserving transformation with respect to given background knowledge. We present a formalization of the ET model from the viewpoint of program synthesis, where not only computation but also program correctness and correctness relations are of central importance. The notion of program correctness defines “what it means for a program to be correct with respect to a specification,” and a correctness relation provides guidance on “how to obtain such a program.” The correctness relation of the ET model is established, based on which how the basic structure of the ET model facilitates program synthesis is discussed together with program synthesis strategies in this model.

[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: