State-Transition Computation Models and Program Correctness Thereon

被引：2

作者：

Akama, Kiyoshi ^{[1
]}

Nantajeewarawat, Ekawit ^{[2
]}

机构：

[1] Hokkaido Univ, Div Large Scale Computat Syst, Informat Initiat Ctr, Kita Ku, Kita 11 Nishi 5, Sapporo, Hokkaido 0600811, Japan

[2] Thammasat Univ, Comp Sci Program, Sirindhorn Int Inst Technol, Pathum Thani 12121, Thailand

来源：

JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS | 2007年 / 11卷 / 10期

关键词：

state-transition computation model; program correctness; embedding mapping;

D O I：

10.20965/jaciii.2007.p1250

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The common framework for formalizing state-transition 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.

引用

页码：1250 / 1261

页数：12