Cited in
(51)- Reading beside the lines: Using indentation to rank revisions by complexity
- String patterns of leading digits
- On the detection of unstructuredness in flowgraphs
- Cyclomatic numbers do not measure complexity of unstructured programs
- Complexity measures for concurrent programs based on information- theoretic metrics
- Measuring prime program complexity
- The subprogram problem for software metric design
- Choosing the best model: Level of detail, complexity, and model performance
- Using software complexity measures to analyze algorithms -- an experiment with the shortest-paths algorithms.
- Algorithmic complexity of recursive and inductive algorithms
- An entropy based measure for comparing distributions of complexity
- Quantification of software code coverage using artificial bee colony optimization based on Markov approach
- Analysis of high structural class coupling in object-oriented software systems
- Project for intercomparison of landsurface parameterization schemes: Application of some structural complexity metrics
- FEVS: a functional equivalence verification suite for high-performance scientific computing
- Partition refinement of component interaction automata
- Why there is no general solution to the problem of software verification
- Software defect prediction model based on distance metric learning
- Multiscale horizontal visibility entropy: measuring the temporal complexity of financial time series
- A generalized mathematical theory of structured programming
- Complexity of node coverage games
- Spectral complexity of directed graphs and application to structural decomposition
- Secure cloud model for intellectual privacy protection of arithmetic expressions in source codes using data obfuscation techniques
- Computing ripple effect for software maintenance
- Evaluation method of software reliability based on SPN model
- Obfuscation combiners
- Partial evaluation for Java malware detection
- Control flow graphs and code coverage
- The servicisation of the cutting tool supply chain
- Flowchart recognition—a syntactic approach
- Using the support vector machine as a classification method for software defect prediction with static code metrics
- Software Defect Classification: A Comparative Study of Rough-Neuro-fuzzy Hybrid Approaches with Linear and Non-linear SVMs
- A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS
- Divergent exploration in design with a dynamic multiobjective optimization formulation
- On the number of cycles in a graph
- Semi-automatic grammar recovery
- Design, implementation and evolution of object oriented frameworks: concepts and guidelines
- On the estimation of the parameters for the Littlewood model in software reliability
- Measures for evaluating the software agent pro-activity
- Applications of the quantum algorithm for st-connectivity
- Partial evaluation of string obfuscations for Java malware detection
- Software modules categorization through likelihood and bayesian analysis of finite dirichlet mixtures
- Complexity of leading digit sequences
- Exact solution of the evasive flow capturing problem
- The design of decision trees in the framework of granular data and their application to software quality models
- The structured complexity of object-oriented programs
- Formalization of structural test cases coverage criteria for quantum software testing
- Distance-based (and path-based) covering problems for graphs of given cyclomatic number
- A dynamic temporal logic for quality of service in choreographic models
- Survey questionnaires and graphs
- An efficient method to generate feasible paths for basis path testing
This page was built for publication: A Complexity Measure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4122801)
