Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Test de partitionnement par équivalence× | Métriques de complexité logicielle× | |
|---|---|---|
| Domaine | Génie logiciel | Génie logiciel |
| Famille | Process / pipeline | Process / pipeline |
| Année d'origine≠ | 1979 | 1976 |
| Auteur d'origine≠ | Glenford Myers | Thomas J. McCabe |
| Type≠ | partitioning strategy | quantitative measurement |
| Source fondatrice≠ | Myers, G. J. (1979). The Art of Software Testing. John Wiley & Sons. link ↗ | McCabe, T. J. (1976). A complexity measure. IEEE Transactions on Software Engineering, 2(4), 308–320. DOI ↗ |
| Alias≠ | equivalence partitioning, BVA, boundary value analysis | code complexity analysis, complexity measurement |
| Apparentées | 4 | 4 |
| Résumé≠ | Equivalence partitioning divides input domains into equivalence classes—sets of inputs expected to behave identically—then selects test cases from each class. Introduced by Myers (1979), this technique reduces test cases while maintaining effectiveness. Boundary value analysis (BVA) complements partitioning by testing values at partition boundaries where failures often occur. | 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 ↗ |
|
|