The Application Research On Algorithmic Framework In Software Reuse

The design of reusable software components is the key to improve the quality and productivity of software. The formal derivation of algorithm is an important way to improve the reliability and correctness of software. It is not only the important mean for achieving reusable components but also the basis of software automation. Through a formal derivation, an efficient algorithm can be acquired. Based on the classification research on some basic or typical algorithms , the abstract algorithms about problems can be obtained by the formal description and transformation to the problem's specifications. In general, although the abstract algorithms to the different problems are not the same, the common characters about them can be found after abstracting them further. By the further study on the problems, if the relevant operators of the algorithm programs derived formally can be abstracted, we can acquire the algorithm structures to solve the problems which are the algorithmic frameworks to solve a kind of problems.Based on the formal derivation and abstract representation, this paper provides the algorithmic frameworks about a class of array problems and the three-color blocks problems. In fact, a class of problems with the same algorithmic framework essentially has the same algebraic structure. By the object-oriented technology and the relevant mechanisms in C++ , such as class, inheritance and polymorphism, the algorithmic frameworks can be designed for reusable components that can be applied to concrete software designs. The more reusable components, based on the algorithms framework, can be found and designed through our efforts. Algorithmic frameworks provide a higher level and more practical reusable component libraries for software designers . It is a new approach and idea of software reuse.