Theories of Program Testing and the Application of Revealing Sub-Domains (Classic Reprint) - Tapa blanda

Reseña del editor

Excerpt from Theories of Program Testing and the Application of Revealing Sub-Domains

The theory of test data selection proposed by Goodenough and Gerhart is examined and a number of theoretical and pragmatic deficiencies are identified. The concepts of a revealing test criterion and a revealing subdomain are proposed to overcome some of these weaknesses, and to provide a realistic basis for a theory of testing.

A subset of a program's input domain is revealing if the existence of one incorrectly processed input implies that all the subset's elements are processed incorrectly. The intent of this notion is to partition the program's domain in such a way that all elements of an equivalence class are either processed correctly or incorrectly. A program test set is then formed by choosing one element from each class. The technique is especially useful for programs whose computations depend on a classification of their input domain, but it can also be useful for programs which process their entire domain uniformly.

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.