DocumentCode :
2264933
Title :
Circuit theoretic approaches to determining software complexity
Author :
Anneberg, L. ; Singh, H.
Author_Institution :
Dept. of Electr. Eng., Lawrence Technol. Univ., Southfield, WI, USA
fYear :
1993
fDate :
16-18 Aug 1993
Firstpage :
895
Abstract :
New methodologies for complexity of software engineering systems are proposed. The new methodologies proposed in this paper are based on the classical approach of McCabe [1976], Halstead [1977], and Ramamurthy and Melton [1988]. In this new method, the McCabe method (based on graph theoretic loops) is modified to take into account the effect of the number of operators and operands. Comparison results for the four methodologies based on different programs are presented. In this paper, a combination of McCabe´s and Halstead´s methods similar to Ramamurthy and Melton is developed
Keywords :
circuit theory; graph theory; software metrics; Halstead´s method; McCabe method; Ramamurthy/Melton method; circuit theoretic approaches; graph theoretic loops; operands; operators; software complexity; software engineering systems; Circuits; Length measurement; Programming; Software debugging; Software engineering; Software maintenance; Software measurement; Software testing; Volume measurement;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 1993., Proceedings of the 36th Midwest Symposium on
Conference_Location :
Detroit, MI
Print_ISBN :
0-7803-1760-2
Type :
conf
DOI :
10.1109/MWSCAS.1993.343212
Filename :
343212
Link To Document :
بازگشت