Random Grammar-based Testing for Covering All Non-Terminals

Alois Dreyfus 1, 2 Pierre-Cyrille Heam 2, 1 Olga Kouchnarenko 1, 2
2 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-00909225
Contributor : Pierre-Cyrille Heam <>
Submitted on : Tuesday, November 26, 2013 - 9:44:20 AM
Last modification on : Tuesday, December 18, 2018 - 4:38:25 PM
Long-term archiving on : Thursday, February 27, 2014 - 6:20:17 AM

Files

cstva.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00909225, version 1
  • ARXIV : 1311.6606

Citation

Alois Dreyfus, Pierre-Cyrille Heam, Olga Kouchnarenko. Random Grammar-based Testing for Covering All Non-Terminals. 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation - CSTVA Workshop, Mar 2013, Luxembourg, Luxembourg. ⟨hal-00909225⟩

Share

Metrics

Record views

376

Files downloads

226