A technique, named Node Marking Conditioned Slicing (NMCS) algorithm, has been proposed to compute conditioned slices for interprocedural programs. First, the System Dependence Graph (SDG) is constructed as an intermediate representation of a given program. Then, NMCS algorithm selects the nodes satisfying a given condition by marking process and computes the conditioned slices for each variable at each statement during marking process. A stack has been used in NMCS algorithm to preserve the context in which a method is called. Some edges of SDG have been labeled to signify which statement calls a method.
展开▼
