Software testability

This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (September 2014) (Learn how and when to remove this message)

Software testability is the degree to which a software artifact (i.e. a software system, software module, requirements- or design document) supports testing in a given test context. If the testability of the software artifact is high, then finding faults in the system (if it has any) by means of testing is easier.

Formally, some systems are testable, and some are not. This classification can be achieved by noticing that, to be testable, for a functionality of the system under test "S", which takes input "I", a computable functional predicate "V" must exists such that ${\displaystyle V(S,I)}$ is true when S, given input I, produce a valid output, false otherwise. This function "V" is known as the verification function for the system with input I.

Many software systems are untestable, or not immediately testable. For example, Google's ReCAPTCHA, without having any metadata about the images is not a testable system. Recaptcha, however, can be immediately tested if for each image shown, there is a tag stored elsewhere. Given this meta information, one can test the system.

Therefore, testability is often thought of as an extrinsic property which results from interdependency of the software to be tested and the test goals, test methods used, and test resources (i.e., the test context). Even though testability can not be measured directly (such as software size) it should be considered an intrinsic property of a software artifact because it is highly correlated with other key software qualities such as encapsulation, coupling, cohesion, and redundancy.

The correlation of 'testability' to good design can be observed by seeing that code that has weak cohesion, tight coupling, redundancy and lack of encapsulation is difficult to test.^[1]

A lower degree of testability results in increased test effort. In extreme cases a lack of testability may hinder testing parts of the software or software requirements at all.

Testability, a property applying to empirical hypothesis, involves two components. The effort and effectiveness of software tests depends on numerous factors including:

• Properties of the software requirements
• Properties of the software itself (such as size, complexity and testability)
• Properties of the test methods used
• Properties of the development- and testing processes
• Qualification and motivation of the persons involved in the test process

The testability of software components (modules, classes) is determined by factors such as:

• Controllability: The degree to which it is possible to control the state of the component under test (CUT) as required for testing.
• Observability: The degree to which it is possible to observe (intermediate and final) test results.
• Isolateability: The degree to which the component under test (CUT) can be tested in isolation.
• Separation of concerns: The degree to which the component under test has a single, well defined responsibility.
• Understandability: The degree to which the component under test is documented or self-explaining.
• Automatability: The degree to which it is possible to automate testing of the component under test.
• Heterogeneity: The degree to which the use of diverse technologies requires to use diverse test methods and tools in parallel.

The testability of software components can be improved by:

• Test-driven development
• Design for testability (similar to design for test in the hardware domain)

Requirements need to fulfill the following criteria in order to be testable:

• consistent
• complete
• unambiguous
• quantitative (a requirement like "fast response time" can not be verification/verified)
• verification/verifiable in practice (a test is feasible not only in theory but also in practice with limited resources)

Treating the requirement as axioms, testability can be treated via asserting existence of a function ${\displaystyle F_{S}}$ (software) such that input ${\displaystyle I_{k}}$ generates output ${\displaystyle O_{k}}$, therefore ${\displaystyle F_{S}:I\to O}$. Therefore, the ideal software generates the tuple ${\displaystyle (I_{k},O_{k})}$ which is the input-output set ${\displaystyle \Sigma }$, standing for specification.

Now, take a test input ${\displaystyle I_{t}}$, which generates the output ${\displaystyle O_{t}}$, that is the test tuple ${\displaystyle \tau =(I_{t},O_{t})}$. Now, the question is whether or not ${\displaystyle \tau \in \Sigma }$ or ${\displaystyle \tau \not \in \Sigma }$. If it is in the set, the test tuple ${\displaystyle \tau }$ passes, else the system fails the test input. Therefore, it is of imperative importance to figure out : can we or can we not create a function that effectively translates into the notion of the set indicator function for the specification set ${\displaystyle \Sigma }$.

By the notion, ${\displaystyle 1_{\Sigma }}$ is the testability function for the specification ${\displaystyle \Sigma }$. The existence should not merely be asserted, should be proven rigorously. Therefore, obviously without algebraic consistency, no such function can be found, and therefore, the specification cease to be termed as testable.

• Testability

• Robert V. Binder: Testing Object-Oriented Systems: Models, Patterns, and Tools, ISBN 0-201-80938-9
• Stefan Jungmayr: Improving testability of object-oriented systems, ISBN 3-89825-781-9
• Wanderlei Souza: Abstract Testability Patterns, ISSN 1884-0760
• Boris Beizer: [1], Software Testing Techniques