ELUSIVE BUGS, BOUNDED EXHAUSTIVE TESTING AND INCOMPLETE ORACLES

W. E. Howden

2008

Abstract

Elusive bugs involve combinations of conditions that may not fit into any informal or intuitive testing scheme. One way to attack them is with Bounded Exhaustive Testing, in which all combinations of inputs for a bounded version of an application are tested. Studies of BET effectiveness for known bugs indicate that it is a promising approach. Because of the numbers of tests that are involved, BET normally depends on automated test generation and execution. This in turn requires the use of an automated oracle. In some cases the construction of a complete automated oracle would require the development of a second version of the application. This may be avoidable if incomplete oracles are used. Two classes of incomplete oracles are identified: necessity and sufficiency oracles. Examples are given of experiments using a necessity and a sufficiency oracle.

Paper Citation

in Harvard Style

E. Howden W. (2008). ELUSIVE BUGS, BOUNDED EXHAUSTIVE TESTING AND INCOMPLETE ORACLES . In Proceedings of the Third International Conference on Software and Data Technologies - Volume 2: ICSOFT, ISBN 978-989-8111-52-4, pages 115-121. DOI: 10.5220/0001868501150121

in Bibtex Style

@conference{icsoft08,
author={W. E. Howden},
title={ELUSIVE BUGS, BOUNDED EXHAUSTIVE TESTING AND INCOMPLETE ORACLES},
booktitle={Proceedings of the Third International Conference on Software and Data Technologies - Volume 2: ICSOFT,},
year={2008},
pages={115-121},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001868501150121},
isbn={978-989-8111-52-4},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Third International Conference on Software and Data Technologies - Volume 2: ICSOFT,
TI - ELUSIVE BUGS, BOUNDED EXHAUSTIVE TESTING AND INCOMPLETE ORACLES
SN - 978-989-8111-52-4
AU - E. Howden W.
PY - 2008
SP - 115
EP - 121
DO - 10.5220/0001868501150121