Title :
Information flow metrics and complexity measurement
Author :
Sarala, S. ; Abdul Jabbar, P.
Author_Institution :
Dept of CSE, Bharathiar Univ., Coimbatore, India
Abstract :
Complexity metrics takes an important role to predict fault density and failure rate in the software deployment. Information flow represents the flow of data in collective procedures in the processes of a concrete system. The present static analysis of source code and the ability of metrics are incompetent to predict the actual amount of information flow complexity in the modules. In this paper, we propose metrics IF-C, F-(I+O), (C-L) and (P-C) focuses on the improved information flow complexity estimation method, which is used to evaluate the static measure of the source code and facilitates the limitation of the existing work. Using the IF-C method, the framework of information flow metrics can be significantly combined with external flow of the active procedure, which depends on various levels of procedure call in the code.
Keywords :
computational complexity; software metrics; complexity measurement; complexity metrics; data flow; information flow complexity; information flow metrics; software deployment; source code; static analysis; Complexity theory; Magneto electrical resistivity imaging technique; Silicon; code length (C-L); information flow; information flow complexity (IF-C); information flow metrics; procedure call (P-C);
Conference_Titel :
Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on
Conference_Location :
Chengdu
Print_ISBN :
978-1-4244-5537-9
DOI :
10.1109/ICCSIT.2010.5563667