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
Comparing heuristic and machine learning approaches for metric-based code smell detection
TL;DR: A large-scale study to empirically compare the performance of heuristic-based and machine-learning-based techniques for metric-based code smell detection, and considers five code smell types and compares machine learning models with DECOR, a state-of-the-art heuristics-based approach.
Journal ArticleDOI
Improving design quality using meta-pattern transformations: a metric-based approach
TL;DR: This paper proposes a framework whereby object-oriented metrics can be used as indicators for automatically detecting situations for particular transformations to be applied in order to improve specific design quality characteristics.
Journal ArticleDOI
Determinants of software maintenance profiles: an empirical investigation
TL;DR: Examination of modification profiles for 621 software modules in five different business systems of a commercial merchandiser finds that only a small number of modules in these systems is likely to be modified frequently, and that certain maintenance patterns emerge.
Book ChapterDOI
Specification Mining with Few False Positives
Claire Le Goues,Westley Weimer +1 more
TL;DR: This is the first specification miner with such a low false positive rate, and thus a low associated burden of manual inspection, and the technique identifies which input is most indicative of program behavior, which allows off-the-shelf techniques to learn the same number of specifications using only 60% of their original input.
Proceedings ArticleDOI
Criteria for testing exception-handling constructs in Java programs
Saurabh Sinha,Mary Jean Harrold +1 more
TL;DR: A class of adequacy criteria that can be used to test the behavior of exception-handling constructs, and a subsumption hierarchy of the criteria is presented, and the relationship of the criterion to those found in traditional subsumption hierarchies is illustrated.
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.