Exploiting symmetry in protocol testing
Test generation and execution are often hampered by the large state spaces of the systems involved. In automata (or transition system) based test algorithms, taking advantage of symmetry in the behavior of specification and implementation may substantially reduce the amount of tests. We present a framework for describing and exploiting symmetries in black box test derivation methods based on finite state machines (FSMs). An algorithm is presented that, for a given symmetry relation on the traces of an FSM, computes a subautomaton that characterizes the FSM up to symmetry. This machinery is applied to the classical W-method [Ch78,Vas73] for test derivation. Finally, we focus on symmetries defined in terms of repeating patterns.
|Reliability, testing and fault tolerance (msc 68M15), Models of computation (Turing machines, etc.) (msc 68Q05), Theory of computing (msc 68Qxx), Fault detection; testing (msc 94C12)|
|Software Engineering [SEN]|
Romijn, J.M.T, & Springintveld, J.G. (1999). Exploiting symmetry in protocol testing. Software Engineering [SEN]. CWI.