방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 소프트웨어 복잡도 측정 지표× | 정적 코드 분석× | |
|---|---|---|
| 분야 | 소프트웨어공학 | 소프트웨어공학 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1976 | 2001 |
| 창시자≠ | Thomas J. McCabe | David Engler and William Pugh |
| 유형≠ | quantitative measurement | automated analysis |
| 원전≠ | McCabe, T. J. (1976). A complexity measure. IEEE Transactions on Software Engineering, 2(4), 308–320. DOI ↗ | Chess, B., & West, J. (2007). Secure Programming with Static Analysis. Addison-Wesley Professional. link ↗ |
| 별칭≠ | code complexity analysis, complexity measurement | static analysis, code inspection, automated review |
| 관련 | 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. | Static code analysis automatically examines source code without execution, detecting potential bugs, security vulnerabilities, code smells, and style violations. Pioneered by Engler and Pugh (2001), automated analysis tools scan codebases at scale, identifying defect patterns faster than manual review. Organizations integrate static analysis into continuous integration pipelines to prevent defects early. |
| ScholarGate데이터셋 ↗ |
|
|