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 Tutorial On the design, experimentation and application of metaheuristic algorithms to real-World optimization problems
Eneko Osaba,Esther Villar-Rodriguez,Javier Del Ser,Antonio J. Nebro,Daniel Molina,Antonio LaTorre,Ponnuthurai Nagaratnam Suganthan,Carlos A. Coello Coello,Francisco Herrera +8 more
TL;DR: This work aims at providing the audience with a proposal of good practices which should be embraced when conducting studies about metaheuristics methods used for optimization in order to provide scientific rigor, value and transparency.
Journal ArticleDOI
Predictive Mutation Testing
TL;DR: PMT constructs a classification model, based on a series of features related to mutants and tests, and uses the model to predict whether a mutant would be killed or remain alive without executing it, and has high predictability when predicting the execution results of the majority of mutants.
Journal ArticleDOI
Open source software in quantum computing
TL;DR: A wide range of open source software for quantum computing is reviewed, covering all stages of the quantum toolchain from quantum hardware interfaces through quantum compilers to implementations of quantum algorithms, as well as all quantum computing paradigms, including quantum annealing, and discrete and continuous-variable gate-model quantum computing.
Journal ArticleDOI
Flexible and robust CAD models for design automation
TL;DR: Novel methodologies for enabling Multidisciplinary Design Optimization of complex engineering products, and the concept of High Level CAD templates (HLCt) will be proposed and discussed as the building blocks of flexible and robust CAD models, which in turn enables high fidelity geometry in the MDO loop.
Journal ArticleDOI
A study of the applicability of complexity measures
J.S. Davis,Richard J. LeBlanc +1 more
TL;DR: Experimentation with variants of chunk-oriented measures showed that one should judiciously select measurable software attributes as proper indicators of what one wishes to predict, rather than hoping for a single, all-purpose complexity measure.
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.