Dynamic slicing of distributed object-oriented programs
Dynamic slicing of distributed object-oriented programs
复制标题
分布式面向对象程序的动态切片
作者：
Soubhagya Sankar Barpanda;D. Mohapatra
程序切片是一种分解技术，涉及提取与特定计算相关的陈述。作者提出了一种用于计算分布式面向对象程序的动态切片的新型算法。所提出的算法结合了图形策略来计算切片。但是为了有效地实现目标，作者与传统图形技术的一些关键限制相矛盾。在计算切片时，还考虑了切片标准的状态限制以及依赖分析。提出的算法的优点是它比现有算法更有效，更快。
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.