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
会议日期	43978
会议地点	Daegu, Korea, Republic of
关键词	Artificial intelligence Computer science Computer software
英文摘要	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.
收录类别	EI
会议录	10th ACIS Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2009, In conjunction with IWEA 2009 and WEACR 2009
会议录出版地	United States
ISBN号	9780769536422
内容类型	会议论文
源URL	[http://124.16.136.157/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]. 见:10th ACIS Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2009, In conjunction with IWEA 2009 and WEACR 2009. Daegu, Korea, Republic of. 43978.