Research Article
Automatic Testing of Program Slicers
Algorithm 1
ORBS-based AST pruning algorithm
| Input: A program P, an executable program slice S of P, a slicing criterion C for | | S, and the maximum number of nodes MN to be removed at a time. | | Output: A quasi-minimal slice of P. | | | | | | | | for | | repeat | | | | | | until | | end for | | return | | function ORBSAST | | | | | | while | | | | | | | | | | | | if | | | | | | if | | return A″ | | end if | | else | | if | | | | return | | end if | | end if | | end while | | return A | | end function |
|