Random Grammar-Based Testing for Covering All Non-terminals - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Random Grammar-Based Testing for Covering All Non-terminals

Résumé

In the context of software testing, generating complex data inputs is frequently performed using a grammar-based specification. For combinatorial reasons, an exhaustive generation of the data - of a given size - is practically impossible, and most approaches are either based on random techniques or on coverage criteria. In this paper, we show how to combine these two techniques by biasing the random generation in order to optimise the probability of satisfying a coverage criterion.
Fichier principal
Vignette du fichier
cstva.pdf (275.66 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00940429 , version 1 (31-01-2014)

Identifiants

  • HAL Id : hal-00940429 , version 1

Citer

Aloïs Dreyfus, Pierre-Cyrille Héam, Olga Kouchnarenko. Random Grammar-Based Testing for Covering All Non-terminals. CSTVA 2013, 5-th Int. Workshop on Constraints in Software Testing Verification and Analysis. Held in conjunction with ICST 2013, Jan 2013, Luxembourg. pp.210 - 215. ⟨hal-00940429⟩
72 Consultations
76 Téléchargements

Partager

Gmail Facebook X LinkedIn More