Expending Aspect Oriented Methodology to Extent of Dynamic Complexity

DOI

No DOI

Published In

Volume 1, Issue 1 (2021)

Published Online

January-February 2021

Pages

21-23

Article Type

Research Article

Check for updates

No DOI available for cross-reference

Multifaceted design expects a basic part to find nature of programming. There are lots of static or collect time estimations open recorded as a hard copy to find multifaceted design of programming, but not a lot of estimations are available to find runtime unpredictability of programming. In this paper, advantage of existing multifaceted design still up in the air by using CodeMR contraption which is an Eclipse module. Further, we introduced one more estimation named DWMC, dynamic weighted method complexity to check multifaceted nature of a class at run time. One more device is purposed named DynaDwmc completed in AspectJusing point of view organized programming to check the value of purposed estimation. Starting then and into the foreseeable future, assessment of static WMC and runtime DWMC metric characteristics is done. An exploratory survey is done on 15 java classes and it is contemplated that purposed metric DWMC expects a colossal part to find multifaceted design, therefore nature of softwaresystem. Watchwords: Dynamic, multifaceted nature, quality, perspective References [1] S.R. Chidamber and C. F. Kemerer, “A Metrics Suite for Object-OrientedDesign”, IEEE Transactions on Software Engineering, vol. 20, no. 6, pp. 476-493,1994. [4]S. Yacoub, H. Ammar, and T. Robinson, “Dynamic Metrics for Object-Oriented designs”, Proc. 5th International Software Metrics Symposium, Boca Raton, Florida, USA, pp.50–61,1999. [5] J. Tian, and M.V. Zelkowitz, “A Formal Program Complexity Model and its Application”, Journal of Systems and Software, vol. 17, no. 3, pp.253-266,1992. [6] D.P. Tegarden, S.D. Sheetz, D.E. Monarchi, “A Software Complexity Model of Object- Oriented Systems”, Decision Support Systems: the International Journal, vol. 13, pp.241-262,1995. [7] J.C. Munson and T.M. Khoshgoftaar, “Measuring Dynamic ProgramComplexity”,IEEE Software, vol. 9, no. 6, pp. 48-55,1992.