Iyengar, SS and Parameshwaran, N and Fuller, J (1982) A measure of logical complexity of programs. In: Computer Languages, 7 (3-4). pp. 147-160.
m1.pdf - Published Version
Restricted to Registered users only
Download (673Kb) | Request a copy
The research in software science has so far been concentrated on three measures of program complexity: (a) software effort; (b) cyclomatic complexity; and (c) program knots. In this paper we propose a measure of the logical complexity of programs in terms of the variable dependency of sequence of computations, inductive effort in writing loops and complexity of data structures. The proposed complexity mensure is described with the aid of a graph which exhibits diagrammatically the dependence of a computation at a node upon the computation of other (earlier) nodes. Complexity measures of several example programs have been computed and the related issues have been discussed. The paper also describes the role played by data structures in deciding the program complexity.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Elsevier Science.|
|Keywords:||Complexity measure;Data structure;Programming Software;Graph theory;Cyclomatic complexity|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||03 Feb 2010 07:21|
|Last Modified:||19 Sep 2010 05:35|
Actions (login required)