Show simple item record

dc.contributor.authorYu, Linbinen_US
dc.date.accessioned2013-10-23T00:00:25Z
dc.date.available2013-10-23T00:00:25Z
dc.date.issued2013-10-23
dc.date.submittedJanuary 2013en_US
dc.identifier.otherDISS-12305en_US
dc.identifier.urihttp://hdl.handle.net/10106/23951
dc.description.abstractCombinatorial testing (CT) has been shown to be a very effective testing strategy. Given a system with n parameters, t-way combinatorial testing, where t is typically much smaller than n, requires that all t-way combinations, i.e., all combinations involving any t parameter values, be covered by at least one test. This dissertation focuses on two important problems in combinatorial testing, including constrained test generation and combinatorial sequence testing.For the first problem, we focus on constraint handling during combinatorial test generation. Constraints over input parameters are restrictions that must be satisfied in order for a test to be valid. Constraints can be handled either using constraint solving or using forbidden tuples. An efficient algorithm is proposed for constrained test generation using constraint solving. The proposed algorithm extends an existing combinatorial test generation algorithm that does not handle constraints, and includes several optimizations to improve the performance of constraint handling. Experimental results on both synthesized and real-life systems demonstrate the effectiveness of the propose algorithm and optimizations.For the second problem, the domain of t-way testing is expanded from test data generation to test sequence generation. Many programs exhibit sequence-related behaviors. We first formally define the system model and coverage for t-way combinatorial sequence testing, and then propose four algorithms for test sequence generation. These algorithms have their own advantages and disadvantages, and can be used for different purposes and in different situations. We have developed a prototype tool that applies t-way sequence testing on Antidote, which is a healthcare data exchange protocol stack. Experimental results suggest that t-way sequence testing can be an effective approach for testing communication protocol implementations.en_US
dc.description.sponsorshipLei, Yuen_US
dc.language.isoenen_US
dc.publisherComputer Science & Engineeringen_US
dc.titleAdvanced Combinatorial Testing Algorithms And Applicationsen_US
dc.typePh.D.en_US
dc.contributor.committeeChairLei, Yuen_US
dc.degree.departmentComputer Science & Engineeringen_US
dc.degree.disciplineComputer Science & Engineeringen_US
dc.degree.grantorUniversity of Texas at Arlingtonen_US
dc.degree.leveldoctoralen_US
dc.degree.namePh.D.en_US


Files in this item


Thumbnail


This item appears in the following Collection(s)

Show simple item record