Now showing items 1-2 of 2
Finiteness and Bounds of Complete Test Point Sets for Program Verification
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1976), CS76003-R
It is proven that there exists a finite set of test points that suffices to establish the equivalence of two programs s and t if some finite set S of programs can be identified that contains both s and t. It is also proven ...
Program Testing and Conditional Correctness
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1976), CS76007-R
It is shown that some beliefs about program testing are incorrect. A new notion of correctness, conditional correctness, is defined. It is then shown that conditional correctness, which can in principle be achieved by ...