Français Anglais
Accueil Annuaire Plan du site
Home > Research results > Research highlights
Research results
Research highlight : TEST SELECTION FOR TRACES REFINEMENT, ANA CAVALCANTI AND MARIE-CLAUDE GAUDEL
TEST SELECTION FOR TRACES REFINEMENT, ANA CAVALCANTI AND MARIE-CLAUDE GAUDEL
28 September 2014

Available online 28 August 2014
DOI: 10.1016/j.tcs.2014.08.012
Theories for model-based testing identify exhaustive test sets: typically infinite sets of tests whose execution establishes the conformance relation of interest. Practical techniques rely on selection strategies to identify finite subsets of these tests, and popular approaches are based on requirements to cover the model. In previous work, we have defined testing theories for refinement-based process algebra, namely, CSP and Circus, a state-rich process algebra. In this paper, we consider the selection of tests designed to establish traces refinement. In this case, conformance does not require that all traces of the model are available in the system under test, and this can raise challenges regarding coverage criteria for selection. To address these difficulties, we present a framework for formalising a variety of selection strategies. We exemplify its use in the formalisation of a selection criterion based on coverage of process communications for integration testing. We consider models written in Circus, whose symbolic testing theory facilitates the definition of uniformity and regularity hypotheses based on data operations, but also imposes extra challenges for selection of concrete tests. Our results, however, are relevant for any formalism where the conformance relation does not require all the traces of the specification to be executable by the system under test.



Keyword
  ° Formal Model-Based Testing

Group
  ° Verification of Algorithms, Languages and Systems

Contact
  [none]
Research highlights
BEST PAPER AWARD - HPCS 2019 - ON SERVER-SIDE FILE ACCESS PATTERN MATCHING
17 July 2019
Francieli Zanon Boito¹ , Ramon Nou², Laércio Lima Pilla³, Jean Luca Bez⁴, Jean-François Méhaut¹, T

BEST FULL PAPER AWARD EDM 2019 - EDUCATIONAL DATA MINING
5 July 2019
DAS3H: Modeling Student Learning and Forgetting for Optimally Scheduling Distributed Practice of Ski

BEST PAPER AWARD - CODIT2019 - STOCHASTIC DUAL DYNAMIC INTEGER PROGRAMMING FOR A MULTI-ECHELON LOT-SIZING PROBLEM WITH REMANUFACTURING AND LOST SALES
14 May 2019
Franco Quezada, Céline Gicquel and Safia Kedad-Sidhoum

BEST PAPER AWARD ICONS 2019: RESONANCE THINKING AND INDUCTIVE MACHINE LEARNING
6 May 2019
Yves Kodratoff & Marta Franova

COMPUTER‐AIDED BIOCHEMICAL PROGRAMMING OF SYNTHETIC MICROREACTORS AS DIAGNOSTIC DEVICES
27 April 2018
Alexis Courbet, Patrick Amar, Francois Fages, Eric Renard, Franck Molina Mol Syst Biol. (2018) 14: