skip to main content
Language:
Search Limited to: Search Limited to: Resource type Show Results with: Show Results with: Search type Index

Constructing Interaction Test Suites for Highly-Configurable Systems in the Presence of Constraints: A Greedy Approach

IEEE transactions on software engineering, 2008-09, Vol.34 (5), p.633-650 [Peer Reviewed Journal]

Copyright IEEE Computer Society Sep 2008 ;ISSN: 0098-5589 ;EISSN: 1939-3520 ;DOI: 10.1109/TSE.2008.50 ;CODEN: IESEDJ

Full text available

Citations Cited by
  • Title:
    Constructing Interaction Test Suites for Highly-Configurable Systems in the Presence of Constraints: A Greedy Approach
  • Author: Cohen, M.B. ; Dwyer, M.B. ; Jiangfan Shi
  • Subjects: Algorithms ; Application software ; Cameras ; Combinatorial analysis ; Combinatorics ; Computer programs ; Computer Society ; Construction ; Cost engineering ; Costs ; Logic arrays ; Logic programming ; Logic testing ; Mathematical analysis ; Product lines ; Production ; Software ; Software systems ; Software testing ; Solvers ; Studies ; System testing ; Testing ; Testing strategies ; Testing tools
  • Is Part Of: IEEE transactions on software engineering, 2008-09, Vol.34 (5), p.633-650
  • Description: Researchers have explored the application of combinatorial interaction testing (CIT) methods to construct samples to drive systematic testing of software system configurations. Applying CIT to highly-configurable software systems is complicated by the fact that, in many such systems, there are constraints between specific configuration parameters that render certain combinations invalid. Many CIT algorithms lack a mechanism to avoid these. In recent work, automated constraint solving methods have been combined with search-based CIT construction methods to address the constraint problem with promising results. However, these techniques can incur a non-trivial overhead. In this paper, we build upon our previous work to develop a family of greedy CIT sample generation algorithms that exploit calculations made by modern Boolean satisfiability (SAT) solvers to prune the search space of the CIT problem. We perform a comparative evaluation of the cost-effectiveness of these algorithms on four real-world highly-configurable software systems and on a population of synthetic examples that share the characteristics of those systems. In combination our techniques reduce the cost of CIT in the presence of constraints to 30 percent of the cost of widely-used unconstrained CIT methods without sacrificing the quality of the solutions.
  • Publisher: New York: IEEE
  • Language: English
  • Identifier: ISSN: 0098-5589
    EISSN: 1939-3520
    DOI: 10.1109/TSE.2008.50
    CODEN: IESEDJ
  • Source: ProQuest Academic
Back to results list
INSPIRE LIBRARY - TON DUC THANG UNIVERSITY (84-028) 37 755 057 Feedback
19 Nguyen Huu Tho St. Dist.7, HCM thuvien@tdtu.edu.vn

Copyright © 2017 INSPIRE LIBRARY - TON DUC THANG UNIVERSITY

Searching Remote Databases, Please Wait