Paper:
Language: English:

State-Transition Computation Models and Program Correctness Thereon

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
Rangsit Campus, P.O. Box 22, Thammasat-Rangsit Post Office, Pathumthani 12121, Thailand

Received: October 30, 2006

Accepted: February 1, 2007

Keywords: state-transition computation model, program correctness, embedding mapping

Journal ref: Journal of Advanced Computational Intelligence and Intelligent Informatics, Vol.11, No.10 pp. 1250-1261, 2007

Abstract

The common framework for formalizing state-tran-sition computation models we present is based on a general theory for studying the interrelationship of specifications, programs, computation, and program correctness. We establish a necessary and sufficient condition for program correctness for this class of computation models and demonstrate framework application by formalizing, as its instances, two concrete examples of state-transition computation models – NAT and D-rule. We compare their correct-program spaces by introducing the embedding mapping concept.

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