Research And Implement Of Radl->Apla Automatic Program Transformation System

Since software crisis broke out, there have many new methods and new tools available to solve problems resulted from it. However, these existing solutions can't liberate people from software crisis thoroughly. Developing correct and efficient algorithmic programs with formal methods is called revolutionary approach by current computer world to overcome software crisis and improve software's reliability and productivity.According to research of several projects supported by 863 Hi-Tech Programme and National Natural Science Foundation of China, Professor Xue proposed a simple and practicable approach for formal development and proving of Algorithmicprograms--PAR approach. In addition, Radl is defined for describing algorithmicspecifications and algorithms, and Apla is defined for describing abstract programs.This paper's research work is an important component of the PAR method. This research's goal is to develop an auto program tansforming the algorithm program described by Radl into the Apla program. The follow is the main works of the paper: 1 , Induct and coordinate the Radl and Apla language. 2, Summary the rules for transformation from an algortithm described by Radl into anApla program. 3, Implement the automatic transformation from an algorthm described by Radl into anApla program. 4, Using some typical algorithms to test the system.This transformer has already tranformed some typical algorithms described by Radl such as sum array,cube problem, pre-travel tree algorithms and travel graph algorithms into Apla program.During the time of research and implementation, we make the following innovations:1, Implement the transformation from out-of-order recurrences described by Radl into Apla program.2, Implement the transformation from connotative recurrences described by Radl into Apla program.