Total views : 192

Competent Dependence Graph Acclimatize as Intermediate Representation to Effectuate the Best Slicing Technique for Object Oriented Programs

Affiliations

  • Punjab Technical University, Jalandhar, Punjab, India
  • Apeejay Institute of Management Technical Campus, Punjab Technical University, Jalandhar, Punjab, India

Abstract


Objective: The main objective of this paper is to propose a Program Slicing Technique that includes more number of features than available in any other slicing technique. Methods: Numerous slicing techniques have been originated for enhancing the outcropping of Program Slicing. Simultaneously varied intermediate representation for representing the important features and dependencies of statements of a program on one another has been created for the easiness of creating the slicing technique. Unvaried part in varied techniques while concentrating on one good feature to be interpolated was overlooking some other important features. The flawed areas of the Available techniques have been found and based on the solution to overcome them, the technique is proposed that will consist of all important features with taking care of their flawed areas. Findings: Intermediate representation of a program accompanied by an algorithm is proposed to surpass the existing graphs by covering their flawed areas and by including more number of features than available in any other existing representation or technique. Conclusion: From the case studies it is concluded that the important features like Fault localization, Change Impact Analysis, Better Visualization etc can be achieved with a single technique. Added advantage is the complexity is reduced, accuracy and efficiency in terms of space and time is improved.

Keywords

Change Impact Analysis, Dependence Graph, Fault Localization, Program Slicing, Slicing Technique.

Full Text:

 |  (PDF views: 169)

References


  • Ottenstein KJ, Ottenstein LM. The program dependence graph in a software development environment. Proceedings of the 1st ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments; 1984 May. p. 177-84. Doi:10.1145/800020.808263
  • Horwitz S, Reps T, Binkley D. Inter procedural slicing using dependence. PLDI’88 Proceedings of the ACM SIGPLAN 1988 Conference on Programming Language Design and Implementation; 1988. p. 35-46. Doi: 10.1145/53990.53994
  • Kashima Y, Ishio T, Etsuda S, Inoue K. Variable data-flow graph for lightweight program slicing and visualization. IEICE Trans INF and Syst. 2015 Jun; E98(6):1194-205
  • Larsen L, Harrold MJ. Slicing object-oriented software. Proceedings of 18th International Conference on Software Engineering; Berlin. 1996. p. 495–505.
  • Agarwal H, Horgam JR. Dynamic program slicing. Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation; 1990. p. 246-56. Doi: 10.1145/93542.93576, 246-256
  • Zhao J. Dynamic slicing of object-oriented programs. Wuhan University Journal of Natural Sciences. 2001; 6(1-2):391-7.
  • Deng F, Jones JA. Weighted system dependence graph. IEEE 5th International Conference on Software Testing, Verification, Validation; Montreal, QC. 2012. p. 380-9.
  • Zhang X, Gupta N, Gupta R. Pruning dynamic slices with confidence. Proceedings of ACM Conference on Programming Language Design and Implication; 2006 Jun. p. 169-80.
  • Mund GB, Mall R, Sarkar S. An efficient dynamic program slicing technique. Department of Computer Science and Engineering, IIT Kharagpur. 2002; 44(2):123-32.
  • Baah GK, Podgurski A, Harrold MJ. The probabilistic program dependence graph and its application to fault diagnosis. IEEE Trans Softw Eng. 2010 Jul; 36(4):528-45.
  • Bouteraa I, Bounour N. Towards The use of program slicing in the change impact analysis of aspect oriented programs. Proceedings International Arab Conference on Information Technology (ACIT); Arabia Saudita. 2011.
  • Walkinshaw N, Strathclyde U, Glasgow UK, Roper M, Wood M. Java system dependence graph. Proceedings of 3rd IEEE International Workshop; Amsterdam, Netherlands. 2003 26-27 Sept. p. 55-64.
  • Doi: 10.1109/SCAM.2003.1238031
  • Sikka P, Kaur K. Program slicing techniques and their need in aspect oriented programming. International Journal of Computer Applications. 2013; 70(3):11-4. Doi: 10.5120/11941-7735
  • Zhang X, Gupta R, Zhang Y. Precise dynamic slicing algorithms. 25th International Conference on Software Engineering (ICSE’03); Portland. 2003 May. p. 319-29.

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.