返回
Distributed dynamic slicing of Java programs
DOI:10.1016/j.jss.2006.01.009.png)
摘要
En 中文
We propose a novel dynamic slicing technique for distributed Java programs. We first construct the intermediate representation of a distributed Java program in the form of a set of Distributed program Dependence Graphs (DPDG). We mark and unmark the edges of the DPDG appropriately as and when dependencies arise and cease during run-time. Our algorithm can run parallely on a network of computers, with each node in the network contributing to the dynamic slice in a fully distributed fashion. Our approach does not require any trace files to be maintained. Another advantage of our approach is that a slice is available even before a request for a slice is made. This appreciably reduces the response time of slicing commands. We have implemented the algorithm in a distributed environment. The results obtained from our experiments show promise. (C) 2006 Elsevier Inc. All rights reserved.
Keyword:
program slicing
dynamic slicing
program dependence graph
debugging
object-oriented program
multithreading Java
distributed programming
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
5.5K
被引数:
8.4K
机构
暂无机构信息
引用论文
GABAergic neurons in prepositus hypoglossi regulate REM sleep by its action on locus coeruleus in freely moving rats舌下体中的gaba能神经元通过对自由运动大鼠蓝斑的作用来调节REM睡眠
Synapse
IF0
没有更多内容

