DocumentCode :
626376
Title :
Using Projections to Debug Large Combinatorial Models
Author :
Farchi, Eitan ; Segall, Itai ; Tzoref-Brill, Rachel
Author_Institution :
IBM, Haifa Univ., Haifa, Israel
fYear :
2013
fDate :
18-22 March 2013
Firstpage :
311
Lastpage :
320
Abstract :
Combinatorial test design (CTD) is an effective test planning technique that reveals faults resulting from parameters interactions in a system. The test space is manually modeled by a set of parameters, their respective values, and restrictions on the value combinations - referred to as a CTD model. Each possible combination of values in the cross product of the parameters, that is not excluded by restrictions, represents a valid test. A subset of the test space is then automatically constructed so that it covers all valid value combinations of every t parameters, where t is usually a user input. In many real-life testing problems, the relationships between the different test parameters are complex. Thus, precisely capturing them by restrictions in the CTD model might be a very challenging and time consuming task. Since the test space is of exponential size in the number of parameters, it is impossible to exhaustively review all potential tests. In this paper, we present technology that supports the modeling process by enabling repeated reviews of projections of the test space on a subset of the parameters, while indicating how the value combinations under review are affected by the restrictions. In addition, we generate explanations as to why the restrictions exclude specific value combinations of the subsets of parameters under review. These explanations can be used to identify modeling mistakes, as well as to increase the understanding of the test space. Furthermore, we identify specific excluded combinations that may require special attention, and list them for review together with their corresponding exclusion explanation. To enable the review of subsets of the exponential test space, indicate their status, and identify excluded combinations for review, we use a compact representation of the test space that is based on Binary Decision Diagrams. For the generation of explanations we use satisfiability solvers. We evaluate the proposed technology on real-life CT- models and demonstrate its effectiveness.
Keywords :
binary decision diagrams; combinatorial mathematics; computability; program debugging; program testing; CTD model; binary decision diagram; combinatorial test design; satisfiability solver; test planning technique; Avatars; Boolean functions; Data structures; Debugging; Educational institutions; Software; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Software Testing, Verification and Validation Workshops (ICSTW), 2013 IEEE Sixth International Conference on
Conference_Location :
Luxembourg
Print_ISBN :
978-1-4799-1324-4
Type :
conf
DOI :
10.1109/ICSTW.2013.42
Filename :
6571648
Link To Document :
بازگشت