Conformance Testing for Timed Recursive programs - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Conformance Testing for Timed Recursive programs

Résumé

This paper is about conformance testing of timed pushdown automata with inputs and outputs (TPAIO), that specify both stack and clock constraints. TPAIO are used as a model for timed recursive programs. This paper proposes a novel method of off-line test generation from deterministic TPAIO. In this context, a first problem is to resolve the clock constraints. It is solved by computing a deterministic timed pushdown tester with inputs and outputs (TPTIO), that is a TPAIO with only one clock, and provided with a location fail. To generate test cases from a TPTIO, we compute from it a finite reachability automaton (RA), that relates any of its transitions to a path of the TPTIO. The RA computation takes the TPTIO transitions as a coverage criterion. The transitions of the RA, thus the paths of the TPTIO are used for generating test cases that aim at covering the reachable locations and transitions of the TPAIO.
Fichier non déposé

Dates et versions

hal-01229001 , version 1 (16-11-2015)

Identifiants

  • HAL Id : hal-01229001 , version 1

Citer

Hana Hemdi, Jacques Julliand, Pierre Masson, Riadh Robbana. Conformance Testing for Timed Recursive programs. ICIS 2015, 14th IEEE/ACIS Int. Conf. on Computer and Information Science, 2015, Las Vegas, United States. pp.203--219. ⟨hal-01229001⟩
118 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More