Formal Derivation of the Longest Common Subsequence Problem with PAR Method

被引:0
|
作者
Sun, Lingyu [1 ]
Leng, Ming [1 ]
机构
[1] Jinggangshan Univ, Dept Comp Sci, Jian 343009, Jiangxi, Peoples R China
来源
2009 INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT, INNOVATION MANAGEMENT AND INDUSTRIAL ENGINEERING, VOL 1, PROCEEDINGS | 2009年
关键词
D O I
10.1109/ICIII.2009.36
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Partition-and-Recur (PAR) method is a simple and useful formal method used to design and prove algorithmic programs. In this paper, we address that PAR method is really an effective formal method on solving Combinatorics problems. We formally derive Combinatorics problems by PAR method, which can not only simplify the process of algorithmic program's designing and correctness testifying, but also effectively improve the automatization, standardization and correctness of algorithmic program's designing by changing many creative labors to mechanized labors. Lastly, we develop typical algorithms of Combinatorics problem instances, longest common subsequence problem, and get accurate running result by RADL algorithmic program which derived by PAR method and can be transformed to C++ programs by the automatic program transforming system of PAR platform.
引用
收藏
页码:123 / 125
页数:3
相关论文
empty
未找到相关数据