Author(s)

A. Torn, T. Andersson & K. Enholm

Abstract

A resource model of complexity (RMC) A. Torn, T. Andersson, K. Enholm A bo Akademi University, Computer Science Department, SF-20520 ABO, Finland ABSTRACT In this paper we will review proposed software complexity measures and explore what concepts might lay behind them. We will also look at pro- posed axioms of complexity measures and try to deduce what complexity concepts would comply with these. The result of this study will then be discussed relative to the length-independent measure RMC defined by w(P} = /(P)c(P), where P is any piece of software, w(P) the effort in de- veloping it, l(P) its length, and c(P) its complexity. Application of RMC to both structured programming constructs and to collections of programs is discussed. INTRODUCTION Several software complexity measures correlate strongly with software length measures. As length correlates with effort or cost the complexity measures could thus be used to measure cost. However, then the length measure could be used

Keywords