07.01.2013 Views

Lecture Notes in Computer Science 3472

Lecture Notes in Computer Science 3472

Lecture Notes in Computer Science 3472

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

408 Axel Bel<strong>in</strong>fante, Lars Frantzen, and Christian Schallhart<br />

ables might be subject to some of the constra<strong>in</strong>ts which are collected dur<strong>in</strong>g the<br />

symbolic execution.<br />

These variables can be <strong>in</strong>stantiated randomly or based on a limit analysis.<br />

After <strong>in</strong>stantiation, the test sequences can be used for actual test<strong>in</strong>g.<br />

Summary<br />

AutoFocus allows to model a system as a collection of communicat<strong>in</strong>g components<br />

which can be decomposed hierarchically <strong>in</strong>to further subnetworks of<br />

synchronously communicat<strong>in</strong>g components. The test<strong>in</strong>g environment of Auto-<br />

Focus provides the possibility to translate its models <strong>in</strong>to a CLP language and<br />

to symbolically execute these transformed models. The model can be associated<br />

with functional, structural, and stochastic test specifications to generate test<br />

sequences based on the symbolic execution with<strong>in</strong> the CLP environment. In addition<br />

AutoFocus is able to generate test cases that conform to a given coverage<br />

criteria to the model itself, or on a functional test specification. The generated<br />

test sequences can be employed to drive a SUT which implements or ref<strong>in</strong>es the<br />

model which underlies the generated test sequences.<br />

14.2.5 Conformance Kit<br />

Introduction<br />

At KPN Research [KPN] the Conformance Kit was developed <strong>in</strong> the early<br />

n<strong>in</strong>eties to support automatic test<strong>in</strong>g of protocol implementations. It is not publicly<br />

available. (E)FSMs serve as specifications. Beside the typical EFSM concepts<br />

like variables and conditions (predicates) on transitions, some additional<br />

notions like gates are <strong>in</strong>troduced to facilitate the mapp<strong>in</strong>g to the SUT. The gate<br />

concept allows to split a specification <strong>in</strong>to several EFSMs which communicate<br />

through such gates.<br />

The first fundamental tool of the Kit is a converter which transforms an<br />

EFSM <strong>in</strong>to an equivalent FSM (i.e. same <strong>in</strong>put/output behavior) via enumeration<br />

of the (necessarily f<strong>in</strong>ite doma<strong>in</strong>) variables. In a next step the result<strong>in</strong>g<br />

FSM is m<strong>in</strong>imized. A basic syntax check is embedded <strong>in</strong>to these steps which is<br />

capable of detect<strong>in</strong>g nondeterm<strong>in</strong>istic transitions and <strong>in</strong>put-<strong>in</strong>complete specifications.<br />

Furthermore, EFSMs can be simulated and a composer allows to assemble<br />

communicat<strong>in</strong>g EFSMs <strong>in</strong>to a s<strong>in</strong>gle one with equal behavior.<br />

Test Generation Process<br />

The test suite generation tool offers several FSM techniques to derive test cases.<br />

A transition tour is possible if the FSM is strongly connected. The disadvantage<br />

of this method is that only the <strong>in</strong>put/output behavior is tested, the<br />

correctness of the end-states of the transitions is not checked. To overcome this<br />

disadvantage a tour <strong>in</strong>clud<strong>in</strong>g unique <strong>in</strong>put/output (UIO) sequences is offered<br />

which does check the end-states. It is called partition tour because it does not

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!