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 December 2024
Reseach Article

A Novel Technique for Call Graph Reduction for Bug Localization

by Prabhdeep Singh, Shalini Batra
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 47 - Number 15
Year of Publication: 2012
Authors: Prabhdeep Singh, Shalini Batra
10.5120/7261-0049

Prabhdeep Singh, Shalini Batra . A Novel Technique for Call Graph Reduction for Bug Localization. International Journal of Computer Applications. 47, 15 ( June 2012), 1-5. DOI=10.5120/7261-0049

@article{ 10.5120/7261-0049,
author = { Prabhdeep Singh, Shalini Batra },
title = { A Novel Technique for Call Graph Reduction for Bug Localization },
journal = { International Journal of Computer Applications },
issue_date = { June 2012 },
volume = { 47 },
number = { 15 },
month = { June },
year = { 2012 },
issn = { 0975-8887 },
pages = { 1-5 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume47/number15/7261-0049/ },
doi = { 10.5120/7261-0049 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:41:54.433482+05:30
%A Prabhdeep Singh
%A Shalini Batra
%T A Novel Technique for Call Graph Reduction for Bug Localization
%J International Journal of Computer Applications
%@ 0975-8887
%V 47
%N 15
%P 1-5
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In today's era, software industries are competing for software quality which depends upon the sound software testing phase. To deliver the quality product the most challenging job for software industry is to localize bugs automatically and fix them before release. One of the techniques for automated bug localization is usage of call graph. Since size of the call graph generated is quite large, various call reduction approaches have been proposed. In this paper a novel approach for call graph reduction has been proposed where the size of the call graph is reduced without changing the basic structure and no major loss of the information is incurred. The output generated using the proposed methodology shows promising results.

References
  1. W. Sadiq, M. E. Orlowska, "Applying Graph Reduction Techniques for Identifying Structural Conflicts in Process Models Distributed Systems Technology", Proceeding of the 11th International Conference on Advanced Information Systems Engineering, 1999, pp. 195–209.
  2. I. R. Katz, J. R. Anderson, "Debugging: an analysis of bug-location strategies", Human Computer Interaction, 1987, pp. 351–399.
  3. R. Hastings,B. Joyce, "Purify: Fast detection of memory leaks and access errors", Proceedings of the Winter USENIX Conference, 1992, pp. 125.
  4. O. Lhotak, "Comparing Call Graphs", Proceedings of the 7th ACM Sigplan-sigsoft Workshop on Program Analysis for Software Tools and Engineering, PASTE 07, San Diego, California, USA, 2007, pp. 37-42.
  5. L. Dietz, V. Dallmeier, A. Zeller, T. Scheffer "Localizing Bugs in Program Executions with Graphical Models", Advances in Neural Information Processing Systems 22,Proceedings of the Conference, Vancouver, Canada, 2009, pp. 468-477.
  6. W. Ren, R. Beard, E. Atkins, "Information consensus in multivehicle cooperative control" Control Systems, IEEE, Vol. 27, No. 2, 2007, pp. 71 -82.
  7. G. Shi, Weiwei "A Graph Reduction Approach to Symbolic Circuit Analysis" Proceeding of Design Automation Conference, 2007.
  8. S. K. Lukins, N. A. Kraft, L. H. Etzkorn, "Source Code Retrieval for Bug Localization using Latent Dirichlet Allocation, "Proceedings of the 15th Working Conference on Reverse Engineering, 2008, pp. 155-164.
  9. D. Binkley, "Source Code Analysis: A Road Map" Proceedings of the 29th International Conference on Software Engineering, 2007.
  10. Boris Beizer, "Software Testing Techniques", Van Nostrand Reinhold Co. , 2nd Ed. , 1990.
  11. L. Dietz, V. Dallmeier, A. Zeller, T. Scheffer "Localizing Bugs in Program Executions with Graphical Models", Advances in Neural Information Processing Systems 22,Proceedings of the Conference, Vancouver, Canada, 2009, pp. 468-477.
  12. B. Ryder, "Constructing the call graph of a program", Software Engineering, IEEE Transactions on,vol. SE-5, no. 3, 1979, pp. 216 – 226.
  13. X. Hu, T. Chiueh, K. G. Shin, "Large-scale malware indexing using function-call graphs", ACM Conference on Computer and Communications Security, E. AlShaer, S. Jha, A. FD. Keromytis,Eds,2009, pp. 611–620.
  14. C. Liu, X Yan, H Yu, J Han,. , P. S. Yu, "Mining Behavior Graphs for Backtrace" of Noncrashing Bugs". In: Proc. of the 5th Int. Conf. on Data Mining, 2005
  15. Di Fatta, G. Leue, S. Stegantova,"Discriminative Pattern Mining in Software Fault Detection". In: Proc. of the 3rd Int. Workshop on Software Quality Assurance,2006.
Index Terms

Computer Science
Information Sciences

Keywords

Call Graph Reduction Bug Localization Call Graph