방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 소프트웨어 복잡도 측정 지표× | 코드 커버리지 분석× | |
|---|---|---|
| 분야 | 소프트웨어공학 | 소프트웨어공학 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1976 | 1988 |
| 창시자≠ | Thomas J. McCabe | Test Coverage Community |
| 유형≠ | quantitative measurement | measurement and analysis |
| 원전≠ | McCabe, T. J. (1976). A complexity measure. IEEE Transactions on Software Engineering, 2(4), 308–320. DOI ↗ | 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 ↗ |
| 별칭≠ | code complexity analysis, complexity measurement | coverage metrics, test coverage, instrumentation-based measurement |
| 관련 | 4 | 4 |
| 요약≠ | 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. | 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. |
| ScholarGate데이터셋 ↗ |
|
|