# Finiteness and Bounds of Complete Test Point Sets for Program Verification

1976) Finiteness and Bounds of Complete Test Point Sets for Program Verification. Technical Report CS76003-R, Computer Science, Virginia Tech. (

Full text available as: |

## Abstract

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 that the expected number of those test points is bounded by the logarithm of the cardinality of S.

Item Type: | Departmental Technical Report |
---|---|

Keywords: | program testing, correctness proofs, existence of test points, number of test points |

Subjects: | Computer Science > Historical Collection(Till Dec 2001) |

ID Code: | 809 |

Deposited By: | Administrator, Eprints |

Deposited On: | 27 April 2006 |