CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Computing Dynamic Slices of Object-Oriented Programs using Dependency Information

by Swatee Rekha Mohanty, Prafulla Kumar Behera, Durga Prasad Mohapatra
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 80 - Number 8
Year of Publication: 2013
Authors: Swatee Rekha Mohanty, Prafulla Kumar Behera, Durga Prasad Mohapatra
10.5120/13878-1761

Swatee Rekha Mohanty, Prafulla Kumar Behera, Durga Prasad Mohapatra . Computing Dynamic Slices of Object-Oriented Programs using Dependency Information. International Journal of Computer Applications. 80, 8 ( October 2013), 1-7. DOI=10.5120/13878-1761

@article{ 10.5120/13878-1761,
author = { Swatee Rekha Mohanty, Prafulla Kumar Behera, Durga Prasad Mohapatra },
title = { Computing Dynamic Slices of Object-Oriented Programs using Dependency Information },
journal = { International Journal of Computer Applications },
issue_date = { October 2013 },
volume = { 80 },
number = { 8 },
month = { October },
year = { 2013 },
issn = { 0975-8887 },
pages = { 1-7 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume80/number8/13878-1761/ },
doi = { 10.5120/13878-1761 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:53:58.946700+05:30
%A Swatee Rekha Mohanty
%A Prafulla Kumar Behera
%A Durga Prasad Mohapatra
%T Computing Dynamic Slices of Object-Oriented Programs using Dependency Information
%J International Journal of Computer Applications
%@ 0975-8887
%V 80
%N 8
%P 1-7
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Now a days, object-oriented programs are becoming very popular amongst the developers and hence almost all software are designed using the object-oriented paradigm. Advanced features of object-oriented programming has made it complicated to understand, test, debug and maintain. To better manage these software, slicing techniques have been proved to be quite efficient. This paper proposed an algorithm for dynamic slicing of object-oriented software. It uses SDG(System Dependence Graph) and DG(Dynamic Graph) as the intermediate program representation while computing the dynamic slices. In this paper dynamic slicing algorithm is based on traversing through the outgoing control dependence edges and incoming data dependence edges of Dynamic Graph. The major advantage of the proposed algorithm is that the time required to compute the dynamic slice of the object-oriented programs is directly proportional to the number of dependencies (control and/or data) arising during the run time. Also the proposed algorithm depends on the numbers of nodes present in the intermediate program representation.

References
  1. M. Weiser, "Programmers use slices when debugging", communications of the ACM 25 (7)(1982) 446-452.
  2. M. Weiser, "Program Slicing", IEEE Transactions on Software Engineering 10 (4) (1984).
  3. B. Korel, J. Laski, "Dynamic program slicing", Information Processing Letters 29 (3) (1988).
  4. J Lyle, "Evaluating variations on program slicing for debugging", PhD Thesis.
  5. M . Karmakar, "Interprocedural dynamic slicing with applications to debugging and testing".
  6. H. Agrawal, J. Horgan, "Dynamic program slicing", Proceeding of the ACM SIGPLAN'90 Conference on programming Languages Design and Implementation, SIGPLAN Notices, Analysis and Verification, White Plain, New York, vol 25, no. 6, 1990, pp. 246-256.
  7. Zhang, X. , Gupta, R. , Zhang, Y. ,2003. "Precise dynamic slicing". In:Proceeding of the 25th International conference on software Engineering, Porland, Oregan, pp. 319-329.
  8. Mund et. al. , "An efficient dynamic program slicing technique", Information and Software Technology 44(2002) 123-132.
  9. Mund et. al. , "Computation of intra-procedural dynamic program slices", Information and Software Technology 45(2003) 499-512.
  10. Mund et. al. , "An efficient inter-procedural dynamic slicing method", The Journal of Systems and software 79(2006) 791-806.
  11. Ottenstein, K. , Ottenstein, L. ,. "The program Dependence Graph in software development environment". In: Proceedings of the ACM SIGSOFT/SIGPLAN Software Symposium on Practical Software Development Environments, SIGPLAN Notices, vol. 19(5), pp 177-184(1984).
  12. Horwitz , S. , Reps, T. , Binkley, D. , "Interprocedural slicing using dependenc e graphs". ACM Transactions on Programming Languages and Systems 12(1), 26-61, 1990.
  13. Loren Larsen, Mary Jean Harrold, "Slicing Object- oriented Software", Published in proceeding of ICSE, 1996, PP-495-505.
Index Terms

Computer Science
Information Sciences

Keywords

Program Slice Dynamic Slice System Dependence Graph Class Dependence Graph Dynamic Graph.

Powered by PhDFocusTM