Finiteness and Bounds of Complete Test Point Sets for Program Verification

Simple item page
dc.contributor.authorMartin, Johannes J.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:07Zen
dc.date.available2013-06-19T14:36:07Zen
dc.date.issued1976en
dc.description.abstractIt 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.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000809/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000809/01/CS76003-R.pdfen
dc.identifier.trnumberCS76003-Ren
dc.identifier.urihttp://hdl.handle.net/10919/20268en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleFiniteness and Bounds of Complete Test Point Sets for Program Verificationen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CS76003-R.pdf
Size:
296.28 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports