Test case generation site
Last update: May 10, 2012
|
Combinatorial testing / State machine test case generation
This site provides testers two kind of practical tools for test case generation:
- On the one side, it implements several combinatorial-based algorithms for generating test cases. There are implementations of algorithms
such as All combinations, several pairwise algorithms (AETG, PROW -Pairwise with Restrictions, Order and Weight-,
a costly pairwise -with exponential cost-, a bacteriological and a genetic), antirandom and random.
- On the other side, it also includes another tool for generating test cases from state machines specifications, described as transition tables.
You are cordially invited to freely use these tools, both for the actual test of your systems, as well as for your research work. Both tools
include instructions and examples.
Cite this site as: Polo M. and Pérez B. (2010). A framework and a web implementation for combinatorial testing.
White paper of the Alarcos Research Group. Available at (current date):
http://alarcosj.esi.uclm.es/CTWeb
Most applications and algorithms in this site have been developed by:
Macario Polo Usaola, Beatriz Pérez Lamancha and Pedro Reales Mateo
Alarcos Group
Department of Information Systems and Technologies
University of Castilla-La Mancha
Spain
Some combinatorial algorithms have been implemented by PhD students of Testing and Security of Information Systems
Visits
