Results 1 -
9 of
9
A comparison of test case prioritization criteria for software product lines
- In IEEE International Conference on Software Testing, Verification, and Validation
, 2014
"... Abstract—Software Product Line (SPL) testing is challenging due to the potentially huge number of derivable products. To alleviate this problem, numerous contributions have been proposed to reduce the number of products to be tested while still having a good coverage. However, not much attention has ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
(Show Context)
Abstract—Software Product Line (SPL) testing is challenging due to the potentially huge number of derivable products. To alleviate this problem, numerous contributions have been proposed to reduce the number of products to be tested while still having a good coverage. However, not much attention has been paid to the order in which the products are tested. Test case prioritization techniques reorder test cases to meet a certain performance goal. For instance, testers may wish to order their test cases in order to detect faults as soon as possible, which would translate in faster feedback and earlier fault correction. In this paper, we explore the applicability of test case prioritization techniques to SPL testing. We propose five different prioritization criteria based on common metrics of feature models and we compare their effectiveness in increasing the rate of early fault detection, i.e. a measure of how quickly faults are detected. The results show that different orderings of the same SPL suite may lead to significant differences in the rate of early fault detection. They also show that our approach may contribute to accelerate the detection of faults of SPL test suites based on combinatorial testing. I.
Multi-objective optimal test suite computation for software product line pairwise testing
- In 29th International conference on software maintenance
, 2013
"... Abstract—Software Product Lines (SPLs) are families of re-lated software products, which usually provide a large number of feature combinations, a fact that poses a unique set of challenges for software testing. Recently, many SPL testing approaches have been proposed, among them pairwise combinator ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
(Show Context)
Abstract—Software Product Lines (SPLs) are families of re-lated software products, which usually provide a large number of feature combinations, a fact that poses a unique set of challenges for software testing. Recently, many SPL testing approaches have been proposed, among them pairwise combinatorial techniques that aim at selecting products to test based on the pairs of feature combinations such products provide. These approaches regard SPL testing as an optimization problem where either coverage (maximize) or test suite size (minimize) are considered as the main optimization objective. Instead, we take a multi-objective view where the two objectives are equally important. In this exploratory paper we propose a zero-one mathematical linear program for solving the multi-objective problem and present an algorithm to compute the true Pareto front, hence an optimal solution, from the feature model of a SPL. The evaluation with 118 feature models revealed an interesting trade-off between reducing the number of constraints in the linear program and the runtime which opens up several venues for future research. I.
Search based software engineering for software product line engineering: a survey and directions for future work
"... This paper1 presents a survey of work on Search Based Software Engineering (SBSE) for Software Product Lines (SPLs). We have attempted to be comprehensive, in the sense that we have sought to include all papers that ap-ply computational search techniques to problems in software product line engineer ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
(Show Context)
This paper1 presents a survey of work on Search Based Software Engineering (SBSE) for Software Product Lines (SPLs). We have attempted to be comprehensive, in the sense that we have sought to include all papers that ap-ply computational search techniques to problems in software product line engineering. Having surveyed the recent explo-sion in SBSE for SPL research activity, we highlight some di-rections for future work. We focus on suggestions for the de-velopment of recent advances in genetic improvement, show-ing how these might be exploited by SPL researchers and practitioners: Genetic improvement may grow new prod-ucts with new functional and non-functional features and graft these into SPLs. It may also merge and parameterise multiple branches to cope with SPL branchmania.
The Drupal Framework: A Case Study to Evaluate Variability Testing Techniques
"... Variability testing techniques search for effective but man-ageable test suites that lead to the rapid detection of faults in systems with high variability. Evaluating the effectiveness of these techniques in real settings is a must but challenging due to the lack of variability-intensive systems wi ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Variability testing techniques search for effective but man-ageable test suites that lead to the rapid detection of faults in systems with high variability. Evaluating the effectiveness of these techniques in real settings is a must but challenging due to the lack of variability-intensive systems with avail-able code, automated tests and fault reports. In this pa-per, we propose using the Drupal framework as a case study to evaluate variability testing techniques. First, we repre-sent the framework variability as a feature model. Then, we report on extensive data extracted from the Drupal git repository and the Drupal issue tracking system. Among other results, we identified 378 faults in single features and 11 faults triggered by the interaction between two of the features of Drupal v7.23, reported during a one-year period. These data may give a new insight into the distribution of faults in variability-intensive systems and the fault propen-sity of features. To show the feasibility of our work, we used the case study to evaluate the effectiveness of a history-based test case prioritization criterion. Results suggest that this technique could contribute to accelerate the detection of faults of test suites based on combinatorial testing.
Automated variability analysis and testing of an e-commerce site: An experience report
- In International Conference on Automated Software Engineering
, 2014
"... In this paper, we report on our experience on the devel-opment of La Hilandera, an e-commerce site selling haber-dashery products and craft supplies in Europe. The store has a huge input space where customers can place almost three millions of different orders which made testing an ex-tremely diffic ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
In this paper, we report on our experience on the devel-opment of La Hilandera, an e-commerce site selling haber-dashery products and craft supplies in Europe. The store has a huge input space where customers can place almost three millions of different orders which made testing an ex-tremely difficult task. To address the challenge, we explored the applicability of some of the practices for variability man-agement in software product lines. First, we used a feature model to represent the store input space which provided us with a variability view easy to understand, share and discuss with all the stakeholders. Second, we used techniques for the automated analysis of feature models for the detection and repair of inconsistent and missing configuration settings. Fi-nally, we used test selection and prioritization techniques for the generation of a manageable and effective set of test cases. Our findings, summarized in a set of lessons learnt, suggest that variability techniques could successfully address many of the challenges found when developing e-commerce sites.
Similarity-Based Prioritization in Software Product-Line Testing
"... Exhaustively testing every product of a software product line (SPL) is a difficult task due to the combinatorial explosion of the number of products. Combinatorial interaction test-ing is a technique to reduce the number of products under test. However, it is typically up-to the tester in which orde ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Exhaustively testing every product of a software product line (SPL) is a difficult task due to the combinatorial explosion of the number of products. Combinatorial interaction test-ing is a technique to reduce the number of products under test. However, it is typically up-to the tester in which order these products are tested. We propose a similarity-based prioritization to be applied on these products before they are generated. The proposed approach does not guarantee to find more errors than sampling approaches, but it aims at increasing interaction coverage of an SPL under test as fast as possible over time. This is especially beneficial since usu-ally the time budget for testing is limited. We implemented similarity-based prioritization in FeatureIDE and evaluated it by comparing its outcome to the default outcome of three sampling algorithms as well as to random orders. The exper-iment results indicate that the order with similarity-based prioritization is better than random orders and often better than the default order of existing sampling algorithms.
Lille- Nord Europe THEME Distributed Systems and ServicesTable of contents
"... Université des sciences et technologies de Lille (Lille 1) Activity Report 2012 Project-Team ADAM ..."
Abstract
- Add to MetaCart
Université des sciences et technologies de Lille (Lille 1) Activity Report 2012 Project-Team ADAM
Francisco Chicano
"... Search Based Software Engineering (SBSE) is an emerging discipline that focuses on the application of search-based optimization techniques to software engineering problems. The capacity of SBSE techniques to tackle problems involv-ing large search spaces make their application attractive for Softwar ..."
Abstract
- Add to MetaCart
(Show Context)
Search Based Software Engineering (SBSE) is an emerging discipline that focuses on the application of search-based optimization techniques to software engineering problems. The capacity of SBSE techniques to tackle problems involv-ing large search spaces make their application attractive for Software Product Lines (SPLs). In recent years, several pub-lications have appeared that apply SBSE techniques to SPL problems. In this paper, we present the results of a sys-tematic mapping study of such publications. We identified the stages of the SPL life cycle where SBSE techniques have been used, what case studies have been employed and how they have been analysed. This mapping study revealed po-tential venues for further research as well as common mis-understanding and pitfalls when applying SBSE techniques that we address by providing a guideline for researchers and practitioners interested in exploiting these techniques.
Noname manuscript No. (will be inserted by the editor) Efficient and Secure Algorithms for GLV-Based Scalar
"... Abstract We propose efficient algorithms and for-mulas that improve the performance of side chan-nel protected elliptic curve computations with spe-cial focus on scalar multiplication exploiting the Gallant-Lambert-Vanstone (CRYPTO 2001) and Galbraith-Lin-Scott (EUROCRYPT 2009) meth-ods. Firstly, by ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract We propose efficient algorithms and for-mulas that improve the performance of side chan-nel protected elliptic curve computations with spe-cial focus on scalar multiplication exploiting the Gallant-Lambert-Vanstone (CRYPTO 2001) and Galbraith-Lin-Scott (EUROCRYPT 2009) meth-ods. Firstly, by adapting Feng et al.’s recoding to the GLV setting, we derive new regular algorithms for variable-base scalar multiplication that offer protection against simple side-channel and timing attacks. Secondly, we propose an efficient, side-channel protected algorithm for fixed-base scalar multiplication which combines Feng et al.’s recod-ing with Lim-Lee’s comb method. Thirdly, we pro-pose an efficient technique that interleaves ARM and NEON-based multiprecision operations over an extension field to improve performance of GLS curves on modern ARM processors. Finally, we showcase the efficiency of the proposed techniques by implementing a state-of-the-art GLV-GLS curve in twisted Edwards form defined over Fp2, which supports a four dimensional decomposition of the scalar and is fully protected against timing at-tacks. Analysis and performance results are re-ported for modern x64 and ARM processors. For
