Software testability: Difference between revisions

Content deleted Content added
Added {{more footnotes}} tag to article (TW)
Line 35:
 
Based on the amount of test cases required to construct a complete test suite in each context (i.e. a test suite such that, if it is applied to the implementation under test, then we collect enough information to precisely determine whether the system is correct or incorrect according to some specification), a testability hierarchy with the following testability classes has been proposed:<ref>I. Rodríguez, L. Llana, P. Rabanal (2014) “A General Testability Theory: Classes, properties, complexity, and testing reductions”. IEEE Transactions on Software Engineering. doi link: http://doi.ieeecomputersociety.org/10.1109/TSE.2014.2331690</ref><ref>I. Rodríguez (2009) "A General Testability Theory". CONCUR 2009, Springer, LNCS 5710, pp.572–586. doi: 10.1007/978-3-642-04081-8_38</ref>
 
* Class I: there exists a finite complete test suite.
 
* Class II: any partial distinguishing rate (i.e. any incomplete capability to distinguish correct systems from incorrect systems) can be reached with a finite test suite.
 
* Class III: there exists a countable complete test suite.
 
* Class IV: there exists a complete test suite.
 
* Class V: all cases.