Software Testing, Verification and Reliability

Cover image for Vol. 22 Issue 6

Special Issue: Model-based Testing Volume 2: Formal Approaches to Model-Based Testing

September 2012

Volume 22, Issue 6

Pages 363–454

Issue edited by: Paul Ammann, Gordon Fraser, Franz Wotawa

  1. Editorial

    1. Top of page
    2. Editorial
    3. Special Issue Papers
    1. You have free access to this content
  2. Special Issue Papers

    1. Top of page
    2. Editorial
    3. Special Issue Papers
    1. Formal passive testing of timed systems: theory and tools (pages 365–405)

      César Andrés, Mercedes G. Merayo and Manuel Núñez

      Version of Record online: 15 FEB 2012 | DOI: 10.1002/stvr.1464

      Thumbnail image of graphical abstract

      This paper presents a methodology to perform passive testing of timed systems. Execution traces are obtained without interfering with the behavior of the system. Invariants are used to represent the most relevant expected properties of the implementation. The paper gives algorithms to decide the correctness of proposed invariants with respect to a given specification and algorithms to check the correctness of the traces with respect to an invariant. A tool called PASTE automates the passive testing approach.

    2. Scenario-based testing using symbolic animation of B models (pages 407–434)

      Frédéric Dadeau, Kalou Cabrera Castillos and Régis Tissot

      Version of Record online: 13 MAR 2012 | DOI: 10.1002/stvr.1467

      Thumbnail image of graphical abstract

      This article presents a model-based test generation tool that relies on the use of a symbolic animation engine to execute a B model and produce test sequences. The animation is driven by user-defined scenarios, which can also be produced from high-level properties. Experimental results show the relevance of this approach that can be used to complement functional test cases.

    3. On reducing test length for FSMs with extra states (pages 435–454)

      Adenilso Simão, Alexandre Petrenko and Nina Yevtushenko

      Version of Record online: 28 FEB 2011 | DOI: 10.1002/stvr.452

      Thumbnail image of graphical abstract

      A long standing the problem when testing from a deterministic finite state machine is to guarantee full fault coverage even if the faults may introduce extra states in the implementations. It iswell-known that such tests should include the sequences in a traversal set which contains all input sequences of length defined by the number of extra states. This paper suggests the SPY method, which helps reduce the length of tests by distributing sequences of the traversal set and reducing test branching. Copyright © 2011 John Wiley & Sons, Ltd.