.png){kind=icon}
.png){kind=icon}
Return
Computing dynamic slices of concurrent object-oriented programs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.infsof.2005.02.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a novel dynamic program slicing technique for concurrent object-oriented programs. Our technique uses a Concurrent System Dependence Graph (CSDG) as the intermediate program representation. We mark and unmark the edges in the CSDG appropriately as and when the dependencies arise and cease during run-time. We mark an edge when its associated dependence exists and unmark an edge when the dependence ceases to exist. Our approach eliminates the use of trace files. Another advantage of our approach is that when a request for a slice is made, it is already available. This appreciably reduces the response time of slicing commands. C (c) 2005 Elsevier B.V. All rights reserved.
Keywords:
program slicing
static slicing
dynamic slicing
program dependence graph
debugging
concurrent object-oriented programs
threads
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.3
Papers:
3.7K
Citations:
7.7K
Organization
No organization information available