SOFTWARE COMPLEXITY MEASURE.

Ramamurthy Bina

SOFTWARE COMPLEXITY MEASURE.

Ramamurthy Bina

Department of Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

A new complexity measure which combines the bulk complexity of Halstead's software science 'effort' and McCabe's control flow complexity has been synthesized. Basically the measure is the software science effort measure with McCabe's cyclomatic complexity incorporated into it by a new concept called the weighted operator-operand count. Applying a new theorem that relates the nesting level of a structure and the cyclomatic complexity associated with the structure, and a classification scheme for operators and operands, the weighted count of operators and operands are determined. These counts are then used to determine the software complexity of the program under consideration.

Original language	English
Title of host publication	Unknown Host Publication Title
Publisher	ACM
Pages	178
Number of pages	1
ISBN (Print)	089791127X
State	Published - 1984

Cite this

@inproceedings{c571641029794ad0be18e42137604f8f,

title = "SOFTWARE COMPLEXITY MEASURE.",

abstract = "A new complexity measure which combines the bulk complexity of Halstead's software science 'effort' and McCabe's control flow complexity has been synthesized. Basically the measure is the software science effort measure with McCabe's cyclomatic complexity incorporated into it by a new concept called the weighted operator-operand count. Applying a new theorem that relates the nesting level of a structure and the cyclomatic complexity associated with the structure, and a classification scheme for operators and operands, the weighted count of operators and operands are determined. These counts are then used to determine the software complexity of the program under consideration.",

author = "Ramamurthy Bina",

year = "1984",

language = "English",

isbn = "089791127X",

publisher = "ACM",

pages = "178",

booktitle = "Unknown Host Publication Title",

}

TY - GEN

T1 - SOFTWARE COMPLEXITY MEASURE.

AU - Bina, Ramamurthy

PY - 1984

Y1 - 1984

N2 - A new complexity measure which combines the bulk complexity of Halstead's software science 'effort' and McCabe's control flow complexity has been synthesized. Basically the measure is the software science effort measure with McCabe's cyclomatic complexity incorporated into it by a new concept called the weighted operator-operand count. Applying a new theorem that relates the nesting level of a structure and the cyclomatic complexity associated with the structure, and a classification scheme for operators and operands, the weighted count of operators and operands are determined. These counts are then used to determine the software complexity of the program under consideration.

AB - A new complexity measure which combines the bulk complexity of Halstead's software science 'effort' and McCabe's control flow complexity has been synthesized. Basically the measure is the software science effort measure with McCabe's cyclomatic complexity incorporated into it by a new concept called the weighted operator-operand count. Applying a new theorem that relates the nesting level of a structure and the cyclomatic complexity associated with the structure, and a classification scheme for operators and operands, the weighted count of operators and operands are determined. These counts are then used to determine the software complexity of the program under consideration.

UR - https://www.scopus.com/pages/publications/0021568132

M3 - Conference contribution

AN - SCOPUS:0021568132

SN - 089791127X

SP - 178

BT - Unknown Host Publication Title

PB - ACM

ER -

SOFTWARE COMPLEXITY MEASURE.

Abstract

Other files and links

Fingerprint

Cite this