formal derivation of a generic algorithmic program for solving a class extremum problems

	formal derivation of a generic algorithmic program for solving a class extremum problems
	Wang Chang-Jing; Xue Jin-Yun
	2009
会议名称	10th ACIS Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2009, In conjunction with IWEA 2009 and WEACR 2009
会议录名称	10th ACIS Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2009, In conjunction with IWEA 2009 and WEACR 2009
会议日期	43978
会议地点	Daegu, Korea, Republic of
收录类别	EI
出版地	United States
ISBN	9780769536422
部门归属	(1) Key Laboratory for High-Performance Computing Technology, Jiangxi Normal University, Nanchang 330022, China; (2) Institute of Software, Chinese Academy of Sciences, Beijing 100190, China; (3) Graduate University, Chinese Academy of Sciences, Beijing 100190, China
摘要	In this paper, we derive formally, using PAR method, a generic algorithmic program for solving a class of extremum problems which can be abstract into a algebra structure called semiring. Some typical algorithms, such as minimal sum problem, maximal product problem, longest ascending segment problem, etc, are all instances of the generic algorithmic program. We put emphasis on the algorithmic derivation rather than the algorithmic verification. Not only embody the designer insight but also reveal the main ideas and ingenuity of these algorithms. The example in this paper confirms that PAR method is a simple and practical approach in deriving high-trustworthy generic algorithm programs. © 2009 IEEE.
关键词	Artificial Intelligence Computer Science Computer Software
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/8488
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Wang Chang-Jing,Xue Jin-Yun. formal derivation of a generic algorithmic program for solving a class extremum problems[C]. United States,2009.