scispace - formally typeset
Journal ArticleDOI

A Complexity Measure

Reads0
Chats0
TLDR
Several properties of the graph-theoretic complexity are proved which show, for example, that complexity is independent of physical size and complexity depends only on the decision structure of a program.
Abstract
This paper describes a graph-theoretic complexity measure and illustrates how it can be used to manage and control program complexity. The paper first explains how the graph-theory concepts apply and gives an intuitive explanation of the graph concepts in programming terms. The control graphs of several actual Fortran programs are then presented to illustrate the correlation between intuitive complexity and the graph-theoretic complexity. Several properties of the graph-theoretic complexity are then proved which show, for example, that complexity is independent of physical size (adding or subtracting functional statements leaves complexity unchanged) and complexity depends only on the decision structure of a program.

read more

Citations
More filters
Proceedings ArticleDOI

A discriminant metric for module cohesion

TL;DR: A software metric is defined and proposed as a discriminant for classifying modules according to their cohesion and formal properties of the metric are derived which can be used to set the metric value ranges for module classification.
Journal ArticleDOI

Analysis of the effects of software reuse on customer satisfaction in an RPG environment

TL;DR: The results show that when a systematic reuse policy is implemented, such as the adoption of a domain specific library: reuse is significantly positively correlated with customer satisfaction; and there is a significant increase in customer satisfaction.
Journal ArticleDOI

Empirical investigation towards the effectiveness of Test First programming

TL;DR: A controlled experiment that investigated the distinctions between the effectiveness of Test First and that of Test Last (TL) showed that Test First teams spent a larger percentage of time on testing, while this phenomenon was not observed in Test Last teams.
Journal ArticleDOI

Dynamic graph-based software fingerprinting

TL;DR: A software fingerprinting technique in which a dynamic graph fingerprint is stored in the execution state of a program, which is difficult to attack automatically because of the hardness of pointer alias analysis.
Journal ArticleDOI

A survey of business process complexity metrics.

TL;DR: Findings show that few business process complexity metrics have been proposed so far and that even fewer have been validated, and some future research directions are proposed.
References
More filters
Journal ArticleDOI

Structured Programming with go to Statements

TL;DR: For serious students of structured programming, and also for language designers, Knuth's "Structured Programming with go to Statements" is probably the paper to read.
Journal ArticleDOI

Analysis of structured programs

TL;DR: It is shown that an arbitrary program P is reducible to a D-chart if and only if P does not contain a loop with two distinct exits.
Journal ArticleDOI

A genealogy of control structures

TL;DR: It is argued further that there is insufficient evidence to warrant more than if-then-else, while-do, and their variants and the importance of one-in, one-out control structures as operational abstractions.