How many paths are needed for branch testing?
- 1 November 1996
- journal article
- Published by Elsevier in Journal of Systems and Software
- Vol. 35 (2) , 95-106
- https://doi.org/10.1016/0164-1212(95)00089-5
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Unconstrained edges and their application to branch analysis and testing of programsJournal of Systems and Software, 1993
- Measures of testability as a basis for quality assuranceSoftware Engineering Journal, 1990
- Reducing the effects of infeasible paths in branch testingACM SIGSOFT Software Engineering Notes, 1989
- A comparison of some structural testing strategiesIEEE Transactions on Software Engineering, 1988
- Axiomatic approach to Software Metrication through Program DecompositionThe Computer Journal, 1986
- Selecting Software Test Data Using Data Flow InformationIEEE Transactions on Software Engineering, 1985
- On Path Cover Problems in Digraphs and Applications to Program TestingIEEE Transactions on Software Engineering, 1979
- A Complexity MeasureIEEE Transactions on Software Engineering, 1976
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950