关键词: 算法推导 形式方法 递归程序变换 PAR方法

Abstract:

An approach to recursion removing is prompted, which suits for the reeursive programs with reeursive aata structures. It takes the reeursive program a s an initial specification, and the state transformation sequence of the solving process as an iterative model By data transformation, the transformation from the initial specification to the sequence-based description specification is implemented,and thus the sequence speeifieation＇s reeursive relatioonship is derived using the PAR method. The non-reeursive program is constructed almost automatically from recurrence. Two algorithms of trees and graphs are derived to illustrate the validity.

Key words: （algorithmic derivation, formal method, recursive structure, PAR method）