手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| ソフトウェア複雑性メトリクス× | 静的コード解析× | |
|---|---|---|
| 分野 | ソフトウェア工学 | ソフトウェア工学 |
| 系統 | 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データセット ↗ |
|
|