CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 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

Test Path Selection of Polymorphic Call-sites

by Anshu Bansal, Rajesh K. Bhatia
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 103 - Number 4
Year of Publication: 2014
Authors: Anshu Bansal, Rajesh K. Bhatia
10.5120/18061-8993

Anshu Bansal, Rajesh K. Bhatia . Test Path Selection of Polymorphic Call-sites. International Journal of Computer Applications. 103, 4 ( October 2014), 15-18. DOI=10.5120/18061-8993

@article{ 10.5120/18061-8993,
author = { Anshu Bansal, Rajesh K. Bhatia },
title = { Test Path Selection of Polymorphic Call-sites },
journal = { International Journal of Computer Applications },
issue_date = { October 2014 },
volume = { 103 },
number = { 4 },
month = { October },
year = { 2014 },
issn = { 0975-8887 },
pages = { 15-18 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume103/number4/18061-8993/ },
doi = { 10.5120/18061-8993 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:33:40.393945+05:30
%A Anshu Bansal
%A Rajesh K. Bhatia
%T Test Path Selection of Polymorphic Call-sites
%J International Journal of Computer Applications
%@ 0975-8887
%V 103
%N 4
%P 15-18
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The paper proposes System Dependence Graph (SDG) based algorithm to select different test paths for testing polymorphic call-sites. SDG, includes control and data dependencies, helps both the testers and developers of object-oriented programs to better understand the polymorphic interactions within the software. In addition, the algorithm considers only the method bindings of a polymorphic call-site having different definition sets. As a result, the number of test paths for testing polymorphism gets reduced. Also, the algorithm has been implemented in a prototype Graphical User Interface (GUI) based tool. The results are obtained by using the tool, which demonstrate the proposed technique.

References
  1. R. T. Alexander and J. Offutt, Coupling-based Testing of O-O Programs, Journal of Universal Computer Science (J. UCS), 2004, vol. 10, no. 4, pp. 391-427.
  2. R. T. Alexander and J. Offutt, Criteria for Testing Polymorphic Relationships, in Proceedings of the 11th International Symposium on Software Reliability and Engineering (ISSRE'00), San Jose, California, 2000, pp. 15–23.
  3. R. T. Alexander and J. Offutt, Analysis Techniques for Testing Polymorphic Relationships, in Proceedings of the Sixth IEEE International Conference on Engineering of Complex Computer Systems (ICECCS '00), Tokyo, Japan, 2000, pp. 172-178.
  4. M. J. Harrold and J. D. McGregor, Incremental testing of object-oriented class structures, Department of Computer Science, Clemson University, Clemson, SC, USA, 1987.
  5. D. E. Perry and G. E. Kaiser, Adequacy Testing and Object-Oriented Programming, Journal of Object Oriented Programming, 1990, vol. 2, no. 5, pp. 13-19.
  6. S. Barbey and A. Strohmeier, The Problematics of Testing Object-Oriented Software, in Proceedings of SQM'94 Second Conference on Software Quality Management, Edinburgh, Scotland, UK, 1994, vol. 2, pp. 411-426.
  7. P. G. Frankl and E. J. Weyuker, An Applicable Family of Data Flow Testing Criteria, IEEE Transactions on Software Engineering, October 1988, vol. 14, no. 10, pp. 1483-1498.
  8. A. Orso and M. Pezze, Integration Testing of Procedural Object-Oriented Programs with Polymorphism, in Proceedings of the 16th International Conference on Testing Computer Software: Future Trends in Testing (TCS'99), Washington D. C. , June 1999.
  9. R. T. Alexander, Testing the Polymorphic Relationships of Object-oriented Programs, Dissertation, George Mason University, 2001.
  10. R. T. Alexander, J. Offutt, and A. Stefik, Testing Coupling Relationships in Object-Oriented Programs, George Mason University, June 2009, vol. 20, no. 4, pp. 291-327, http://onlinelibrary. wiley. com/doi/10. 1002/stvr. 417/abstract [13 September, 2010].
  11. D. Parnas, On the criteria to be used in decomposing a system into modules, Communications of the ACM, 1972, vol. 15, no. 12, pp. 1053–1058.
  12. L. L. Constantine and E. Yourdon, Structured Design, Prentice-Hall, Englewood Cliffs NJ, 1979.
  13. S. Supavita and T. Suwannasart, Testing Polymorphic Interactions in UML Sequence Diagrams, in Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05), 2005.
  14. D. K. Saini, Testing Polymorphism in Object Oriented Systems for Improving software Quality, in Proceedings of SIGSOFT, March 2009, vol. 34, no. 2, pp. 1-5.
  15. F. E. Allen, Control flow analysis, in Proceedings of a Symposium on Compiler Optimization, July 1970, vol. 5, no. 7, pp. 1–19.
  16. J. Ferrante, K. J. Ottenstein, and J. D. Warren, The program dependence graph and its use in optimization, ACM Transactions on Programming Languages and Systems, July 1987, vol. 9, no. 3, pp. 319-349.
  17. K. J. Ottenstein, Data-Flow Graphs as an Intermediate Program Form, PhD thesis, Computer Sciences Department. , Purdue University, Lafayette, IN, August 1978.
  18. S. Horwitz, T. Reps, and D. Binkley, Interprocedural slicing using dependence graphs, ACM Transactions on Programming Languages and Systems, January 1990, vol. 12, no. 1, pp. 26-60.
  19. B. G. Ryder, Constructing the call graph of a program, IEEE Transactions on Software Engineering, May 1979, vol. 5, no. 3, pp. 216–226.
  20. E. S. F. Najumudheen, R. Mall, and D. Samanta, A Dependence Representation for Coverage Testing of Object-Oriented Programs, Journal of Object Technology (JOT), 2010, vol. 9, no. 4, pp. 1-23.
  21. L. Larsen and M. J. Harrold, Slicing object-oriented software, in Proceedings of the 18th International Conference on Software Engineering, Berlin, Germany, March 1996, pp. 495–505.
Index Terms

Computer Science
Information Sciences

Keywords

System Dependence Graph Polymorphic Method Test Paths.

Powered by PhDFocusTM