An efficient method for computing dynamic program slices

Authors:
D. Goswami;R. Mall
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India;Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India
Venue:
Information Processing Letters
Year:
2002

Citing 5
Cited 5

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Dynamic program slicing

Information Processing Letters
Dynamic program slicing

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Dynamic slicing in the presence of unconstrained pointers

TAV4 Proceedings of the symposium on Testing, analysis, and verification
The program dependence graph in a software development environment

SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments

A brief survey of program slicing

ACM SIGSOFT Software Engineering Notes
Distributed dynamic slicing of Java programs

Journal of Systems and Software
A parallel algorithm for dynamic slicing of distributed Java programs in non-DSM systems

International Journal of Information and Communication Technology
Computing dynamic slices of concurrent object-oriented programs

Information and Software Technology
A novel approach for dynamic slicing of distributed object-oriented programs

ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology

Quantified Score

Hi-index	0.89

Visualization

Abstract

We propose an efficient method for computing dynamic slices of programs. Our method is based on construction of data dependence edges of program dependence graph at run-time. We introduce the concept of compact dynamic dependence graphs (CDDGs) of programs. We show computation of dynamic slices using CDDGs to be more efficient than existing methods.