A Combinatorial test data generation approach using fault data analysis and discretization of parameter input space

Download

index.pdf

Date

2018

Author

Bosnalı, Hakan

Metadata

Show full item record

Item Usage Stats

120
views

80
downloads

Combinatorial Testing is an efficient testing strategy. It is based on the idea that many faults are caused by interactions between a relatively small number of parameters. However, determining the right interaction strength to generate data for different software is an issue in terms of efficiency. In addition to that, it requires the inputs in a discrete form, while that is not always the case. We propose a new combinatorial test data generator tool that combines fault data analysis to determine the right interaction strength for the specific domain of software and transformation of the continuous input space of parameters into discrete using well known test techniques. With this new tool, it is aimed to minimize test costs, while maximizing the confidence in test data. Experiments made with the tool support this idea with results showing a significant increase in test efficiency.

Subject Keywords

Combinatorial analysis., Computer software, Computer software

URI

http://etd.lib.metu.edu.tr/upload/12622240/index.pdf
https://hdl.handle.net/11511/27387

Collections

Graduate School of Informatics, Thesis

Suggestions

OpenMETU
Core

Modelling and predicting binding affinity of PCP-like compounds using machine learning methods Erdaş, Özlem; Alpaslan, Ferda Nur; Department of Computer Engineering (2007) Machine learning methods have been promising tools in science and engineering fields. The use of these methods in chemistry and drug design has advanced after 1990s. In this study, molecular electrostatic potential (MEP) surfaces of PCP-like compounds are modelled and visualized in order to extract features which will be used in predicting binding affinity. In modelling, Cartesian coordinates of MEP surface points are mapped onto a spherical self-organizing map. Resulting maps are visualized by using values...
Enhancing accuracy of hybrid recommender systems through adapting the domain trends Aksel, Fatih; Birtürk, Ayşe Nur; Department of Computer Engineering (2010) Traditional hybrid recommender systems typically follow a manually created fixed prediction strategy in their decision making process. Experts usually design these static strategies as fixed combinations of different techniques. However, people's tastes and desires are temporary and they gradually evolve. Moreover, each domain has unique characteristics, trends and unique user interests. Recent research has mostly focused on static hybridization schemes which do not change at runtime. In this thesis work, w...
Software project scheduling, software project performance measurement and control Kanık, Yusuf; Koçyiğit, Altan; Department of Information Systems (2005) This thesis is about software project scheduling and use of earned value method on software projects. As a result of the study, a solution for software project scheduling problems is proposed. A mathematical formulation, developed using integer programming method, is at the heart of the solution. Objective of the formulation is to minimize the development costs consisting of direct labor cost, indirect costs and probable penalty costs. The formulation takes the capability and compatibility variances among r...
Using social graphs in one-class collaborative filtering problem Kaya, Hamza; Alpaslan, Ferda Nur; Department of Computer Engineering (2009) One-class collaborative filtering is a special type of collaborative filtering methods that aims to deal with datasets that lack counter-examples. In this work, we introduced social networks as a new data source to the one-class collaborative filtering (OCCF) methods and sought ways to benefit from them when dealing with OCCF problems. We divided our research into two parts. In the first part, we proposed different weighting schemes based on social graphs for some well known OCCF algorithms. One of the weig...
A new reactive method for processing web usage data Bayır, Murat Ali; Toroslu, İsmail Hakkı; Department of Computer Engineering (2006) In this thesis, a new reactive session reconstruction method 'Smart-SRA' is introduced. Web usage mining is a type of web mining, which exploits data mining techniques to discover valuable information from navigations of Web users. As in classical data mining, data processing and pattern discovery are the main issues in web usage mining. The first phase of the web usage mining is the data processing phase including session reconstruction. Session reconstruction is the most important task of web usage mining...

Citation Formats

H. Bosnalı, “A Combinatorial test data generation approach using fault data analysis and discretization of parameter input space,” M.S. - Master of Science, Middle East Technical University, 2018.