Designing Software Product Lines for Testability
Data(s) |
01/07/2010
|
---|---|
Resumo |
Software product line (SPL) engineering offers several advantages in the development of families of software products such as reduced costs, high quality and a short time to market. A software product line is a set of software intensive systems, each of which shares a common core set of functionalities, but also differs from the other products through customization tailored to fit the needs of individual groups of customers. The differences between products within the family are well-understood and organized into a feature model that represents the variability of the SPL. Products can then be built by generating and composing features described in the feature model. Testing of software product lines has become a bottleneck in the SPL development lifecycle, since many of the techniques used in their testing have been borrowed from traditional software testing and do not directly take advantage of the similarities between products. This limits the overall gains that can be achieved in SPL engineering. Recent work proposed by both industry and the research community for improving SPL testing has begun to consider this problem, but there is still a need for better testing techniques that are tailored to SPL development. In this thesis, I make two primary contributions to software product line testing. First I propose a new definition for testability of SPLs that is based on the ability to re-use test cases between products without a loss of fault detection effectiveness. I build on this idea to identify elements of the feature model that contribute positively and/or negatively towards SPL testability. Second, I provide a graph based testing approach called the FIG Basis Path method that selects products and features for testing based on a feature dependency graph. This method should increase our ability to re-use results of test cases across successive products in the family and reduce testing effort. I report the results of a case study involving several non-trivial SPLs and show that for these objects, the FIG Basis Path method is as effective as testing all products, but requires us to test no more than 24% of the products in the SPL. |
Formato |
application/pdf |
Identificador |
http://digitalcommons.unl.edu/computerscidiss/8 http://digitalcommons.unl.edu/cgi/viewcontent.cgi?article=1023&context=computerscidiss |
Publicador |
DigitalCommons@University of Nebraska - Lincoln |
Fonte |
Computer Science and Engineering: Theses, Dissertations, and Student Research |
Palavras-Chave | #Software Product Lines #Testing #Testability #Computer Engineering #Computer Sciences |
Tipo |
text |