Compara mètodes
Revisa els mètodes seleccionats l'un al costat de l'altre; les files que difereixen es ressalten.
| Anàlisi de Cobertura de Codi× | Mètrica de complexitat del programari× | |
|---|---|---|
| Camp | Enginyeria de programari | Enginyeria de programari |
| Família | Process / pipeline | Process / pipeline |
| Any d'origen≠ | 1988 | 1976 |
| Autor original≠ | Test Coverage Community | Thomas J. McCabe |
| Tipus≠ | measurement and analysis | quantitative measurement |
| Font seminal≠ | 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 ↗ |
| Àlies≠ | coverage metrics, test coverage, instrumentation-based measurement | code complexity analysis, complexity measurement |
| Relacionats | 4 | 4 |
| Resum≠ | 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. |
| ScholarGateConjunt de dades ↗ |
|
|