A formal notion of program-based test data adequacy

Information and Control

Volumn 56, Issue 1-2, 1983, Pages 52-71

  Davis, Martin D ^a   Weyuker, Elaine J ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

EID: 0020495943     PISSN: 00199958     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0019-9958(83)80050-3     Document Type: Article

References (17)

1. Mutation Analysis
2. A measure of software complexity
3. Pseudo-oracles for non-testable programs
4. Hints on test data selection: Help for the practicing programmer
5. On the use of the cyclomatic number to measure program complexity
6. Measurement of program complexity by the pair
7. Algebraic program testing
8. Weak Mutation Testing and Completeness of Test Sets
9. A Complexity Measure
10. An extension to the cyclomatic measure of program complexity
11. Theories of Program Testing and the Application of Revealing Subdomains
12. An Error-Based Testing Strategy
13. On Testing Non-Testable Programs
14. A Domain Strategy for Computer Program Testing
15. A Measure of Control Flow Complexity in Program Text