Combinatorial Test Set Generation: Concepts, Implementation, Case - - PowerPoint PPT Presentation
Combinatorial Test Set Generation: Concepts, Implementation, Case Study Drs. Vadim V. Zaytsev 22 June 2004 Legal stuff Supervisor: Prof.dr. Hendrik Brinksma, UT Ext.Supervisor: Dr.ing. Ralf L ammel, VU&CWI Hosting
22 June 2004
ammel, VU&CWI
from MSR/FSE and Dr.ing. Ralf L¨ ammel from VU&CWI (Geno project).
1
– Combinatorial test data generation – Differential approach
– XML Schema as grammar description formalism – XML validators as grammar-based software
http://www.cs.vu.nl/grammarware/
2
...
Term
Term Term Term Term Term Term Term Term Term Term Term Term
Adversary of stochastic testing
3
Cardinalities per depth
1 2 3 4 5 6 10 100 1000 10000 100000 1000000 10000000 100000000 1000000000 1
Number of generated terms grows fast with depth and eventually explodes (becomes greater than 18446744073709551616).
4
...
Term
Term Term Term Term Term Term Term Term Term Term Term Term
+ other mechanisms
5
– intuitive definition
– nested unfolding of sorts
– building equivalence classes
6
– limit the preceding levels
– limit Cartesian product – pair-wise testing
– enforce context conditions
7
8
Grammar TDGenerator Test data Grammarware Output
Grammar-based testing tool generates terms in a combinatorial way.
9
Change the input language: grammar adaptation; change the output language: serialisation.
10
TDGenerator GOOD/BAD Decider Validator Validator YES XML XSD NO YES
NO
11
– wrapper written
– used as is
– wrapper written
12
— — —
13
Depth Sorts Constructors Terms Terms of reached in the signature total the root sort Valid 8 234 478 9914261 37240 Mutation 5 234 684 347339 64247 Stress 1000 5 6 1500 499
14
— — —
15
16