### Abstract

A number of different concepts have been proposed that, loosely speaking, revolve around the notion of software testability. Indeed, the concept of testability itself has been interpreted in a variety of ways by the software community. One interpretation is concerned with the extent of the modifications a program component requires, in terms of its input and output variables, so that the entire behaviour of the component is observable and controllable. Another interpretation is the ease with which faults, if present in a program, can be revealed by the testing process and the propagation, infection and execution (PIE) model has been proposed as a method of estimating this. It has been suggested that this particular interpretation of testability might be linked with the metric domain-to-range ratio (DRR), i.e. the ratio of the cardinality of the set of all inputs (the domain) to the cardinality of the set of all outputs (the range). This paper reports work in progress exploring some of the connections between the concepts mentioned. In particular, a simple mathematical link is established between domain-to-range ratio and the observability and controllability aspects of testability. In addition, the PIE model is re-considered and a relationship with fault size is observed. This leads to the suggestion that it might be more straightforward to estimate PIE testability by an adaptation of traditional mutation analysis. The latter suggestion exemplifies the main goals of the work described here, namely to seek greater understanding of testability in general and, ultimately, to find easier ways of determining it.

Original language | English |
---|---|

Title of host publication | Proceedings of the ACM SIGSOFT 2000 International Symposium on Software Testing and Analysis |

Editors | M.J. Harrold, M.J. Harrold |

Pages | 168-172 |

Number of pages | 5 |

Publication status | Published - 2000 |

Event | ISSTA 00 Proceedings of the ACM SIGSOFT 2000 International Symposium on Software Testing and Analysis - Portland, OR, United States Duration: Aug 21 2000 → Aug 24 2000 |

### Other

Other | ISSTA 00 Proceedings of the ACM SIGSOFT 2000 International Symposium on Software Testing and Analysis |
---|---|

Country | United States |

City | Portland, OR |

Period | 8/21/00 → 8/24/00 |

### Fingerprint

### Keywords

- Controllability
- Domain-to-range ratio
- Fault size
- Observability
- Testability

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*Proceedings of the ACM SIGSOFT 2000 International Symposium on Software Testing and Analysis*(pp. 168-172)

**Testability, fault size and the domain-to-range ratio : An eternal triangle.** / Woodward, Martin R.; Al-Khanjari, Zuhoor A.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the ACM SIGSOFT 2000 International Symposium on Software Testing and Analysis.*pp. 168-172, ISSTA 00 Proceedings of the ACM SIGSOFT 2000 International Symposium on Software Testing and Analysis, Portland, OR, United States, 8/21/00.

}

TY - GEN

T1 - Testability, fault size and the domain-to-range ratio

T2 - An eternal triangle

AU - Woodward, Martin R.

AU - Al-Khanjari, Zuhoor A.

PY - 2000

Y1 - 2000

N2 - A number of different concepts have been proposed that, loosely speaking, revolve around the notion of software testability. Indeed, the concept of testability itself has been interpreted in a variety of ways by the software community. One interpretation is concerned with the extent of the modifications a program component requires, in terms of its input and output variables, so that the entire behaviour of the component is observable and controllable. Another interpretation is the ease with which faults, if present in a program, can be revealed by the testing process and the propagation, infection and execution (PIE) model has been proposed as a method of estimating this. It has been suggested that this particular interpretation of testability might be linked with the metric domain-to-range ratio (DRR), i.e. the ratio of the cardinality of the set of all inputs (the domain) to the cardinality of the set of all outputs (the range). This paper reports work in progress exploring some of the connections between the concepts mentioned. In particular, a simple mathematical link is established between domain-to-range ratio and the observability and controllability aspects of testability. In addition, the PIE model is re-considered and a relationship with fault size is observed. This leads to the suggestion that it might be more straightforward to estimate PIE testability by an adaptation of traditional mutation analysis. The latter suggestion exemplifies the main goals of the work described here, namely to seek greater understanding of testability in general and, ultimately, to find easier ways of determining it.

AB - A number of different concepts have been proposed that, loosely speaking, revolve around the notion of software testability. Indeed, the concept of testability itself has been interpreted in a variety of ways by the software community. One interpretation is concerned with the extent of the modifications a program component requires, in terms of its input and output variables, so that the entire behaviour of the component is observable and controllable. Another interpretation is the ease with which faults, if present in a program, can be revealed by the testing process and the propagation, infection and execution (PIE) model has been proposed as a method of estimating this. It has been suggested that this particular interpretation of testability might be linked with the metric domain-to-range ratio (DRR), i.e. the ratio of the cardinality of the set of all inputs (the domain) to the cardinality of the set of all outputs (the range). This paper reports work in progress exploring some of the connections between the concepts mentioned. In particular, a simple mathematical link is established between domain-to-range ratio and the observability and controllability aspects of testability. In addition, the PIE model is re-considered and a relationship with fault size is observed. This leads to the suggestion that it might be more straightforward to estimate PIE testability by an adaptation of traditional mutation analysis. The latter suggestion exemplifies the main goals of the work described here, namely to seek greater understanding of testability in general and, ultimately, to find easier ways of determining it.

KW - Controllability

KW - Domain-to-range ratio

KW - Fault size

KW - Observability

KW - Testability

UR - http://www.scopus.com/inward/record.url?scp=0034592888&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034592888&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0034592888

SN - 1581132662

SP - 168

EP - 172

BT - Proceedings of the ACM SIGSOFT 2000 International Symposium on Software Testing and Analysis

A2 - Harrold, M.J.

A2 - Harrold, M.J.

ER -