We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

A New Method to Compute Dynamic Slicing using Program Dependence Graph

by Lipika Jha, K. S. Patnaik
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 75 - Number 13
Year of Publication: 2013
Authors: Lipika Jha, K. S. Patnaik
10.5120/13173-0852

Lipika Jha, K. S. Patnaik . A New Method to Compute Dynamic Slicing using Program Dependence Graph. International Journal of Computer Applications. 75, 13 ( August 2013), 30-36. DOI=10.5120/13173-0852

@article{ 10.5120/13173-0852,
author = { Lipika Jha, K. S. Patnaik },
title = { A New Method to Compute Dynamic Slicing using Program Dependence Graph },
journal = { International Journal of Computer Applications },
issue_date = { August 2013 },
volume = { 75 },
number = { 13 },
month = { August },
year = { 2013 },
issn = { 0975-8887 },
pages = { 30-36 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume75/number13/13173-0852/ },
doi = { 10.5120/13173-0852 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:44:12.294503+05:30
%A Lipika Jha
%A K. S. Patnaik
%T A New Method to Compute Dynamic Slicing using Program Dependence Graph
%J International Journal of Computer Applications
%@ 0975-8887
%V 75
%N 13
%P 30-36
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Program slicing is one of the techniques of program analysis that allows an analyst to automatically extract portions of programs relevant to the program being analyzed. It is an alternative approach to develop reusable components from existing software. It is a very important part of software development and maintenance. It is used in a number of applications such as program analysis, program debugging, reverse engineering, software testing, software maintenance, program understanding etc. In 1984, Weiser has introduced the concept of slicing. Earlier, static slices were used but now mainly dynamic slices are being used which further reduces the program size. In static slicing, only statically available information is used for computing slices whereas in dynamic slicing it includes all statements that affect the value of the variable occurrence for the given program inputs, not all statements that did affect its value. In this paper we have proposed a new method for computing dynamic slicing.

References
  1. David W. Binkley and Keith Brian Gallagher (1996), "Program Slicing", Advances in Computers, Volume 43, page 1-45.
  2. G. B. Mund, R. Mall, S. Sarkar (2002), "An efficient dynamic program slicing technique", Department of Computer Science and Engineering, IIT Kharagpur, pages 23-132.
  3. G. B. Mund, R. Mall, S. Sarkar (2003), "Computation of intraprocedural dynamic program slices", Department of Computer Science and Engineering, IIT Kharagpur, pages 123-132.
  4. M. Weiser (1982), "Programmers use slices when debugging", Communication of the ACM 25, pages 446-452.
  5. M. Weiser (1984), "Program Slicing". IEEE Transactions on Software Engineering, pages 352-357.
  6. B. Korel, S. Laski (1988) "Dynamic Program Slicing", Information Processing letters, pages 155-163.
  7. K Ottenstein and L. Ottenstein (1984), "The Program Dependence Graph in Software Development Environment", Procedings of the ACM SIGSOFT/SIGPLAN Software Engineering environments, SIGPLAN Notices, pages 177-184.
  8. H. Agrawal and J. Horgan (1990) "Dynamic Program Slicing", Proceedings of ACM SIGPLAN 90 conference on Programming Language Design and implementation, pages 246-256.
  9. Korel B. and Yalamanchili S. (1994), "Forward Derivation of Dynamic Slices". Proceedings of the International Symposium on Software Testing and Analysis, pages 66-79.
  10. Korel B. (1995), "Computation of dynamic slices for programs with arbitrary control-flow". The 2nd International Workshop on Automated and Algorithmic Debugging, St. Malo, France, pages 1-41.
  11. Korel B. (1997), "Computation of dynamic slices for unstructured programs". IEEE Transactions on Software Engineering, pages 17-34.
  12. Korel B. and Rilling J. (1997), "Dynamic Program Slicing in Understanding of Program Execution". Proceedings of the 5th International Workshop on Program Comprehension, pages 80-90.
  13. Korel B. and Rilling J. (1997), "Application of Dynamic Slicing in Program Debugging". Third International Workshop on Automated Debugging.
  14. Shimomura T. (1992), "The program slicing technique and its application to testing, debugging and maintenance". Journal of IPS of Japan, pages 1078-1086.
  15. Tip F. (1995), "A survey of program slicing techniques. Journal of Programming Languages", pages 121-189.
Index Terms

Computer Science
Information Sciences

Keywords

Control flow graph program dependence graph dynamic slicing criteria executable dynamic slicing non-executable dynamic slicing dynamic dependence graph execution history

Powered by PhDFocusTM