A Mathematical Framework for the Investigation of Testing

1 November 1983

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering

Vol. SE-9 (6) , 686-709
https://doi.org/10.1109/tse.1983.235433

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.

Keywords

This publication has 13 references indexed in Scilit:

Data Abstraction, Implementation, Specification, and Testing
ACM Transactions on Programming Languages and Systems, 1981
Formal program testing
Published by Association for Computing Machinery (ACM) ,1981
Theories of Program Testing and the Application of Revealing Subdomains
IEEE Transactions on Software Engineering, 1980
A Domain Strategy for Computer Program Testing
IEEE Transactions on Software Engineering, 1980
On the proof of correctness of a calendar program
Communications of the ACM, 1979
Test data as an aid in proving program correctness
Communications of the ACM, 1978
Algebraic program testing
Acta Informatica, 1978
Reliability of the Path Analysis Testing Strategy
IEEE Transactions on Software Engineering, 1976
An Approach to Program Testing
ACM Computing Surveys, 1975
Toward a theory of test data selection
IEEE Transactions on Software Engineering, 1975