A Mathematical Framework for the Investigation of Testing

Authors:
J. S. Gourlay
Affiliations:
Department of Computer and Information Science, Ohio State University
Venue:
IEEE Transactions on Software Engineering
Year:
1983

Citing 0
Cited 7

Failure and Fault Analysis for Software Debugging

COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
Test Case Design Based on Z and the Classification-Tree Method

ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
Coverage criteria for state based specifications

Formal methods and testing
Comparing the effectiveness of testing techniques

Formal methods and testing
The influence of multiple artifacts on the effectiveness of software testing

Proceedings of the IEEE/ACM international conference on Automated software engineering
Programs, tests, and oracles: the foundations of testing revisited

Proceedings of the 33rd International Conference on Software Engineering
Testing techniques selection based on ODC fault types and software metrics

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Testing has long been in need of mathematical underpinnings to explain its value as well as its limitations. This paper develops and applies a mathematical framework that 1) unifies previous work on the subject, 2) provides a mechanism for comparing the power of methods of testing programs based on the degree to which the methods approximate program verification, and 3) provides a reasonable and useful interpretation of the notion that successful tests increase one's confidence in the program's correctness.