The Research Of Developing Algorithmic Program Based On PAR Method

Success of software system mostly depends on the quality of demand engineering, but liability and efficiency of software are always two difficult problems disturbed software enterprise. Formal method is always thought the significant way to solve such problems and the key to realize the automatic design. Although nowadays variety of software formal methods and explode technology have been proposed, there are still far way to be widely accepted by software enterprise. It lies in many advocators of different methods haven't done real research on the problems which designers encounter, the disconnection between algorithm and program in study, lack of systematic algorithmic program design and proof method, hi actually, some methods , software explore tools established on above methods and automatic generating system can only deal with or generate toy-style program.. It still havenot a formal method which is oriented to practical problems, simple and variable, convenient to be accepted by software designers, and a series matched compliment tools, used to solve the problems above.The PAR method, the variation principles of divided, increased, and expanded measure words, loop invariants, and other mew techniques and software variation methods are applied to design complex algorithm, which runs through the whole process of the software development. The PAR method, describing the algorithm in a novel way, defines Radl, which is more simple, precise and comprehensible than ordinary computer language, procedure charts and the method of program description.The thesis starts with comprehensive introduction of the formal method and language, including its definition and classify .Then explains the prime number deduction and works out algorithm procedure and involves the advantages of the method and the quantity of calculation core of matrix algebra and widely used it, The standard location method can be applied to many aspects of matrix algebra such as determinant, the rank of matrix and vector. At last, the thesis involves the dynamic design of the algorithm program.