Computing dynamic slices of concurrent object-oriented programs

Mohapatra, Durga Prasad; Mall, Rajib; Kumar, Rajeev

doi:10.1016/j.infsof.2005.02.002

Cited by 20 publications

(9 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Mohapatra, Mall, and Kumar have introduced the notion of "Distributed Program Dependence Graph" as the program representation for dynamic slicing of concurrent object-oriented programs [35][36][37][38].…”

Section: Dynamic Slicing Of Concurrent Programs: a Methodological Reviewmentioning

confidence: 99%

Uncertainty Problem in Dynamic Slicing of Concurrent Programs

Cheng

2009

2009 International Conference on Embedded Software and Systems

View full text Add to dashboard Cite

As long as a branch of science offers an abundance of problems, so long is it alive: a lack of problems foreshadows extinction or the cessation of independent development." --David Hilbert, 1900. AbstractAlthough both static and dynamic slicing of sequential programs have been applied to software engineering practices, there still are some challenges, problems, and issues in slicing concurrent programs, in particular, dynamic slicing of concurrent programs. This paper presents a methodological review of dynamic slicing methods for concurrent programs, points out that the most intrinsic problem in all existing dynamic slicing methods is the uncertainty problem, and shows a new research direction for dynamic slicing of concurrent programs. The paper proposes two basic criteria, i.e., completeness and soundness, for dynamic slicing of concurrent programs, and shows that we should develop a dependence/influence analysis method based on selfmeasurement principle to obtain complete and sound dynamic slices of concurrent programs.

show abstract

Section: Dynamic Slicing Of Concurrent Programs: a Methodological Reviewmentioning

confidence: 99%

Uncertainty Problem in Dynamic Slicing of Concurrent Programs

Cheng

2009

2009 International Conference on Embedded Software and Systems

View full text Add to dashboard Cite

show abstract

“…Starting from a subset of a program's behavior, slicing reduces the program to a minimal form that still produces the same behavior. The input that the slicing algorithm takes is usually an intermediate representation of the program under consideration [28,29,45]. The first step in slicing a program involves specifying a point of interest which is called the slicing criterion and is expressed as a tuple (s, v), where s is the statement number and v is the variable that is being used or defined at s. Some of the recent techniques and applications of program slicing can be found in [8,11,37,40].…”

Section: Hierarchical Slicementioning

confidence: 99%

ACCo: a novel approach to measure cohesion using hierarchical slicing of Java programs

Panda

Mohapatra

2015

Innovations Syst Softw Eng

View full text Add to dashboard Cite

Maintainability of program parts refers to the ease with which these parts can be modified. Many existing metrics of internal quality attributes such as cohesion, coupling, etc. have been used in this regard. Cohesiveness among program parts is considered as a strong measure for the maintainability of object-oriented components and to predict the probability of being erroneous. Our objective is to propose a novel graph-based cohesion metric to measure the maintainability of different program parts in an object-oriented program and predict their fault proneness. We compute the cohesion of the sliced component as a measure to predict its correctness and preciseness. In addition, we wish to theoretically validate the proposed technique against the existing guidelines of cohesion measurement and compare it with some existing techniques. We propose a new cohesion metric named affected component cohesion (ACCo) to measure the maintainability of different program parts and predict their fault proneness. This metric is based on the hierarchical decomposition slice of an object-oriented program that comprises all the affected program parts. The slices are obtained with respect to some modification made to the program under consideration. It is essential to consider all possible dependence relationships along with the control and data dependences that exist between different program parts of an object-oriented program for a better program comprehension. To represent these dependences, we construct a suitable intermediate graph for an object-oriented program. Then, we compute the slice of the object-oriented program using the intermediate graph to extract the affected B S. Panda program parts. These extracted affected program parts are represented as nodes in the proposed affected slice graph. The critical and sub-critical nodes that require thorough testing are determined by estimating their cohesion measure. The theoretical validation signifies that ACCo satisfies all the existing properties for cohesion measurement. The results obtained are more precise and comparable with other existing approaches. ACCo is a more precise and practical technique to measure the inter-relatedness of affected program parts in an object-oriented program. The discussion on possible threats to its validity demonstrates the scope for improvement of this approach.

show abstract

“…al. [4] have developed a marking based dynamic slicing technique for concurrent object-oriented programs. The algorithm works by marking those edges for which dependence exists and unmark the edges when the dependence ceases to exist.…”

Section: Hence According To the Definition The Coloring Of A Graph Gmentioning

confidence: 99%

A graph coloring approach to slicing of object-oriented programs

Barpanda

Biswal

Mohapatra

2010

Proceedings of the International Conference and Workshop on Emerging Trends in Technology

View full text Add to dashboard Cite

The wide spread interest in slicing of object-oriented software has led to the birth of number of algorithms. Nowadays, slicing of object-oriented programs has picked up the momentum as most of the real world programs are object-oriented in nature. The algorithms which are available of-the-self, address different issues in their own ways. In this paper, we propose a new algorithm which incorporates graph coloring technique. But in order to compute the dynamic slice, we have contradicted some key constraints of graph coloring algorithm. The advantage of our algorithm is that it is faster and the process of computing slice can be optimized further.

show abstract

Computing dynamic slices of concurrent object-oriented programs

Cited by 20 publications

References 31 publications

Uncertainty Problem in Dynamic Slicing of Concurrent Programs

Uncertainty Problem in Dynamic Slicing of Concurrent Programs

ACCo: a novel approach to measure cohesion using hierarchical slicing of Java programs

A graph coloring approach to slicing of object-oriented programs

Contact Info

Product

Resources

About