Finding program slices for recursive procedures

The development of program slicers with respect to programs containing recursive procedures, is investigated. A theoretical foundation is constructed for the computation process. A general recursive scheme is introduced as a basis of discussion. A complete slice is defined for recursive procedures to identify clearly what can be obtained through static analysis. The ´everywhere undefined function´ Omega introduced by the authors provides the required starting condition for the computation process, and a fixed-point equation supplies a terminating condition such that the computation will have a definite end point. The poset theory is used to verify the entire process. The implementation of the proposed technique is discussed.<>