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

Effort and Quality of Recovering Requirements-to-Code Traces: Two Exploratory Experiments

TL;DR: Surprising observations are yields: trace capture is surprisingly fast and can be done within minutes even for larger classes; the quality of the captured trace links, while good, does not improve with higher trace effort; and it is not harder though slightly more expensive to recover the trace links for larger, more complex classes.
Book ChapterDOI

ATLTest: a white-box test generation approach for ATL transformations

TL;DR: This paper provides a white-box test model generation approach for ATL model transformations and shows how this approach can be helpful to improve the quality of testing techniques in the model transformation domain.
Proceedings ArticleDOI

Estimating the costs of software maintenance tasks

H.M. Sneed
TL;DR: This paper proposes ways of extending current cost estimation methods to the estimation of maintenance costs, by means of impact analysis, proportional sizing, quality assessment and productivity adjustment.
Book ChapterDOI

Approaches for Business Process Model Complexity Metrics

TL;DR: This paper discusses how the ideas known from software complexity research can be used for analyzing the complexity of BPMs and discusses rather simple BPM languages (like process charts) only.
Journal ArticleDOI

On the Structure of Total Synthesis of Complex Natural Products

TL;DR: In this paper, a chemically intuitive measure for molecular complexity is described and applied to several syntheses of complex natural products, and the authors conclude that the metric corresponds well with chemical ideas of complexity, and that different syntheses do in fact have appreciably different logical structures as measured by this.
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.