Detection of Polluting Test Objectives for Dataflow Criteria - Archive ouverte HAL Access content directly
Journal Articles Lecture Notes in Computer Science Year : 2020

Detection of Polluting Test Objectives for Dataflow Criteria

(1) , (1, 2) , (1) , (1)
1
2

Abstract

Dataflow test coverage criteria, such as all-defs and all-uses, belong to the most advanced coverage criteria. These criteria are defined by complex artifacts combining variable definitions, uses and program paths. Detection of polluting (i.e. inapplicable, infeasible and equivalent) test objectives for such criteria is a particularly challenging task. This short paper evaluates three detection approaches involving dataflow analysis, value analysis and weakest precondition calculus. We implement and compare these approaches, analyze their detection capacities and propose a methodology for their efficient combination. Initial experiments illustrate the benefits of the proposed approach.
Fichier principal
Vignette du fichier
main.pdf (297.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

cea-02974228 , version 1 (21-10-2020)

Identifiers

  • HAL Id : cea-02974228 , version 1

Cite

Thibault Martin, Nikolai Kosmatov, Virgile Prévosto, Matthieu Lemerre. Detection of Polluting Test Objectives for Dataflow Criteria. Lecture Notes in Computer Science, In press, 12546. ⟨cea-02974228⟩
147 View
155 Download

Share

Gmail Facebook Twitter LinkedIn More