A Browser Compatibility Testing Method Based on Combinatorial Testing

Xu, Lei; Xu, Bin; Nie, Changhai; Chen, Huowang; Yang, Hongji

doi:10.1007/3-540-45068-8_60

Cited by 17 publications

(16 citation statements)

References 9 publications

(8 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Since 2003, we have done much work in the test case generation [Nie et al , 2006a[Nie et al , 2006bWang et al 2007Wang et al , 2008, fault location ] and the application of CT [Xu et al 2003a[Xu et al , 2003b. In this article we propose a complete theory of the Minimal Failure-causing Schema (MFS) first.…”

Section: Introductionmentioning

confidence: 93%

The Minimal Failure-Causing Schema of Combinatorial Testing

Nie

Leung

2011

ACM Trans. Softw. Eng. Methodol.

Self Cite

View full text Add to dashboard Cite

Combinatorial Testing (CT) involves the design of a small test suite to cover the parameter value combinations so as to detect failures triggered by the interactions among these parameters. To make full use of CT and to extend its advantages, this article first gives a model of CT and then presents a theory of the Minimal Failure-causing Schema (MFS), including the concept of the MFS, proof of its existence, some of its properties, and a method of finding the MFS. Then we propose a methodology for CT based on this MFS theory and the existing research. Our MFS-based methodology emphasizes that CT should work on accurate testing requirements, and has the following advantages: 1) Detect failure to the greatest degree with the least cost. 2) Effectiveness is improved by emphasizing mining of the information in software and making full use of the information gained from test design and execution. 3) Determine the root causes of failures and reveal related faults near the exposed ones. 4) Provide a foundation and model for regression testing and software quality evaluation of CT. A case study is presented to illustrate the MFS-based CT methodology, and an empirical study on a real software developed by us shows that the MFS really exists and the methodology based on MFS can considerably improve CT.

show abstract

Section: Introductionmentioning

confidence: 93%

The Minimal Failure-Causing Schema of Combinatorial Testing

Nie

Leung

2011

ACM Trans. Softw. Eng. Methodol.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Several empirical studies of combinatorial testing have been reported that applied combinatorial testing on major features of a mobile phone application testing [18], an email system testing [19], satellite communications system testing [22], configuration testing [23], browser compatibility testing [24], network interface testing [25], and protocol testing [26]. The studies show that combinatorial testing is very effective and can be applied to a wide variety of applications.…”

Section: Related Workmentioning

confidence: 99%

Combinatorial Testing of ACTS: A Case Study

Borazjany

Lei

et al. 2012

2012 IEEE Fifth International Conference on Software Testing, Verification and Validation

View full text Add to dashboard Cite

In this paper we present a case study of applying combinatorial testing to test a combinatorial test generation tool called ACTS. The purpose of this study is two-fold. First, we want to gain experience and insights about how to apply combinatorial testing in practice. Second, we want to evaluate the effectiveness of combinatorial testing applied to a real-life system. ACTS has 24637 lines of uncommented code, and provides a command line interface and a fairly sophisticated graphic user interface. The main challenge of this study was to model the input space in terms of a set of parameters and values. Once the model was designed, we generated test cases using ACTS, which were then later used to test ACTS. The results of this study show that input space modeling can be a significant undertaking, and needs to be carefully managed. The results also show that combinatorial testing is effective in terms of achieving high code coverage and fault detection.

show abstract

“…QA strategies for evaluating web portability include launching web applications in varied configurations [3,4,8,9,54], looking for unsupported HTML in source code [6,16], and attempting to transform code into a form that is universally supported [11]. This section outlines existing approaches along with their limitations and tools that implement them.…”

Section: Web Portability Analysismentioning

confidence: 99%

A Framework for Detecting and Diagnosing Configuration Faults in Web Applications

Memon

Eaton

2012

Advances in Computers

View full text Add to dashboard Cite

Software portability is a key concern when target operational environments are highly configurable; variations in configuration settings can significantly impact software correctness. While portability is key for a wide range of software types, it is a significant challenge in web application development. The client configuration used to navigate and interact with web content is known to be an important factor in the subsequent quality of deployed web applications. With the widespread use of diverse, heterogeneous web client configurations, the results of web application deployment can vary unpredictably among users. Given existing approaches and limited development resources, attempting to develop web applications that are viewable, functional, and portable for the vast web configuration space is a significant undertaking. As a result, faults that only surface in precise configurations, termed configuration faults, have the potential to escape detection until web applications are fielded.This dissertation presents an automated, model-based framework that uses static analysis to detect and diagnose web configuration faults. This approach overcomes the limitations of current techniques by featuring an extensible model of the configuration space that enables efficient portability analysis across the vast array of client environments. The basic idea behind this approach is that source code fragments (i.e., HTML tags and CSS rules) embedded in web application source code adversely impact portability of web applications when they are unsupported in target client configurations; without proper support, the source code is either processed incorrectly or ignored, resulting in configuration faults. Using static analysis, configuration fault detection is performed by applying a model of the web application source against knowledge of support criteria; any unsupported source code detected is considered an index to potential configuration faults. In the effort to fully exploit this approach, improve practicality, and maximize fault detection efficiency, manual and automated approaches to knowledge acquisition have been implemented, variations of web application and client support knowledge models have been investigated, and visualization of configuration fault detection results has been explored. To optimize the automated acquisition of support knowledge, alternate learning strategies have been empirically investigated and provisions for capturing tag interaction have been integrated into the process.

show abstract

A Browser Compatibility Testing Method Based on Combinatorial Testing

Cited by 17 publications

References 9 publications

The Minimal Failure-Causing Schema of Combinatorial Testing

The Minimal Failure-Causing Schema of Combinatorial Testing

Combinatorial Testing of ACTS: A Case Study

A Framework for Detecting and Diagnosing Configuration Faults in Web Applications

Contact Info

Product

Resources

About