Martin, Johannes J.2013-06-192013-06-191976http://hdl.handle.net/10919/20268It 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.application/pdfenIn CopyrightTechnical reportCS76003-Rhttp://eprints.cs.vt.edu/archive/00000809/01/CS76003-R.pdf