Journal of Software Engineering and Applications

Volume 2, Issue 3 (October 2009)

ISSN Print: 1945-3116   ISSN Online: 1945-3124

Google-based Impact Factor: 2.23  Citations  h5-index & Ranking

Formal Derivation of the Combinatorics Problems with PAR Method

HTML  Download Download as PDF (Size: 94KB)  PP. 195-199  
DOI: 10.4236/jsea.2009.23026    6,739 Downloads   9,871 Views  




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.

Share and Cite:

L. SUN and Y. SUN, "Formal Derivation of the Combinatorics Problems with PAR Method," Journal of Software Engineering and Applications, Vol. 2 No. 3, 2009, pp. 195-199. doi: 10.4236/jsea.2009.23026.

Cited by

No relevant information.

Copyright © 2021 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.