Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Nanda, S. Ramesh (2000)
Slicing concurrent programs
M. Weiser (1982)
Programmers use slices when debuggingCommun. ACM, 25
Zhengqiang Chen, Baowen Xu (2001)
Slicing object-oriented java programsACM SIGPLAN Notices, 36
G. Mund, R. Mall (2006)
An efficient interprocedural dynamic slicing methodJ. Syst. Softw., 79
Venkatesh (1991)
The semantic approach to program slicingIn ACM SIGPLAN Notices, 26
B. Korel, J. Laski (1988)
Dynamic Program SlicingInf. Process. Lett., 29
M. Weiser (1981)
Program SlicingIEEE Transactions on Software Engineering, SE-10
Zhenqiang Chen, Baowen Xu, Jianjun Zhao (2002)
An overview of methods for dependence analysis of concurrent programsACM SIGPLAN Notices, 37
J. Krinke (2003)
Context-sensitive slicing of concurrent programs
Baowen Xu, Ju Qian, Xiaofang Zhang, Zhongqiang Wu, Lin Chen (2005)
A brief survey of program slicingACM SIGSOFT Softw. Eng. Notes, 30
G. Venkatesh (1991)
The semantic approach to program slicing
Krinke (2003)
Context-sensitive slicing of concurrent programsACM SIGSOFT Software Engineering Notes, 28
D. Mohapatra, R. Mall, Rajeev Kumar (2005)
Computing dynamic slices of concurrent object-oriented programsInf. Softw. Technol., 47
Brian Mallo, J. McGregor, Anand Krishnaswamy, Murali Medikonda (1994)
An extensible program representation for object-oriented softwareACM SIGPLAN Notices, 29
Susan Horwitz, T. Reps, D. Binkley (1990)
Interprocedural slicing using dependence graphsACM Trans. Program. Lang. Syst., 12
K. Ottenstein, Linda Ottenstein (1984)
The program dependence graph in a software development environment
F. Tip (1994)
A survey of program slicing techniquesJ. Program. Lang., 3
Vaidas Giedrimas (2019)
Recursive AOP for Reversible SoftwareBalt. J. Mod. Comput., 7
Nanda (2005)
Slicing concurrent programsACM SIGSOFT Software Engineering Notes, 25
A dynamic slicing algorithm is proposed in this paper along with its implementation which is dynamic for concurrent Component-oriented programs carrying multiple threads. As a part of representing the concurrent COP (CCOP) effectively, an intermediate graph is developed called Concurrent Component Dependency Graph (CCmDG). The system dependence graph (SDG) for individual components and interfaces are integrated to represent the above intermediate graph. It also consists of some new dependence edges which have been triggered for connecting the individual dependence graph of each component with the interface. Based on the graph created for the CCOP, a dynamic slicing algorithm is proposed, which sets the resultant by making the executed nodes marked during run time in Concurrent Components Dynamic Slicing (CCmDS) appropriately. For checking the competence of our algorithm, five case studies have been considered and also compared with an existing technique. From the study, we found that our algorithm results in smaller and precise size slice compared to the existing algorithm in less time.
International Journal of Knowledge-Based and Intelligent Engineering Systems – IOS Press
Published: Feb 18, 2022
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.