publication . Article . 2014

A General Testability Theory: Classes, Properties, Complexity, and Testing Reductions

Rodriguez, Ismael; Llana, Luis; Rabanal, Pablo;
Open Access
  • Published: 01 Sep 2014 Journal: IEEE Transactions on Software Engineering, volume 40, pages 862-894 (issn: 0098-5589, eissn: 1939-3520, Copyright policy)
  • Publisher: Institute of Electrical and Electronics Engineers (IEEE)
In this paper we develop a general framework to reason about testing. The difficulty of testing is assessed in terms of the amount of tests that must be applied to determine whether the system is correct or not. Based on this criterion, five testability classes are presented and related. We also explore conditions that enable and disable finite testability, and their relation to testing hypotheses is studied. We measure how far incomplete test suites are from being complete, which allows us to compare and select better incomplete test suites. The complexity of finding that measure, as well as the complexity of finding minimum complete test suites, is identified....
free text keywords: Software, Probabilistic logic, Testability, Functional testing, White-box testing, Model-based testing, Theoretical computer science, Computer science, Test Management Approach, Risk-based testing, Orthogonal array testing
Related Organizations
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue