ACM Home Page
Please provide us with feedback. Feedback
Testability, fault size and the domain-to-range ratio: An eternal triangle
Full text PdfPdf (259 KB)
Source International Symposium on Software Testing and Analysis archive
Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis table of contents
Portland, Oregon, United States
Pages: 168 - 172  
Year of Publication: 2000
ISBN:1-58113-266-2
Also published in ...
Authors
Martin R. Woodward  Computer Science Dept., Univ. of Liverpool, Liverpool, UK
Zuhoor A. Al-Khanjari  Computer Science Dept., Sultan Qaboos Univ., Sultanate of Oman
Sponsor
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 55,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/347324.349016
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Bainbridge, J., "Defining testability metrics axiomatically", Software Testing, Verification and Reliability, 4(2), 63-80 (June 1994).
 
3
 
4
 
5
DeMillo, R.A., Guindi, D.S., McCracken, W.M., Offutt, A.J. and King, K.N., "An extended overview of the Mothra software testing environment", Proc. Second Workshop on Software Testing, Verification and Analysis, Banff, Canada, IEEE Press, pp. 142-151 (July 1988).
 
6
 
7
8
9
 
10
How Tai Wah, K.S., "A theoretical study of fault coupling", Software Testing, Verification and Reliability, 10(1), 3-45 (March 2000).
 
11
12
 
13
 
14
 
15
 
16
 
17
 
18
Voas, J.M., Miller, K.W. and Noonan, R., "Designing programs that do not hide data state errors during random black-box testing", Proc. 5th Int. Conf. on Putting into Practice Methods and Tools for Information System Design, Nantes, France (Sept. 1992).
 
19

Collaborative Colleagues:
Martin R. Woodward: colleagues
Zuhoor A. Al-Khanjari: colleagues