scispace - formally typeset
Journal ArticleDOI

A Complexity Measure

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
Journal ArticleDOI

Reverse engineering: algorithms for program graph production

TL;DR: The paper illustrates the algorithms that use F(p) to generate program graph models for measurement, documentation and testing activities and refers to procedural languages, D‐structured programs and one‐in/one‐out modules.
Proceedings ArticleDOI

Improving source code readability: theory and practice

TL;DR: It is shown that current readability models fail to capture readability improvements, and tools to calculate additional metrics, to detect refactorings, and to detect style problems are able to capture characteristics that are specific to readability changes and thus should be considered by futurereadability models.
Journal ArticleDOI

Robustness analysis of cognitive information complexity measure using Weyuker properties

TL;DR: It has been found that all the nine properties have been satisfied by cognitive information complexity measure and hence it is established that information contained in the software as a robust and well-structured one.
Journal ArticleDOI

Software Design Representation Using Abstract Process Networks

TL;DR: An approach to software design representation which is consistent with the concept of engineering blueprints is presented and an abstract process network schema ofSoftware design representation is developed and supported by an algebraic system of notation.
Journal ArticleDOI

ConPredictor: Concurrency Defect Prediction in Real-World Applications

TL;DR: ConPredictor as mentioned in this paper combines static and dynamic program metrics to predict defects specific to concurrent programs by combining a set of novel static code metrics based on the unique properties of concurrent programs and leverage additional guidance from dynamic metrics constructed based on mutation analysis.
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.