Software Testing, Verification and Reliability

Cover image for Vol. 24 Issue 8

Special Issue: Volume 2: Tests and Proofs for Improving the Generation Time and Quality of Test Data Suites

December 2014

Volume 24, Issue 8

Pages i–ii, 591–737

Issue edited by: Achim D. Brucker, Jacques Julliand

  1. Issue Information

    1. Top of page
    2. Issue Information
    3. Editorial
    4. Special Issue Papers
    5. Research Articles
    1. You have free access to this content
      Issue Information (pages i–ii)

      Article first published online: 13 NOV 2014 | DOI: 10.1002/stvr.1517

  2. Editorial

    1. Top of page
    2. Issue Information
    3. Editorial
    4. Special Issue Papers
    5. Research Articles
    1. You have free access to this content
  3. Special Issue Papers

    1. Top of page
    2. Issue Information
    3. Editorial
    4. Special Issue Papers
    5. Research Articles
    1. Bridging the gap between easy generation and efficient verification of unsatisfiability proofs (pages 593–607)

      Marijn J. H. Heule, Warren A. Hunt Jr. and Nathan Wetzler

      Article first published online: 3 OCT 2014 | DOI: 10.1002/stvr.1549

      Thumbnail image of graphical abstract

      Several proof formats have been used to verify refutations produced by satisfiability solvers, but existing formats are either costly to check or hard to implement. This paper presents a practical approach that facilitates checking of unsatisfiability results in a time similar to proof discovery by embedding clause deletion information into clausal proofs. By exploiting this information, the proof-checking time is reduced by an order of magnitude on medium-to-hard benchmarks as compared to checking proofs using similar clausal formats.

    2. Automated test case generation for FBD programs implementing reactor protection system software (pages 608–628)

      Eunkyoung Jee, Donghwan Shin, Sungdeok Cha, Jang-Soo Lee and Doo-Hwan Bae

      Article first published online: 5 SEP 2014 | DOI: 10.1002/stvr.1548

      Thumbnail image of graphical abstract

      FBDTesteris an effective tool for automated test data generation for function block diagram programs implementing safety-critical system software.

    3. RepOK-based reduction of bounded exhaustive testing (pages 629–655)

      Valeria Bengolea, Nazareno Aguirre, Darko Marinov and Marcelo Frias

      Article first published online: 5 OCT 2014 | DOI: 10.1002/stvr.1547

      Thumbnail image of graphical abstract

      A set of techniques for reducing the time for bounded exhaustive testing, by either reducing the generation time or reducing the obtained bounded exhaustive suites, is proposed. The representation invariant of the SUT's input is exploited for these reductions, to factor out separate representation invariants for disjoint structures of the inputs, and to partition valid inputs into equivalence classes, and to remove from the suite those tests that are equivalent to some tests already present in the suite.

    4. A random testing approach using pushdown automata (pages 656–683)

      Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko and Catherine Masson

      Article first published online: 13 MAY 2014 | DOI: 10.1002/stvr.1526

      Thumbnail image of graphical abstract

      Because finite automata are, in general, strong abstractions of systems, many test cases, which are automata traces generated uniformly at random, may be unconcretizable. This paper proposes a method extending the aforementioned testing approach to pushdown systems providing finer abstractions. Using combinatorial techniques guarantee the uniformity of generated traces. In addition, to improve the quality of the test suites, the combination of coverage criteria with random testing is investigated. The method is illustrated within both structural and model-based testing contexts.

  4. Research Articles

    1. Top of page
    2. Issue Information
    3. Editorial
    4. Special Issue Papers
    5. Research Articles
    1. Exploring the missing link: an empirical study of software fixes (pages 684–705)

      Maggie Hamill and Katerina Goseva-Popstojanova

      Article first published online: 7 OCT 2013 | DOI: 10.1002/stvr.1518

      Thumbnail image of graphical abstract

      The paper is focused on empirical characterization of software fixes. The results show that significant number of software failures require fixes in multiple software components and/or multiple software artifacts (i.e. 15% and 26%, respectively). The patterns of software components that are often fixed together are significantly affected by the software architecture. Furthermore, the types of fixed software artifacts are highly correlated with fault type, and they have different distributions for prerelease and post-release failures.

    2. A model-free and state-cover testing scheme for semaphore-based and shared-memory concurrent programs (pages 706–737)

      Gwan-Hwan Hwang, Che-Sheng Lin, Teng-Shuo Lee and Chi Wu-Lee

      Article first published online: 13 JAN 2014 | DOI: 10.1002/stvr.1520

      Thumbnail image of graphical abstract

      We present a new framework for performing dynamic testing of semaphore-based and shared-memory concurrent programs. The proposed scheme only has to analyze the synchronization sequences (SYN-sequences) that are collected during the dynamic testing of the concurrent program - static analysis of the syntax and semantics of the program is unnecessary. If the tested concurrent program has an infinite number of SYN-sequences, state-cover testing of the target program can be performed (if the execution states of the target concurrent program are finite).

SEARCH

SEARCH BY CITATION