On the Use of Uniform Random Generation of Automata for Testing - Archive ouverte HAL Access content directly
Journal Articles Electronic Notes in Theoretical Computer Science Year : 2009

On the Use of Uniform Random Generation of Automata for Testing

(1) , (1) , (2)
1
2

Abstract

Developing efficient and automatic testing techniques is one of the major challenges facing software validation community. In this paper, we show how a uniform random generation process of finite automata, developed in a recent work by Bassino and Nicaud, is relevant for many faces of automatic testing. The main contribution is to show how to combine two major testing approaches: model-based testing and random testing. This leads to a new testing technique successfully experimented on a realistic case study. We also illustrate how the power of random testing, applied on a Chinese Postman Problem implementation, points out an error in a well-known algorithm. Finally, we provide some statistics on model-based testing algorithms.

Dates and versions

inria-00429236 , version 1 (02-11-2009)

Identifiers

Cite

Frédéric Dadeau, Pierre-Cyrille Héam, Jocelyn Levrey. On the Use of Uniform Random Generation of Automata for Testing. Electronic Notes in Theoretical Computer Science, 2009, Proceedings of Fifth Workshop on Model Based Testing (MBT 2009), 253 (2), pp.37-51. ⟨10.1016/j.entcs.2009.09.050⟩. ⟨inria-00429236⟩
111 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More