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
Revisiting Unsupervised Learning for Defect Prediction
Wei Fu,Tim Menzies +1 more
TL;DR: This paper rejects the specific conclusions of Yang et al. and refutes the results where unsupervised defect predictors outperformed supervised predictors for effort-aware just-in-time defect prediction, and encourages others to work in this promising area.
Proceedings ArticleDOI
Empirical Analysis of the Relationship between CC and SLOC in a Large Corpus of Java Methods
TL;DR: There is no strong linear correlation between CC and SLOC of Java methods, so it is concluded that CC is redundant with SLOC, which contradicts earlier claims, but concurs with the widely accepted practice of measuring of CC next to SLOC.
Journal ArticleDOI
Innovation and cumulative culture through tweaks and leaps in online programming contests.
TL;DR: In this article, the authors studied the dynamics of cumulative culture using a large-scale data set from online collaborative programming competitions run over 14 years and showed that performance increases over time through frequent "tweaks" of the current best entry and rare innovative "leaps" (successful tweak:leap ratio = 16:1), the latter associated with substantially greater variance in performance.
Journal ArticleDOI
A proposal for measuring the structural complexity of programs
R. Adamov,L. Richter +1 more
TL;DR: The structural model introduces another structural complexity dimension and uses it to pursue a thorough treatment of the complexity issue to treat the problem of composite structural complexity determination of software packages.
Journal ArticleDOI
Using software metrics to allocate testing resources
TL;DR: The most uniform allocation of resources per error is obtained through the use of software complexity metrics, however, the allocation was not perfect in any of the strategies considered, suggesting that additional work must be performed to arrive at better approaches to allocation.
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.