Open Problems in Testability Transformation

Authors:
Affiliations:
Venue:
ICSTW '08 Proceedings of the 2008 IEEE International Conference on Software Testing Verification and Validation Workshop
Year:
2008

Citing 0
Cited 6

The relationship between search based software engineering and predictive modeling

Proceedings of the 6th International Conference on Predictive Models in Software Engineering
Code-Imp: a tool for automated search-based refactoring

Proceedings of the 4th Workshop on Refactoring Tools
The GISMOE challenge: constructing the pareto program surface using genetic programming to find better programs (keynote paper)

Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering
Dynamic adaptive search based software engineering

Proceedings of the ACM-IEEE international symposium on Empirical software engineering and measurement
Software engineering: an ideal set of challenges for evolutionary computation

Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Cloud engineering is Search Based Software Engineering too

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Testability transformation (tetra) seeks to transform a program in order to make it easier to generate test data. The test data is generated from the transformed version of the program, but it is applied to the original version for testing purposes. A transformation is a testability transfor- mation with respect to a test adequacy criterion if all test data that is adequate for the transformed program is also adequate for the untransformed program. Testability transformation has been shown to be effective at improving coverage for search based test data genera- tion. However, there are many interesting open problems. This paper presents some of these open problems. The aim is to show how testability transformation can be applied to a wide range of testing scenarios.