Results 1 - 10
of
14
Cost-Efficient Sampling for Performance Prediction of Configurable Systems
"... Abstract—A key challenge of the development and mainten-ance of configurable systems is to predict the performance of individual system variants based on the features selected. It is usually infeasible to measure the performance of all possible vari-ants, due to feature combinatorics. Previous appro ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
(Show Context)
Abstract—A key challenge of the development and mainten-ance of configurable systems is to predict the performance of individual system variants based on the features selected. It is usually infeasible to measure the performance of all possible vari-ants, due to feature combinatorics. Previous approaches predict performance based on small samples of measured variants, but it is still open how to dynamically determine an ideal sample that balances prediction accuracy and measurement effort. In this paper, we adapt two widely-used sampling strategies for performance prediction to the domain of configurable systems and evaluate them in terms of sampling cost, which considers prediction accuracy and measurement effort simultaneously. To generate an initial sample, we introduce a new heuristic based on feature frequencies and compare it to a traditional method based on t-way feature coverage. We conduct experiments on six real-world systems and provide guidelines for stakeholders to predict performance by sampling. I.
Evaluation of t-wise Approach for Testing Logical Expressions
- in Software,” Proceedings of the IEEE Sixth International Conference on Software Testing, Verification and Validation Workshops (ICSTW 2013), 18–20 March 2013
"... Abstract — Pair-wise and, more generally, t-wise testing are the most common and powerful combinatorial testing approaches. This paper investigates the effectiveness of the t-wise approach for testing logical expressions in software in terms of its fault-detecting capabilities. Effectiveness is eval ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
(Show Context)
Abstract — Pair-wise and, more generally, t-wise testing are the most common and powerful combinatorial testing approaches. This paper investigates the effectiveness of the t-wise approach for testing logical expressions in software in terms of its fault-detecting capabilities. Effectiveness is evaluated experimentally using special software tools for generating logical expressions and t-wise test cases, simulating faults in expressions, testing faulty expressions, and evaluating effectiveness of the testing. T-wise testing effectiveness is measured in its totality and for specific types of faults; it is then compared with random testing. A detailed analysis of the experimental results is also provided. Keywords-testing; pair-wise; t-wise; effectiveness; logical expressions; experimental evaluation I.
Combinatorial-based prioritization for usersession-based test suites
, 2012
"... Part of the Computer Sciences Commons This Thesis is brought to you for free and open access by the Graduate Studies at ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Part of the Computer Sciences Commons This Thesis is brought to you for free and open access by the Graduate Studies at
Using Combinatorial Approaches for Testing Mobile Applications
"... Abstract — Device-specific faults are very common for mobile software applications. To avoid such faults and guarantee the reliability and quality of mobile applications, sufficient testing is required on different mobile devices, which is expensive and time-consuming. This makes the task of the opt ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Abstract — Device-specific faults are very common for mobile software applications. To avoid such faults and guarantee the reliability and quality of mobile applications, sufficient testing is required on different mobile devices, which is expensive and time-consuming. This makes the task of the optimal selection of mobile devices for testing important and interesting from both practical and theoretical points of view. The suggested approach in this paper is based on combinatorial methods for coverage of each device characteristics. The initial results of the experimental investigation using comparisons with a random selection of devices are provided and show that the proposed approach is effective and promising.
TCA: An Efficient Two-Mode Meta-Heuristic Algorithm for Combinatorial Test Generation
"... Covering arrays (CAs) are often used as test suites for combinatorial interaction testing to discover interaction faults of real-world systems. Most real-world systems involve con-straints, so improving algorithms for covering array generation (CAG) with constraints is beneficial. Two popular metho ..."
Abstract
- Add to MetaCart
Covering arrays (CAs) are often used as test suites for combinatorial interaction testing to discover interaction faults of real-world systems. Most real-world systems involve con-straints, so improving algorithms for covering array generation (CAG) with constraints is beneficial. Two popular methods for constrained CAG are greedy construction and meta-heuristic search. Recently, a meta-heuristic framework called two-mode local search has shown great success in solving classic NP-hard problems. We are interested whether this method is also powerful in solving the constrained CAG problem. This work proposes a two-mode meta-heuristic framework for constrained CAG efficiently and presents a new meta-heuristic algorithm called TCA. Experiments show that TCA significantly outperforms state-of-the-art solvers on 3-way constrained CAG. Further ex-periments demonstrate that TCA also performs much better than its competitors on 2-way constrained CAG.
Test Case Generation Using Combinatorial Based Coverage for Rich Web Applications
"... Web applications are increasingly moving business and processing logic from the server to the browser. Traditional, multiple-page request/response applications are quickly being replaced by single-page applications where complex application logic is downloaded on the initial page load and data is th ..."
Abstract
- Add to MetaCart
(Show Context)
Web applications are increasingly moving business and processing logic from the server to the browser. Traditional, multiple-page request/response applications are quickly being replaced by single-page applications where complex application logic is downloaded on the initial page load and data is then subsequently fetched asynchronously via the browser’s native XMLHttpRequest (XHR) object. These new generation web applications are called Rich Web Applications (RWA). Frameworks such as the Google Web Toolkit (GWT), and JavaScript model-view-controller (MVC) frameworks such as Backbone.js are facilitating this move. With this migration, testing frameworks need to follow the logic by moving analysis and test generation from the server to the client. One problem hindering the movement of testing in this domain is the adoption of semantic URLs. This paper introduces a novel approach to systematically identify variables in semantic URLs and use them as part of the test generation process. Using a sample RWA seeded with various JavaScript faults, I demonstrate in this thesis, as an empirical study, that combinatorial testing algorithms and reduction strategies also apply to new RWAs.
Santiago de Querétaro,
"... Abstract—Empirical data demonstrate the value of t-way coverage, but in some testing situations, it is not practical to use covering arrays. However any set of tests covers at least some proportion of t-way combinations. This paper describes a variety of measures of combinatorial coverage that can b ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—Empirical data demonstrate the value of t-way coverage, but in some testing situations, it is not practical to use covering arrays. However any set of tests covers at least some proportion of t-way combinations. This paper describes a variety of measures of combinatorial coverage that can be used in evaluating aspects of t-way coverage of a test suite. We also provide lower bounds on t-way coverage of several widely-used testing strategies, and describe a tool that analyzes test suites using the measures discussed in the paper. Keywords-component; combinatorial testing; factor covering array; state-space coverage; verification and validation (V&V); t-way testing; configuration model; t-way testing; I.
MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays
"... ..."
(Show Context)
Quantum Inf Process DOI 10.1007/s11128-012-0506-4 Quantum adiabatic machine learning
, 2012
"... Abstract We develop an approach to machine learning and anomaly detection via quantum adiabatic evolution. This approach consists of two quantum phases, with some amount of classical preprocessing to set up the quantum problems. In the training phase we identify an optimal set of weak classifiers, t ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract We develop an approach to machine learning and anomaly detection via quantum adiabatic evolution. This approach consists of two quantum phases, with some amount of classical preprocessing to set up the quantum problems. In the training phase we identify an optimal set of weak classifiers, to form a single strong classifier. In the testing phase we adiabatically evolve one or more strong classifiers on a superposition of inputs in order to find certain anomalous elements in the classification space. Both the training and testing phases are executed via quantum adiabatic evolution. All quantum processing is strictly limited to two-qubit interactions so as to ensure physical feasibility. We apply and illustrate this approach in detail to the problem of software verification and validation, with a specific example of the learning phase applied to a problem of interest in flight control systems. Beyond this example, the algorithm can be used to attack a broad class of anomaly detection problems.
Combinatorial Testing for Tree-Structured Test Models with Constraints
"... Abstract—In this paper, we develop a combinatorial testing technique for tree-structured test models. First, we generalize our previous test models for combinatorial testing based on and-xor trees with constraints limited to a syntactic subset of propositional logic, to allow for constraints in full ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—In this paper, we develop a combinatorial testing technique for tree-structured test models. First, we generalize our previous test models for combinatorial testing based on and-xor trees with constraints limited to a syntactic subset of propositional logic, to allow for constraints in full propositional logic. We prove that the generalized test models are strictly more expressive than the limited ones. Then we develop an algorithm for combinatorial testing for the generalized models, and show its correctness and computational complexity. We apply a tool based on our algorithm to an actual ticket gate system that is used by several large transportation companies in Japan. Experimental results show that our technique outperforms existing techniques. I.
