Français Anglais
Accueil Annuaire Plan du site
Home > Research results > Research highlights
Research results
Research highlight : COVERAGE-BIASED RANDOM EXPLO-RATION OF LARGE MODELS AND APPLICATION TO TESTING
COVERAGE-BIASED RANDOM EXPLO-RATION OF LARGE MODELS AND APPLICATION TO TESTING
27 March 2011

A. Denise, M.-C. Gaudel, S.-D. Gouraud, R. Lassaigne, J. Oudinet S. Peyronnet, STTT: Int. Jal on SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER, DOI: 10.1007/s10009-011-0190-1
This paper presents several randomised algorithms for generating paths in large models according to a given coverage criterion. Using methods for counting combinatorial structures, these algorithms can efficiently explore very large models, based on a graphical representation by an automaton or by a product of several automata. This new approach can be applied to random exploration in order to optimise path coverage and can be generalised to take into account other coverage criteria, via the definition of a notion of randomised coverage satisfaction. Our main contributions are a method for drawing paths uniformly at random in composed models, i.e. models that are given as products of automata, first without and then with synchronisation; a new efficient approach to draw paths at random taking into account some other coverage criterion. Experimental results show promising agreement with theoretical predictions and significant improvement over previous randomised approaches. This work opens new perspectives for future studies of statistical testing and model checking, mainly to fight the combinatorial explosion problem.



Keyword
  ° Software Testing
  ° Algorithms
  ° Enumerative combinatorica

Group
  ° Bioinformatics
  ° Parallelism
  ° Formal Testing and System Exploration

Contact
  ° GAUDEL Marie-Claude
Research highlights
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:

SELF-STABILIZING DISTRIBUTED STABLE MARRIAGE
5 November 2017


A MODEL OF PULSATION FOR EVOLUTIVE FORMALIZING INCOMPLETE INTELLIGENT SYSTEMS
27 July 2017


INFORMATION-GEOMETRIC OPTIMIZATION ALGORITHMS: A UNIFYING PICTURE VIA INVARIANCE PRINCIPLES
2 May 2017
Yann Ollivier, Ludovic Arnold, Anne Auger, Nikolaus Hansen - JMLR 18(18):1−65, 2017.

FORMAL MUTATION TESTING FOR CIRCUS
21 April 2016
Alex Donizeti Betez Alberto, Ana Cavalcanti, Marie-Claude Gaudel, Adenilso Simao Journal of Infor