L. Y. Sun and J. Y. Xue, “Formal derivation of the minimum spanning tree algorithm with PAR Method [J],” Computer Engineering, Vo1. 32, No. 21, pp. 85–87, 2007.

has been cited by the following article:

• TITLE: Formal Derivation of the Combinatorics Problems with PAR Method

  AUTHORS: Lingyu SUN, Yatian SUN

  KEYWORDS: PAR Method, Formal Derivation, Combinatorics, Algorithmic Programs

  JOURNAL NAME: Journal of Software Engineering and Applications, Vol.2 No.3, October 23, 2009

  ABSTRACT: Partition-and-Recur (PAR) method is a simple and useful formal method. It can be used to design and testify algo-rithmic programs. In this paper, we propose that PAR method is an effective formal method on solving combinatorics problems. Furthermore, we formally derive combinatorics problems by PAR method, which cannot only simplify the process of algorithmic program's designing, but also improve its automatization, standardization and correctness. We develop algorithms for two typical combinatorics problems, the number of string scheme and the number of error per-mutation scheme. Lastly, we obtain accurate C++ programs which are transformed by automatic transforming system of PAR platform.