Software Testing, Verification and Reliability

Cover image for Vol. 26 Issue 8

Edited By: Jeff Offutt and Robert M. Hierons

Impact Factor: 1.082

ISI Journal Citation Reports © Ranking: 2015: 46/106 (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

Recently Published Issues

See all

Enjoy the ICST Special Issues published by Software Testing Verification and Reliability

To celebrate the ongoing collaboration between the ICST Conference and Software Testing, Verification & Reliability, we have brought all previous and current ICST Special Issues together in one collection.
 Read all the ICST Special Issue Papers

Recently Published Articles

  1. Causal inference based fault localization for numerical software with NUMFL

    Zhuofu Bai, Gang Shu and Andy Podgurski

    Version of Record online: 28 NOV 2016 | DOI: 10.1002/stvr.1613

    Thumbnail image of graphical abstract

    This paper presents NUMFL, a value-based causal inference technique for localizing faults in numerical software. Given value profiles for an expression's variables, NUMFL uses generalized propensity scores (GPSs) or covariate balancing propensity scores (CBPSs) to reduce confounding bias caused by evaluation of other faulty expressions. It estimates the average failure-causing effect of an expression using statistical regression models. The empirical results indicate that NUMFL is more effective than competitive metrics, and NUMFL works surprisingly well with data from failing runs alone.

  2. You have free access to this content
  3. You have free access to this content
  4. A simplification of a real-time verification problem (pages 548–571)

    Suman Roy, Janardan Misra and Indranil Saha

    Version of Record online: 10 OCT 2016 | DOI: 10.1002/stvr.1622

    Thumbnail image of graphical abstract

    In this work we propose a technique for reducing the problem of infinite state verification of qualitative temporal properties on timeout and calendar based transition systems to the problem of finite state verification of the same properties on those models. The technique is comprised of two steps, digitization of infinite state system with continuous time dynamics to the same with discrete time dynamics, and a finitary reduction of the latter to a finite state clock-less system. This technique enables us to verify safety, liveness and timeliness properties of the system with finite state model checkers.

  5. Past-Free[ze] reachability analysis: reaching further with DAG-directed exhaustive state-space analysis (pages 516–542)

    Ciprian Teodorov, Luka Le Roux, Zoé Drey and Philippe Dhaussy

    Version of Record online: 31 AUG 2016 | DOI: 10.1002/stvr.1611

    Thumbnail image of graphical abstract

    This paper presents Past-Free[ze], a new reachability algorithm that reduces the state-space explosion problem during model-checking. This algorithm relies on the explicit isolation of the acyclic parts of the system, which are used as a guide for freeing the past states of the system, making room for more future states. The algorithm effectiveness was evaluated both on a synthetic benchmark and on realistic case studies. The results show that up to 75% of the state-space can be dropped from memory