A Random Testing Approach Using Pushdown Automata

Abstract

submitted (minor revision required).International audienceDeveloping efficient and automatic testing techniques is one of the major challenges \new{faced by} the software validation community. Recent work by Denise et al. published in STTT shows how to draw traces uniformly at random in large systems modelled by finite automata for testing purposes. Since finite automata are strong abstractions of systems, many test cases generated following this approach may be un-concretizable, i.e., they do not correspond to any concrete execution of the system under test. In this paper, this problem is tackled by extending the approach to pushdown systems that can encode either a stack data structure, or the call stack. The method is based on context-free grammars and related algorithms, and relies on combinatorial techniques to guarantee the uniformity of generated traces. In addition, the combination of coverage criteria with random testing is investigated, in order to take benefit of both approaches for evaluating the quality of the test suites. The application of the random approach is illustrated within both structural and model based testing contexts