Length-independent measure of software complexity

Length-independent measure of software complexity

Author(s): T. Andersson, K. Enholm & A. Torn
Abstract:
-independent measure of software complexity T.

Andersson, K.

Enholm & A.

Torn Abo Akademi University, Computer Science ABSTRACT A software complexity concept based on measurement theory is intro- duced.

It is argued that a complexity measure conforming with our em- pirical understanding of complexity schould be independent of software length.

In analogy with the formula for mass, volume and density the measure is defined by W(P) = L(P)c(P), where P is any piece of soft- ware, W(P) the effort in developing it, L(P] its length, and c(P) its com- plexity.

The properties of the measure are discussed and it is found that some of the conflicts in desirable properties reported for other complexity measures are resolved. INTRODUCTION Software complexity is an attribute with many meanings that is used to characterize different entities.

In many cases complexity is defined in such a way that it correlates strongly with the length of a program.

We argue that complexity should...

Pages: 9
Size: 916 kb
Paper DOI: 10.2495/SQM940251

Download the Full Article

Price: US$ 0.00

This article is part of the WIT OpenView scheme and you can download the full text Adobe PDF article for FREE by clicking the 'Openview' icon below.

Send this page to a colleague.

This paper can be found in the following book

Software Quality Management II Vol 1 Managing Quality Systems

Buy Book from
Witpress.com

Download the Full Article

This article is part of the WIT OpenView scheme and you can download the full text Adobe PDF article for FREE by clicking the 'Openview' icon to the right.