T. J. McCabe. A complexity measure. In ICSE 1976. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Applying Patterns to Develop Extensible - And Maintainable Orb (Correct)
.... (1) the number of methods required to implement key ORB tasks (such as connection management, request transfer, socket and request demultiplexing, marshaling, and dispatching) 2) the total non comment lines of code for these methods, and (3) the average McCabe Cyclometric Complexity metric v(G) [23] of the methods. The v(G) metric uses graph theory to correlate code complexity with the number of Forces Resolving Pattern(s) Abstracting low level system calls Wrapper Facade ORB event demultiplexing Reactor ORB connection management Acceptor, Connector Efficient concurrency models Active ....
T. J. McCabe, "A Complexity Measure," IEEE Transactions on Software Engineering, vol. SE-2, Dec. 1976.
Hardware-Software Covalidation: Fault Models and Test Generation - Harris (Correct)
....the total number of control flow paths grows exponentially with the number of conditional statements, several researchers have attempted to select a subset of all control flow paths which are sufficient for testing. One path selection criterion is presented in [11] based on work in software test [12]) identifies basis set of paths, a subset of paths which are linearly independent and can be composed to form any other path. Previous work in software test [13, 14, 15, 16, 17] have investigated dataflow testing criteria for path selection. In dataflow testing, each variable occurrence is ....
T. J. McCabe, "A complexity measure", IEEE Transactions on Software Engineering, vol. SE-2, pp. 308--320, December 1976.
VOCAL: A Framework For Test Identification Deployment - Duncan Pemberton And (Correct)
....1) Communication Commonality [19] 2) Data Commonality [19] MAINTAINABILITY Design and implementation of maintenance patches should be possible in a limited time period. 1) Probability That Failed System Is Restored To Operable Condition In A Specified Time [15] 2) Cyclomatic Complexity [8, 23, 38] PERFORMANCE The system should be capable of meeting or exceeding a specified throughput. Algorithms taking an unacceptable amount of time to complete should be avoided. Acceptable completion times should be stated within this viewpoint. 1) Operational Throughput Per Second against ....
MCCABE, T. J.: "A Complexity Measure" IEEE Trans. On Softw. Eng., 1976, 2 (4) pp. 308 - 320.
Complexity Measure Evaluation and Selection - Tian, Zelkowitz (1995) (2 citations) (Correct)
.... With program complexity, we want to predict those external properties of a program, such as reliability, understandability, and maintainability, through more tangible internal measures that capture concrete aspects of a program, such as control flow complexity (e.g. McCabe s cyclomatic number [12]) volume (e.g. statement count and Halstead s software science measures [11] or information content (e.g. prime program complexity [1] In this paper we consider various criteria which aid the selection of internal complexity measures to predict those external properties. Internal measures ....
....understand his own poorly structured one than a more structured version written by someone else [17] While external measures have the most impact on the software development cycle, they are harder to quantify than internal ones. As a result, research strives to derive good internal measures [11, 12] and to establish correlations between internal and external measures by empirical study [2, 4, 15] However, there is no systematic way to use these studies to aid the selection process. One approach has been to develop formal axiomatic models of complexity [10, 13, 14, 18, 20, 22] In our model ....
T. J. McCabe, "A complexity measure," IEEE Trans. Soft. Eng., Vol. 2, No. 6, pp 308-320, 1976.
Metrics for XML Document Collections - Klettke, Schneider, Heuer (2002) (1 citation) (Correct)
....number of nodes in the DTD graph as a result. Structure complexity In the previous paragraph, we introduced the metric Size that is based on the number of elements and attributes of the DTD. Another metric evaluates the complexity of the DTD structure. Subsequently, we adapt the McCabe measure [McC76] developed for evaluating the control ow of software. Therefore, we add additional edges in our DTD graph if quanti ers and occur and if mixed content elements (but not #PCDATA) exist. These extensions of the graph are according to the treatment of repetitions in software modules. Figure 5 ....
Thomas J. McCabe. A complexity measure. In IEEE Transactions on Software Engineering, volume SE2(4), pages 308-320, December 1976.
A Survey of Software Metrics - Riguzzi (Correct)
....phase and the metrics for choesion and coupling defined in [Briand et al. 94] for the design phase. For the implementation phase we describe the suite of metrics for OO designs by [Chidameber, Kemerer 94] Lines of Code [Conte et al. 86] Software Science [Halstead 75] and Cyclomatic Number [McCabe 76] Keywords: Software engineering, software metrics. DEIS Technical Report no. DEIS LIA 96010 LIA series no. 17 1. Introduction The field of software metrics is a relatively young one, whose origins can be found in the work by Halstead published in 1972. From then on, the interest in software ....
.... the requirements phase we present function points, for the design phase the metrics by [Briand et al. 94] For the implementation phase we describe the suite of metrics for OO designs by [Chidameber, Kemerer 94] Lines of Code [Conte et al. 86] Software Science [Halstead 75] and Cyclomatic Number [McCabe 76] In Section 7 we summarize the main points treated 2. Uses of measurement Measurement has two broad uses: for assessment and prediction [Fenton 94] Examples of using metrics for assessment are: 1. monitoring the advancement of a project in order to take the appropriate corrective ....
[Article contains additional citation context not shown here]
T. McCabe, A Complexity Measure, IEEE Trans. Software Eng., 2(4), 1976, pp. 308-320. 30
The Java Metrics Reporter - An Extensible Tool for OO.. - Cahill, Hogan, Thomas (2002) (Correct)
....more difficult it is to comprehend and maintain. 3.3 Complexity Metrics Complexity metrics are those which measure structural complexity with the flow on effect of their relationship to the cognitive complexity of the system. There are three metrics in this category. Cyclomatic Complexity (CC) [8] measures the number of distinct linearly independent paths through a block of code, or in other words, the amount of decision logic. While there are a number of ways of calculating this quantity, the most convenient is to use the number of decision nodes plus one, where a decision node is a ....
McCabe, T. "A Complexity Measure." IEEE Transactions on Software Engineering, December 1976.
Using Machine Learning to Predict Project Effort: Empirical.. - Boetticher (2001) (1 citation) (Correct)
....Also, corporations are not willing to share their project data with other organizations, so building up a sufficient amount of project data for constructing a model is very difficult. Automation of data collection. Many popular mature software metrics exist such as size, cyclomatic complexity [30], and program vocabulary [22] for characterizing software products (e.g. software programs) There are many publicly available wellestablished tools for extracting these metrics. Boehm [6] first described a bottom up approach in 1981. Interestingly, a literature search does not reveal the use of ....
McCabe, T.J., "A Complexity Measure," IEEE Transactions on Software Engineering, 2 4, December 1976, pp. 308-320.
Comparing Case-based Reasoning Classifiers for Predicting.. - Emam, Benlarbi, Goel (1999) (4 citations) (Correct)
....the conditional statements are tested, a pending node cannot be accessed. When programming style conventions require that there be no dead code , a positive value on this metric indicates that code intended to be functional is not executable [28] 29] Cyclomatic The cyclomatic complexity number [40]. Global The number of global variables that are used. This metric was used in [44] 33] Table 1: Product metrics collected. The above source code metrics were specifically selected since previous work has identified that they are not necessarily redundant [28] 3.3 Dependent Variable The ....
T. McCabe: "A Complexity Measure". In IEEE Transactions on Software Engineering, 2(4):308-320, 1976.
Demystifying Maintainability - Manfred Broy Broy (Correct)
No context found.
T. J. McCabe. A complexity measure. In ICSE 1976.
Determinants of Software Maintenance Profiles: An Empirical .. - Kemerer, Slaughter (1997) (2 citations) (Correct)
No context found.
McCabe, T. (1976) `A complexity measure', Transactions on Software Engineering, SE-2(4), 308--320.
Model-Based Identification of Fault-Prone Components - Wagner, Jürjens (2005) (Correct)
No context found.
McCabe, T.: A Complexity Measure. IEEE Trans. Software Eng. 5 (1976) 45--50
Informing the Design of Pipeline-Based Software Visualisations - Churcher, Irwin (2005) (Correct)
No context found.
McCabe, T. J. (1976), `A complexity measure', IEEE Transactions on Software Engineering SE-2, 308--319.
Towards a Standard Family of Languages for Matching.. - Dekel, Cohen, Porat (2003) (Correct)
No context found.
T. J. McCabe. A complexity measure. IEEE Trans. Softw. Eng., 2(4):308--320, Dec. 1976.
Independent Validation of a Component Metrics Suite - Goulao, Abreu (2004) (Correct)
No context found.
T. McCabe, "A Complexity Measure", IEEE Transactions on Software Engineering, vol. 2, pp. 308-320, 1976.
Using Object-Oriented Metrics for Automatic Design Flaws - Detection In Large (Correct)
No context found.
T.J. McCabe. A Complexity Measure. IEEE Trans. Software Eng., Vol. 2, No. 4, December, 1976.
YAAB (Yet Another AST Browser): Using OCL to navigate ASTs - Antoniol Di Penta (2003) (Correct)
No context found.
T. McCabe, "A complexity measure," IEEE Transactions on Software Engineering, vol. 2, no. 4, 1976.
A Study of Software Metrics - Klasky (Correct)
No context found.
McCabe, T. J. "A Complexity Measure", IEEE Trans. Software Eng. SE-2 (4) (Dec. 1976), pp. 308-320.
Towards a Standard Family of Languages for Matching Patterns - In Source Code (Correct)
No context found.
T. J. McCabe. A complexity measure. IEEE Trans. Softw. Eng., 2(4):308--320, Dec. 1976.
Revealing Class Structure with Zoomable Concept Lattices - Dekel, Gil (2003) (Correct)
No context found.
T. J. McCabe. A complexity measure. IEEE Trans. Softw. Eng., 2(4):308--320, Dec. 1976.
Fault Models and Test Generation for Hardware-Software.. - Ian Harris Department (Correct)
No context found.
T. J. McCabe, "A complexity measure", IEEE Transactions on Software Engineering, vol. SE-2, pp. 308--320, December 1976.
Metrics for XML Document Collections - Lars (2002) (1 citation) (Correct)
No context found.
Thomas J. McCabe. A complexity measure. In IEEE Transactions on Software Engineering, volume SE2(4), pages 308-320, December 1976.
Studies of Model Selection and Regularization for Generalization in .. - Guo (Correct)
No context found.
T. J. McCabe, "A Complexity Measure," IEEE Trans. on Software Engineering, vol. SE-2, no. 4, pp. 308--320, 1976. 182
Profiling Software Through the Use of Metrics - Robillard, Coupal, Coallier (1991) (2 citations) (Correct)
No context found.
T. J. McCabe, `A complexity measure', IEEE Trans. Software Eng., SE-2 (4), 308--320 (1976).
Measuring Perceived Software Quality - Xenos, Christodoulakis (1997) (Correct)
No context found.
McCabe, T J, `A complexity measure', IEEE Trans. Soft. Eng. SE2 (4), pp. 208-320, 1976
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC