In order to support test suite understanding, we investigate whether we can automatically derive relations between test cases. In particular, we search for trace-based similarities between (high-level) endto-end tests on the one hand and fine grained unit tests on the other. Our approach uses the shared word count metric to determine similarity. We evaluate our approach in two case studies and ...

Amongst its many features, MPI-2 offers the first standard highperformance I/O interface. While this enables a parallel and I/O intensive code to run on multiple platforms, achieving consistent performance levels will be more difficult than many users imagine. To better understand the I/O performance issues in MPI-2, fecit and Southampton have developed a parallel I/O test suite for Fujitsu Jap...

Recently, most of the research in NLP has concentrated on the creation of applications coping with textual entailment. However, there still exist very few resources for the evaluation of such applications. We argue that the reason for this resides not only in the novelty of the research field but also and mainly in the difficulty of defining the linguistic phenomena which are responsible for in...

Performance issues of OpenFlow switches are attracting a lot of attention owing to the potential large-scale deployment of software-defined devices. This paper presents theOFBench which is an automatic test suite for evaluating the performance of OpenFlow switches. The design, as part of the Automation Control Test System (ACTS) development, is based on a controller-agent architecture which all...

Generating a set of combinatorial test cases for web application and development is very important. Linear programming (LP) is one of approaches to generating small combinatorial test suite. But, for software under test (SUT), the number of combinatorial test cases is often extremely large. If using LP to optimize test suite, the optimizing efficiency is low for the enormous size of LP variable...

Many researchers have proposed algorithms for determining the winners of general combinatorial auctions, with encouraging results. (Some of these algorithms are described in Chapter 14 of this book.) This line of research has given rise to another problem, however. In order to evaluate—and thus to improve—such algorithms, it is necessary to use some sort of test data. Unfortunately, there is li...

| We describe a suite of 5500 test positions for testing chess playing programs. They are available as pub/wds/ChessTest.tar.Z by anonymous ftp to external.NJ.NEC.COM. Almost all of these positions are unoriginal and were obtained by scanning in diagrams from chessbooks with an optical scanner. Gnuchess 4.0, at one minute per move on a 50 MHz MIPS R4000, scores 16-71% on our testtles. We descri...

1 2 During regression testing, a modified system is often retested using an existing test suite. Since the size of the test suite 3 may be very large, testers are interested in detecting faults in the modified system as early as possible during this retesting 4 process. Test prioritization attempts to order tests for execution so that the chances of early detection of faults during retest5 ing ...

The test suite optimization during test case generation can save time and cost. The paper presents an information theory based metric to filter the redundant test cases and reduce the test suite size while, maintaining the coverage of the requirements and with minimum loss to mutant coverage. The paper propose two versions, RR and RR2. RR filters test cases for each requirement, where as, RR2 f...

Test-suite reduction techniques attempt to reduce the costs of saving and reusing test cases during software maintenance by eliminating redundant test cases from test suites. A potential drawback of these techniques is that reducing the size of a test suite might reduce its ability to reveal faults in the software. Previous studies have suggested that test-suite reduction techniques can reduce ...