Bounded Exhaustive Testing with Certified and Optimized Data Enumeration Programs - Testing Software and Systems Access content directly
Conference Papers Year : 2019

Bounded Exhaustive Testing with Certified and Optimized Data Enumeration Programs

Abstract

Bounded exhaustive testing (BET) is an elementary technique in automated unit testing. It consists in testing a function with all input data up to a given size bound. We implement BET to check logical and program properties, before attempting to prove them formally with the deductive verification tool Why3. We also present a library of enumeration programs for BET, certified by formal proofs of their properties with Why3. In order to make BET more efficient, we study and compare several strategies to optimize these programs.
Fichier principal
Vignette du fichier
482770_1_En_10_Chapter.pdf (260.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02526343 , version 1 (31-03-2020)

Licence

Attribution

Identifiers

Cite

Clotilde Erard, Alain Giorgetti. Bounded Exhaustive Testing with Certified and Optimized Data Enumeration Programs. 31th IFIP International Conference on Testing Software and Systems (ICTSS), Oct 2019, Paris, France. pp.159-175, ⟨10.1007/978-3-030-31280-0_10⟩. ⟨hal-02526343⟩
48 View
15 Download

Altmetric

Share

Gmail Facebook X LinkedIn More