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 ArticleDOI
A method and tool for assessing object-oriented projects and metrics management
F. Fioravanti,Paolo Nesi +1 more
TL;DR: The experience of the authors in interpreting assessment results and defining a tool and a method for the assessment of object-oriented systems is reported and a specific assessment tool has been built and used as a research prototype in several projects.
Journal ArticleDOI
Using sensitivity analysis to validate a state variable model of the software test process
TL;DR: It is shown that sensitivity analysis can suggest structural improvements in a model when the model does not behave as expected, and thereby the STP is suggested.
Journal ArticleDOI
Software test effort estimation
TL;DR: In order to estimate the testing effort, this paper makes an attempt to establish Cognitive Information Complexity Measure (CICM) as an appropriate estimation tool.
Journal ArticleDOI
Towards complexity metrics for Ada tasking
TL;DR: A Petri net graph model of Ada rendezvous is used to introduce a rendezvous graph, an abstraction that can be useful in viewing and computing effective communication complexity.
Journal ArticleDOI
Is lines of code a good measure of effort in effort-aware models?
TL;DR: This paper performs an empirical study on four open source projects and finds that using LOC as a measure for effort does not significantly affect the list of files being flagged, however, using LOC under-estimates the amount of effort required compared to the best effort predictor by approximately 66%.
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.