A complexity metrics model for software

dc.contributor.author	Torn, A
dc.contributor.author	Andersson, T
dc.contributor.author	Enholm, K
dc.date.accessioned	2018-06-14T08:23:00Z
dc.date.available	2018-06-14T08:23:00Z
dc.date.issued	1999
dc.identifier.citation	Torn A, Andersson T & Enholm K (1999) A complexity metrics model for software. South African Computer Journal, Number 24, 1999	en
dc.identifier.issn	2313-7835
dc.identifier.uri	http://hdl.handle.net/10500/24371
dc.description.abstract	A complexity metrics model for software is introduced. The model is defined as l( p )c( p ) = e( p ), where p is any piece of software, l( p ) its length, c( p ) an average type complexity measure independent of length, and e( p ) their product. The model is then applied to structural complexity (SC) of collections of software units. Rules for computing SC for the basic structured constructs are given. These make SC sensitive to sequencing, nesting and modularization. The tool may be calibrated to user's perceived model of complexity by specifying some parameters. Arguments for the usability of SC are given by deriving theoretical properties and by a few simple case studies. A Scheme function for computing (l , c,e) for a software unit or a collection of software units is supplied.	en
dc.language.iso	en	en
dc.publisher	South African Computer Society (SAICSIT)	en
dc.subject	Computer program	en
dc.subject	Hierarchical measure	en
dc.subject	Software metrics	en
dc.subject	Structural complexity	en
dc.title	A complexity metrics model for software	en
dc.type	Article	en