31,549 Hits in 7.3 sec

An algorithm for generating t-wise covering arrays from large feature models

Martin Fagereng Johansen, Øystein Haugen, Franck Fleurey
2012 Proceedings of the 16th International Software Product Line Conference on - SPLC '12 -volume 1  
The in ( ) where is the number of features A scalable algorithm for t-wise (1-3) covering array generationAn empirical evaluation and comparison  Implementation available  The implementation is available  ...  Generate a covering array  Can be reused until the feature model is changed 2. Build each product 3.  ... 
doi:10.1145/2362536.2362547 dblp:conf/splc/JohansenHF12 fatcat:nn4ws2rkhnhivhw4qt2bnbiwdu

Properties of Realistic Feature Models Make Combinatorial Testing of Product Lines Feasible [chapter]

Martin Fagereng Johansen, Øystein Haugen, Franck Fleurey
2011 Lecture Notes in Computer Science  
Based on this, we investigate covering array generation time and results for realistic feature models and find where the algorithms can be improved.  ...  For example, satisfying propositional formulas, which translates into finding a valid product for a given feature model, is an NP-hard problem, which has no fast, optimal solution.  ...  We want to thank the anonymous reviewers for their helpful feedback. The work presented here has been developed within the VERDE project ITEA 2 -ip8020.  ... 
doi:10.1007/978-3-642-24485-8_47 fatcat:jyrhtuonnjcije6uy3azsk4m2u

Combinatorial Interaction Testing of Software Product Lines: A Mapping Study

Mohd Zanes Sahid, Abu Bakar Md Sultan, Abdul Azim Abdul Ghani, Salmi Baharom
2016 Journal of Computer Science  
In CIT, one has to construct a covering array, which is a set of configurations having valid feature combinations and every combination of t features appears at least once in the array.  ...  This is also known as t-wise testing. By following the systematic mapping study guidelines, we have selected and filtered 44 primary studies for review.  ...  /UPM for their invaluable comments and suggestions.  ... 
doi:10.3844/jcssp.2016.379.398 fatcat:kdc2r5kkiveqho3ycwcdmmf77u

A Technique for Agile and Automatic Interaction Testing for Product Lines [chapter]

Martin Fagereng Johansen, Øystein Haugen, Franck Fleurey, Erik Carlson, Jan Endresen, Tormod Wien
2012 Lecture Notes in Computer Science  
The second case shows how over 400,000 test executions are performed on the products of a 2-wise covering array using over 40,000 existing automatic tests to identify potential interactions faults.  ...  The first case shows how existing test suites are applied to the products of a 2wise covering array to identify two interaction faults.  ...  The authors would like to thank the anonymous reviewers for their helpful feedback.  ... 
doi:10.1007/978-3-642-34691-0_5 fatcat:hvyh43muargided7pzmqblmkmi

Improving CASA Runtime Performance by Exploiting Basic Feature Model Analysis [article]

Evelyn Nicole Haslinger, Roberto E. Lopez-Herrejon, Alexander Egyed
2013 arXiv   pre-print
Such a subset of products can be determined by computing a so called t-wise Covering Array (tCA), whose computation is NP-complete.  ...  We applied these rules to CASA, a simulated annealing algorithm for tCA generation for SPLs.  ...  A t-wise CA can be formally defined as: Definition 5. A t-wise covering array tCA for a feature model FM is a set of valid feature sets that covers all valid t-sets of the software product line 4 .  ... 
arXiv:1311.7313v2 fatcat:6uebsrwcpjagha7qb2xgykpkyi

A parallel evolutionary algorithm for prioritized pairwise testing of software product lines

Roberto Erick Lopez-Herrejon, Javier Javier Ferrer, Francisco Chicano, Evelyn Nicole Haslinger, Alexander Egyed, Enrique Alba
2014 Proceedings of the 2014 conference on Genetic and evolutionary computation - GECCO '14  
We perform an extensive and comprehensive analysis of PPGS with 235 feature models from a wide range of number of features and products, using 3 different priority assignment schemes and 5 product prioritization  ...  We also compare PPGS with the greedy algorithm prioritized-ICPL. Our study reveals that overall PPGS obtains smaller covering arrays with an acceptable performance difference with prioritized-ICPL.  ...  Perrouin et al. propose an approach that translates t-wise coverage problems into Alloy programs and rely on its automatic instance generation to obtain covering arrays [20] .  ... 
doi:10.1145/2576768.2598305 dblp:conf/gecco/Lopez-HerrejonFCHEA14 fatcat:xsyjqfggk5ge5hm3gzqczjqp2q

Towards a Benchmark and a Comparison Framework for Combinatorial Interaction Testing of Software Product Lines [article]

Roberto E. Lopez-Herrejon, Javier Ferrer, Francisco Chicano, Evelyn Nicole Haslinger, Alexander Egyed, Enrique Alba
2014 arXiv   pre-print
To achieve such goal two items are important: a common benchmark of feature models, and an adequate comparison framework.  ...  In this research-in-progress paper, we propose 19 feature models as the base of a benchmark, which we apply to three different techniques in order to analyze the comparison framework proposed by Perrouin  ...  A t-wise covering array tCA for a feature model fm is a set of valid feature sets that covers all valid t-sets denoted by fm 3 . We also use the term test suite to refer to a covering array.  ... 
arXiv:1401.5367v1 fatcat:7dmbafnktreyzli4s6ezw4p2jy

Progressive Ranking and Composition of Web Services with Interaction Relationship

Jianjun Yuan, Changjun Jiang, Zuowen Jiang
2010 Journal of Software  
We extend the model of interaction testing for WS with interaction relationship and propose a greedy algorithm for constructing variable covering arrays with bias.  ...  However, they consider only pair-wise (2-way) interaction among any two component WS.  ...  Definition 1 A covering array, CA(N; t, k, |v|), is an N × k array such that every N × t subarray contains all tuples of size t (t-tuples) at least once.  ... 
doi:10.4304/jsw.5.8.842-850 fatcat:37w4m3paejfxrl5arbvc5xsubm

Building T-wise Combinatorial Interaction Test Suites by Means of Grid Computing

A. Calvagna, A. Gargantini, E. Tramontana
2009 2009 18th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises  
Since high values of t are preferable, a large number of test cases could still be generated. This paper proposes a technique for building the smallest possible test suite of size t.  ...  The paper shows that for obtaining the smallest possible set of tests, it is best to generate a large 'flexible' set of t-tuples and then reduce such a set until the smallest one is obtained.  ...  Often we refer to a CA or MCA of strength t as a t-wise covering array or t-covering array. When t = 2, it is also called a pairways covering array. t-wise coupling.  ... 
doi:10.1109/wetice.2009.52 dblp:conf/wetice/CalvagnaGT09 fatcat:mzxt7qncd5brjctwo2pkkll6cy

Bypassing the Combinatorial Explosion: Using Similarity to Generate and Prioritize T-Wise Test Configurations for Software Product Lines

Christopher Henard, Mike Papadakis, Gilles Perrouin, Jacques Klein, Patrick Heymans, Yves Le Traon
2014 IEEE Transactions on Software Engineering  
To this end, t-wise can help to drastically reduce the number of product configurations to test. Current t-wise approaches for SPLs are restricted to small values of t.  ...  In view of this, means for automatically generating and prioritizing product configurations for large SPLs are required.  ...  SPLCAT operates by generating a covering array [26] . In a covering array, the rows represent the product configurations while the columns represent the features.  ... 
doi:10.1109/tse.2014.2327020 fatcat:xl22pzdzrrdfpmrr4szz2e33yu

Testing a Data-Intensive System with Generated Data Interactions [chapter]

Sagar Sen, Arnaud Gotlieb
2013 Lecture Notes in Computer Science  
We address this question with a methodology and tool Faktum to automatically populate a test database that covers all T-wise interactions for selected features.  ...  Taxation rules, for example, are triggered due to an interaction between 10,000 items, 88 country groups, and 934 tax codes. There are about 12.9 trillion 3-wise interactions.  ...  We thank the Research Council of Norway for their generous support ; it would not have been impossible to setup such a close industry-academia collaboration for high impact software engineering research  ... 
doi:10.1007/978-3-642-38709-8_42 fatcat:xbwuqyuxpndwpntxyd6c5rlpwy

T-wise combinatorial interaction test suites construction based on coverage inheritance

Andrea Calvagna, Angelo Gargantini
2011 Software testing, verification & reliability  
This paper presents an original greedy algorithm to compute t-wise covering mixed covering arrays with constant space complexity, irrespective of the number of involved parameters and strength of interaction  ...  However, still very few generally applicable t-wise covering construction algorithms (and tools) do exist in literature.  ...  Colbourn for reading an early version of this paper. Thanks also to Jeff Lei and D.Richard Khun for their kind support on the ACTS tool.  ... 
doi:10.1002/stvr.466 fatcat:wiz3hibfbvcthjj42vxwvfz3oe

An Efficient Approximation to Lookahead in Relational Learners [chapter]

Jan Struyf, Jesse Davis, David Page
2006 Lecture Notes in Computer Science  
We propose a heuristic for greedy relational learning algorithms that can be seen as an efficient, limited form of lookahead.  ...  Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space.  ...  Acknowledgments Jan Struyf is a postdoctoral fellow of the Fund for Scientific Research of Flanders (FWO-Vlaanderen). David Page is supported in part by the U.S.  ... 
doi:10.1007/11871842_79 fatcat:huhk3qzw4rbznjzvjkiinrutbq

An Orchestrated Survey of Available Algorithms and Tools for Combinatorial Testing

Sunint Kaur Khalsa, Yvan Labiche
2014 2014 IEEE 25th International Symposium on Software Reliability Engineering  
, mixed covering array, the strength of coverage, and the support for constraints between parameters.  ...  CT is typically performed with the help of combinatorial objects called Covering Arrays.  ...  Techniques for the generation of covering array Various techniques for generating covering arrays for CT have been proposed in literature.  ... 
doi:10.1109/issre.2014.15 dblp:conf/issre/KhalsaL14 fatcat:44m7sq57tzeqpp5kuytxutis4m

A variability-based testing approach for synthesizing video sequences

José A. Galindo, Mauricio Alférez, Mathieu Acher, Benoit Baudry, David Benavides
2014 Proceedings of the 2014 International Symposium on Software Testing and Analysis - ISSTA 2014  
VANE computes T-wise covering sets while optimizing a function over attributes.  ...  The ideas of VANE are i) to encode in a variability model what can vary within a video sequence; ii) to exploit the variability model to generate testable configurations; iii) to synthesize variants of  ...  T-wise CSP For Attributed Feature Models This section describes how VANE uses CSP to derive solutions for T-wise covering arrays.  ... 
doi:10.1145/2610384.2610411 dblp:conf/issta/GalindoAABB14 fatcat:afp5xo5merhq5jrzwy5lizn44u
« Previous Showing results 1 — 15 out of 31,549 results