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

Straightening Spaghetti-Code with Refactoring?

TL;DR: The results of this experiment indicate that tool support is immature and the impact of refactoring is limited if the code base has gone astray for a longer period of time.
Book

Sharing Data and Models in Software Engineering

TL;DR: Data Science for Software Engineering: Sharing Data and Models as mentioned in this paper presents guidance and procedures for reusing data and models between projects to produce results that are useful and relevant, with commentary that highlight the methods that are most useful, and applicable to the widest range of projects.
Proceedings ArticleDOI

Defining metric thresholds for software product lines: a comparative study

TL;DR: This paper aims at comparing three methods to derive thresholds based on a benchmark of 33 SPLs to assess to what extent these methods derive appropriate values for four metrics used in product-line engineering.
Journal ArticleDOI

On the Cognitive Complexity of Software and its Quantification and Formal Measurement

TL;DR: The cognitive complexity of software presented in this paper is a new measurement for cross-platform analysis of complexities, functional sizes, and cognition efforts of software code and specifications in the phases of design, implementation, and maintenance in software engineering.
Proceedings ArticleDOI

Some Metrics for Accessing Quality of Product Line Architecture

TL;DR: The main feature of this approach is to assess the quality of product line architecture by analyzing its formal vADL specification, and therefore the process of metric computation can be automated completely.
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.