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
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

RTM: A Relation based Testability Metric for Object Oriented Systems

by Sukhdip Singh, Rajive Kumar, Raghuraj Singh
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 67 - Number 8
Year of Publication: 2013
Authors: Sukhdip Singh, Rajive Kumar, Raghuraj Singh
10.5120/11419-6756

Sukhdip Singh, Rajive Kumar, Raghuraj Singh . RTM: A Relation based Testability Metric for Object Oriented Systems. International Journal of Computer Applications. 67, 8 ( April 2013), 50-56. DOI=10.5120/11419-6756

@article{ 10.5120/11419-6756,
author = { Sukhdip Singh, Rajive Kumar, Raghuraj Singh },
title = { RTM: A Relation based Testability Metric for Object Oriented Systems },
journal = { International Journal of Computer Applications },
issue_date = { April 2013 },
volume = { 67 },
number = { 8 },
month = { April },
year = { 2013 },
issn = { 0975-8887 },
pages = { 50-56 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume67/number8/11419-6756/ },
doi = { 10.5120/11419-6756 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:24:10.899239+05:30
%A Sukhdip Singh
%A Rajive Kumar
%A Raghuraj Singh
%T RTM: A Relation based Testability Metric for Object Oriented Systems
%J International Journal of Computer Applications
%@ 0975-8887
%V 67
%N 8
%P 50-56
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The trend of day for object oriented software is highly complex objects, interacting with each other very rapidly. As a result it is becoming more and more difficult to manage and measure the complexity of the systems being developed. Relation-based testability measure is a metric, to provide the highly desirable insight to the inherent complexity of any object oriented system. We apply relation-based testability measure (RTM) to a University Automation product to measure the complexity of the system at an earlier stage of the development. Based on the approach we have developed an algorithm to measure the overall relational complexity of any object oriented system. The algorithm is very generic, accommodating both the flavors of traditional procedural approach and the modern object oriented approach. Applied at an early development stage, it can be very helpful for design, development and testing teams to co-ordinate their efforts and produce a much better and easy way to handle software product.

References
  1. McCabe, T. J. , 1976. A Complexity Measure. IEEE Transactions on Software Engineering, SE-2 (4), 308-320.
  2. Halstead, M. H. 1997. Elements of Software Science, Elsevier NorthHolland, New York.
  3. Harrison. W. 1992. An Entropy-based Measure of Software Complexity. IEEE Transactions on Software Engineering, 18(11), 1025-1029.
  4. Misra, S. 2006. Modified Cognitive Complexity Measure, In: 21st ISCIS'06, LNCS, vol. 4263,. 1050-59.
  5. Misra, S. 2006. A Complexity Measure based on Cognitive Weights. International Journal of Theoretical and Applied Computer Science, 1(1), 1-10.
  6. Wang, Y. , and J. Shao 2003. Measurement of the Cognitive Functional Complexity of Software, In: IEEE International Conference on Cognitive Informatics, ICCI'03, 67-71.
  7. Wang, Y. and Shao, J. 2003 A New Measure of Software Complexity based on Cognitive Weights. Canadian Journal of Electrical & Computer Engineering, 28(2), 69-74.
  8. Chhabra, J. K, K. K. Aggarwal, and Y. Singh 2003. Code and Data Spatial Complexity: Two Important Software Understandability Measures. Information and Software Technology. 45(8), 539-546.
  9. Chhabra, J. K, K. K. Aggarwal, and Y. Singh 2004. Measurement of Object Oriented Software Spatial Complexity. Information and Software Technology, 46(10), 689-699.
  10. Douce, C. R. , P. J. Layzell, and J. Buckley, 1999. Spatial Measures of Software Complexity. In 11th Meeting of Psychology of Programming Interest Group, http://www. ppig. org/workshops/11th-programme. html
  11. Chhabra, J. K, K. K. Aggarwal, and Y. Singh , 2004, A Unified Measure of Complexity of Object-Oriented Software. Journal of the Computer Society of India, 34(3), 2-13
  12. Weyuker, E. J. , 1988. Evaluating Software Complexity Measure. IEEE Transaction on Software Engineering, 14(9), 1357-136
  13. Briand, L. C. , S. Morasca, and V. R. Basili, 1996. Property based Software Engineering Measurement. IEEE Transactions on Software Engineering, 22(1), 68-86.
  14. Chidamber, S. , and Kemerer, C. , 1994. A Metrics Suite for Object-Oriented Design. IEEE Transactions on Software Engineering, 20(6),
  15. Tegarden, D. P. , S. D. Sheetz, and D. E. Monarchi, 1992. The Effectiveness of Traditional Metrics for Object-Oriented Systems. In Twenty-Fifth Hawaii International Conference on System Sciences, Vol IV, IEEE Computer Society Press.
  16. Tian, J. , and M. V. Zelkowitz, 1992. A Formal Program Complexity Model and its Application. J. Systems Software, 17, 253-266.
  17. Lakshmanian, K. B. , S. Jayaprakash, P. K. Sinha, 1991. Properties of Control-Flow Complexity Measures. IEEE Transaction on Software Engineering, 17(2), 1289-1295.
  18. Pressman Roger S. , Software Engineering :A Practitioner's Approach, 5th Edition, 448-450
  19. J. vaos , L Morrel and K Miller , 1991. Predicting Where faults Can hide from Testing, IEEE Software, 8, 41-48 .
  21. J. McGregor and S. Srinivas,1996. A Measure of Testing E?ort. In Proceedings of the Conference on Object-Oriented Technologies, USENIX Association, 129–142.
  22. R. Freedman, 1991. Testability of Software Components. IEEE Transactions on Software Engineering, 17(6), 553–564.
  23. S. Jungmayr,2002. Identifying test-critical dependencies. In Proceedings of the International Conference on Software Maintenance, IEEE Computer Society, 404–413.
  24. R. Binder, 1994. Design for testability in object-oriented systems. Communications of the ACM, 37(9), 87–101.
  25. B. Henderson-Sellers, 1996. Object Oriented Metrics. Prentice Hall, New Jersey.
  26. L. C. Briand, J. W. Daly, and J. K. W¨ust, 1999. A uni?ed framework for coupling measurement in object-oriented systems. IEEE Transactions on Software Engineering, 25(1), 91–121.
  27. Sukhdip Singh , 2008 . Testability of Object Oriented Software : A Review. Proceedings of National Conference on Information Security & Mobile Computing 174-177.
Index Terms

Computer Science
Information Sciences

Keywords

Cyclomatic Complexity(CC) Structural Complexity (SC) Total Cyclomatic Complexity of Module (TCCM)

Powered by PhDFocusTM