Abstract
We present a general framework allowing to classify testing problems into five testability classes. Classes differ in the number of tests we must apply to precisely determine whether the system is correct or not. The conditions that enable/disable finite testability are analyzed. A general method to reduce a testing problem into another is presented. The complexity of finding complete test suites and measuring the suitability of incomplete suites is analyzed. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Rodríguez, I. (2009). A general testability theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5710 LNCS, pp. 572–586). https://doi.org/10.1007/978-3-642-04081-8_38
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
