Software Testing, Verification and Reliability

Cover image for Vol. 26 Issue 1

Early View (Online Version of Record published before inclusion in an issue)

Edited By: Jeff Offutt and Robert M. Hierons

Impact Factor: 1.348

ISI Journal Citation Reports © Ranking: 2014: 35/104 (Computer Science Software Engineering)

Online ISSN: 1099-1689

Associated Title(s): Journal of Software: Evolution and Process, Software Process: Improvement and Practice, Software: Practice and Experience


  1. 1 - 9
  1. Research Articles

    1. Using combinatorial testing to build navigation graphs for dynamic web applications

      Wenhua Wang, Sreedevi Sampath, Yu Lei, Raghu Kacker, Richard Kuhn and James Lawrence

      Article first published online: 2 FEB 2016 | DOI: 10.1002/stvr.1599

      Thumbnail image of graphical abstract

      We present an approach to model the navigation structure of dynamic web applications by applying combinatorial strategies for systematic coverage of the navigation structure. We implement our approach in a tool, Tansuo, and experimentally evaluate its effectiveness on seven web applications with exploration guided by t-way coverage, for t = 1,2,3. We find that 2-way coverage is most effective and can cover more than 80% of the underlying code.

    2. Exhaustive test sets for algebraic specifications

      Marc Aiguier, Agnès Arnould, Pascale Le Gall and Delphine Longuet

      Article first published online: 27 JAN 2016 | DOI: 10.1002/stvr.1598

      Thumbnail image of graphical abstract

      In this paper, we study the conditions to ensure the exhaustiveness property of the set of observable consequences for several algebraic formalisms and several test hypotheses. Such a property is essential in testing because it prevents from rejecting a correct program or dually to accept an incorrect program. Hence, exhaustive test sets, when they exist, are appropriate to start the process of selecting test sets of reasonable size.

    3. Stochastic modelling and simulation approaches to analysing enhanced fault tolerance on service-based software systems

      Kuan-Li Peng and Chin-Yu Huang

      Article first published online: 9 DEC 2015 | DOI: 10.1002/stvr.1596

      Thumbnail image of graphical abstract

      Fault tolerance (FT) is a proven technique to provide continuous and reliable service delivery when failures occur. However, the reliability and performance of FT should be carefully analyzed because of the overhead of invoking redundant services and the potential single point of failure in the FT mechanism. To address these problems, this paper proposes two approaches, the stochastic modeling approach and the simulation approach, for analysing the reliability and performance attributes of generalized FT designs in service-based software systems (SBSSs).

    4. Predicting metamorphic relations for testing scientific software: a machine learning approach using graph kernels

      Upulee Kanewala, James M. Bieman and Asa Ben-Hur

      Article first published online: 16 NOV 2015 | DOI: 10.1002/stvr.1594

      Thumbnail image of graphical abstract

      Challenges in creating suitable oracles limit the ability to perform automated testing in scientific software. Metamorphic testing is a method for automating the testing process for programmes without test oracles. However, finding the metamorphic relations satisfied by a programme remains a labour-intensive task. Here, we propose a machine learning approach for predicting metamorphic relations that uses a graph-based representation of a programme. Our results show that a graph kernel that uses all paths in the graph has the best prediction accuracy.

    5. Behaviour abstraction adequacy criteria for API call protocol testing

      Hernan Czemerinski, Victor Braberman and Sebastian Uchitel

      Article first published online: 16 OCT 2015 | DOI: 10.1002/stvr.1593

      Thumbnail image of graphical abstract

      This paper proposes conformance testing adequacy criteria based on covering an abstraction of the intended behaviour's semantics. The criteria are independent of the specification language and structure used to describe the intended protocol and the language used to implement it. Experimental results show that the criteria are a good predictor for fault detection for protocol conformance and code coverage.

    6. Generating effective test cases based on satisfiability modulo theory solvers for service-oriented workflow applications

      Hongda Wang, Jianchun Xing, Qiliang Yang, Wei Song and Xuewei Zhang

      Article first published online: 29 SEP 2015 | DOI: 10.1002/stvr.1592

      Thumbnail image of graphical abstract

      The paper tackles test case generation problem of Web Service Business Process Execution Language applications based on satisfiability modulo theory solvers. The approach symbolically encodes every test path with several constraints and determines the feasibility of it with the help of satisfiability modulo theory solvers. Furthermore, test cases that correspond to feasible paths are computed to test the path effectively and can avoid instantiating idle instance.

    7. Probabilistic reasoning in diagnosing causes of program failures

      Junjie Xu, Rong Chen and Zhenjun Du

      Article first published online: 19 AUG 2015 | DOI: 10.1002/stvr.1583

      Thumbnail image of graphical abstract

      To accommodate the complexity and uncertainty of fault propagation in real software, this paper presents a novel probabilistic graph model probabilistic cause–effect graph that features bidirectional causality inference from dynamic program dependencies. The experimental results have shown the probabilistic cause–effect graph's outperformance in both single-fault and multiple-fault context, even with similar program runs through loops.

    8. Model-based security testing: a taxonomy and systematic classification

      Michael Felderer, Philipp Zech, Ruth Breu, Matthias Büchler and Alexander Pretschner

      Article first published online: 24 JUL 2015 | DOI: 10.1002/stvr.1580

      Thumbnail image of graphical abstract

      This article provides a taxonomy for model-based security testing approaches that comprises filter and evidence criteria. The taxonomy is based on a comprehensive analysis of existing classification schemes for model-based and security testing. To demonstrate its adequacy, 119 publications on model-based security testing are systematically extracted from relevant digital libraries and classified according to the defined filter and evidence criteria. On the basis of the classified publications, the article provides an overview of the state of the art in model-based security testing and discusses promising research directions.

    9. A lightweight framework for dynamic GUI data verification based on scripts

      Pedro Luis Mateo Navarro, Diego Sevilla Ruiz and Gregorio Martínez Pérez

      Article first published online: 6 MAY 2015 | DOI: 10.1002/stvr.1579

      Thumbnail image of graphical abstract

      Script-basedDAtaVERificationframework(S-DAVER)providesalightweight,easy-to-integrate, dynamic,andautomaticverificationframeworkforGraphicalUserInterfacedata.Allverification processesareencapsulatedinanindependentverificationlayer.Theseprocessesaretransparentto developers.Theverificationrulesarespecifiedinseparatefilesandwrittenusinggeneralpurpose, interpretedlanguages.Rulescanbechanged/reloadedatruntimewithoutrecompilation.Superimposed visualfeedbackisusedtoassistdevelopersduringthetestingstage,aswellastoimproveusers'experience duringexecution.


  1. 1 - 9