Testing: an abstract approach
John C. Cherniavsky, Rick Statman · 2003
The authors continue their studies of testing fundamentals. They deemphasize the connection between their testing theory and inductive interference (though they still exist), constructing a set-based theory without reference to inductive inference. They introduce some complexity results for testing simple classes of programs by developing a game-theoretic approach to testing. From this the authors obtain feasibility and infeasibility results. Finally, they develop a theory of testing in the limit analogous to similar concept in inductive inference and learnability theory.>