On testing non-testable programs

437Citations
Citations of this article
151Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A frequently invoked assumption in program testing is that there is an oracle (i.e. the tester or an external mechanism can accurately decide whether or not the output produced by a program is correct). A program is non-testable if either an oracle does not exist or the tester must expend some extraordinary amount of time to determine whether or not the output is correct. The reasonableness of the oracle assumption is examined and the conclusion is reached that in many cases this is not a realistic assumption. The consequences of assuming the availability of an oracle are examined and alternatives investigated. © 1982 The British Computer Society.

Cite

CITATION STYLE

APA

Weyuker, E. J. (1982). On testing non-testable programs. Computer Journal, 25(4), 465–470. https://doi.org/10.1093/comjnl/25.4.465

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free