Programming complexity: Difference between revisions

Revision as of 12:57, 23 March 2013

Revision as of 13:42, 31 March 2013

Line 5:

* [[cyclomatic complexity|McCabes cyclomatic complexity metric]]

* [[Halstead complexity measures|Halsteads software science metrics]]

* Henry and Kafura introduced Software Structure Metrics Based on Information Flow in 1981<ref>Henry, S.; Kafura, D. IEEE Transactions on Software Engineering Volume SE-7, Issue 5, Sept. 1981 Page(s): 510 - 518</ref> which measures complexity as a function of fan in and fan out. They define fan-in of a procedure as the number of local flows into that procedure plus the number of data structures from which that procedure retrieves information. Fan-out is defined as the number of local flows out of that procedure plus the number of data structures that the procedure updates. Local flows relate to data passed to and from procedures that call or are called by, the procedure in question. Henry and Kafura's complexity value is defined as "the square of procedure length multiplied by the square of fan-in multiplied by fan-out." (Length ×(fan-in × fan-out)²).

* A Metrics Suite for Object Oriented Design<ref>Chidamber, S.R.; Kemerer, C.F. IEEE Transactions on Software Engineering Volume 20, Issue 6, Jun 1994 Page(s):476 - 493</ref> was introduced by Chidamber and Kemerer in 1994 focusing, as the title suggests, on metrics specifically for object oriented code. They introduce six OO complexity metrics; weighted methods per class, coupling between object classes, response for a class, number of children, depth of inheritance tree and lack of cohesion of methods