An Incremental Approach to Automatic Algorithm Design  

作　　者：栾尚敏 李未 

机构地区：[1]DepartmentofComputerScience,BeijingUniversityofAeronauticsandAstronauticsBeijing100083,P,R.China [2]Depa

出　　处：《Journal of Computer Science & Technology》1999年第4期314-319,共6页计算机科学技术学报（英文版）

摘　　要：This paper presents an incremental approach to automatic algorithm design, which can be described by algebraic specifications precisely and conveniently. The definitions of selection operator and extension operator which can bedefined by strategy relations and transformations are given in order to model theprocess of finding the solution of a problem. Also discussed is its object-orientedimplementation. The functional specification and the design specification for an algorithm are given in one framework so that the correctness of the algorithm can beeasily proved.This paper presents an incremental approach to automatic algorithm design, which can be described by algebraic specifications precisely and conveniently. The definitions of selection operator and extension operator which can bedefined by strategy relations and transformations are given in order to model theprocess of finding the solution of a problem. Also discussed is its object-orientedimplementation. The functional specification and the design specification for an algorithm are given in one framework so that the correctness of the algorithm can beeasily proved.

关 键 词：automatic algorithm design algebraic specification object-orientedmethodology 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]