Treffer: Dynamic slicing of distributed object-oriented programs.

Program slicing is a decomposition technique that deals with extracting those statements relevant to a particular computation. The authors propose a novel algorithm for computing dynamic slice of distributed object-oriented programs. The proposed algorithm incorporates graph colouring strategy to compute slice. But to achieve the goal efficiently, the authors have contradicted some key constraints of the traditional graph colouring technique. The state restriction of the slicing criterion is also considered along with dependence analysis while computing slice. The advantage of the proposed algorithm is that it is efficient and faster than the existing algorithms. [ABSTRACT FROM AUTHOR]

Copyright of IET Software (Institution of Engineering & Technology) is the property of Institution of Engineering & Technology and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)