Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Analyse de la couverture de code× | Métriques de complexité logicielle× | |
|---|---|---|
| Domaine | Génie logiciel | Génie logiciel |
| Famille | Process / pipeline | Process / pipeline |
| Année d'origine≠ | 1988 | 1976 |
| Auteur d'origine≠ | Test Coverage Community | Thomas J. McCabe |
| Type≠ | measurement and analysis | quantitative measurement |
| Source fondatrice≠ | Zhu, H., Hall, P. A. V., & May, J. H. R. (1997). Software unit test coverage and adequacy. ACM Computing Surveys, 29(4), 366–427. DOI ↗ | McCabe, T. J. (1976). A complexity measure. IEEE Transactions on Software Engineering, 2(4), 308–320. DOI ↗ |
| Alias≠ | coverage metrics, test coverage, instrumentation-based measurement | code complexity analysis, complexity measurement |
| Apparentées | 4 | 4 |
| Résumé≠ | Code coverage analysis measures the extent to which source code is executed by a test suite, quantifying which lines, branches, or paths are exercised. Tools instrument code to track execution, reporting coverage percentages and identifying untested regions. Coverage analysis guides test creation, detects dead code, and validates test adequacy in quality assurance processes. | Software complexity metrics quantify the structural and operational difficulty of code through numerical measurements. Introduced by Thomas McCabe in 1976, cyclomatic complexity became the foundational approach. These metrics assess maintainability, testability, and defect risk, enabling teams to identify problematic code regions and guide refactoring efforts. |
| ScholarGateJeu de données ↗ |
|
|