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.

11 Evaluat<strong>in</strong>g Coverage Based Test<strong>in</strong>g 321<br />

The properly partitions relation ensures a better fault detection ability for<br />

measure M1 and M2 (if C1 properly partitions C2 then C1 is better at detect<strong>in</strong>g<br />

faults than C2 with regard to M1 and M2) but not necessarily for M3.<br />

<strong>Notes</strong> S<strong>in</strong>ce for most criteria of <strong>in</strong>terest, the universally narrows relation is<br />

equivalent to the subsumes relation, one can <strong>in</strong>terpret the presented results by<br />

conclud<strong>in</strong>g that the subsume relation is a poor basis for compar<strong>in</strong>g criteria.<br />

However, it is important to note that the results here are worst case results <strong>in</strong><br />

the sense that it is only considered whether or not the fact that one criterion<br />

subsumes another guarantees improved fault-detect<strong>in</strong>g ability. The question of<br />

what C1 subsum<strong>in</strong>g, or narrow<strong>in</strong>g, or cover<strong>in</strong>g, or partition<strong>in</strong>g C2 tells us about<br />

their relative ability to detect faults <strong>in</strong> ”typical” programs rema<strong>in</strong>s open. Moreover,<br />

note that the most conv<strong>in</strong>c<strong>in</strong>g measure studied is measure M3, s<strong>in</strong>ce this<br />

measure takes <strong>in</strong>to account the number of test data used. Thus it is possible<br />

to compare two criteria for the same number of test data. However none of the<br />

relations presented here <strong>in</strong>duces a better fault detection ability for measure M3.<br />

11.4.3 Remarks<br />

Questions addressed <strong>in</strong> Section 11.4.1 and Section 11.4.2 can be compared. The<br />

way random based test<strong>in</strong>g is modeled <strong>in</strong> the contributions presented <strong>in</strong> Section<br />

11.4.1 results <strong>in</strong> a “partition oriented” view of random based test<strong>in</strong>g. Indeed random<br />

based test<strong>in</strong>g can be seen as a partition based technique which partitions<br />

the <strong>in</strong>put doma<strong>in</strong> <strong>in</strong> a s<strong>in</strong>gle subdoma<strong>in</strong> (the <strong>in</strong>put doma<strong>in</strong> itself). Even-more,<br />

random based test<strong>in</strong>g can be seen as a coverage criterion which divides the <strong>in</strong>put<br />

doma<strong>in</strong> of a program <strong>in</strong> one subdoma<strong>in</strong>: the <strong>in</strong>put doma<strong>in</strong> itself. Let us<br />

call random criterion this criterion. Consider now any structural criterion. It is<br />

easy to see that such a criterion either properly partitions or properly covers<br />

the random criterion (depend<strong>in</strong>g on the fact that the criterion of <strong>in</strong>terest <strong>in</strong>duces<br />

overlapp<strong>in</strong>g or non overlapp<strong>in</strong>g subdoma<strong>in</strong>s). Contributions presented <strong>in</strong><br />

Section 11.4.1 essentially make the assumption that the same number of test<br />

data is used both for random based an partition based test<strong>in</strong>g. Thus compar<strong>in</strong>g<br />

random based test<strong>in</strong>g and partition based test<strong>in</strong>g with regard to their ability to<br />

detect faults (as expressed <strong>in</strong> Section presented <strong>in</strong> Section 11.4.1) is equivalent<br />

to associate a criterion C to the partition based test<strong>in</strong>g technique considered,<br />

and to compare C with the random criterion with regard to Measure M3 (as<br />

def<strong>in</strong>ed <strong>in</strong> Section 11.4.2). Results <strong>in</strong>troduced <strong>in</strong> Section 11.4.1 <strong>in</strong>dicates that<br />

partition based test<strong>in</strong>g is not better at detect<strong>in</strong>g faults than random based test<strong>in</strong>g.<br />

This result is thus totally consistent with the fact that both properly covers<br />

and properly partitions relations do not <strong>in</strong>duce a better fault detection ability,<br />

with regard to measure M3.<br />

11.5 Summary<br />

The application of coverage techniques at the model level seems a promis<strong>in</strong>g approach.<br />

These techniques allow rather easy test selection from executable models,

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

Saved successfully!

Ooh no, something went wrong!