Test selection for result inspection via mining predicate rules

Wujie Zheng, Michael R. Lyu, Tao Xie

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

It is labor-intensive to manually verify the outputs of a large set of tests that are not equipped with test oracles. Test selection helps to reduce this cost by selecting a small subset of tests that are likely to reveal faults. A promising approach is to dynamically mine operational models as potential test oracles and then select tests that violate them. Existing work mines operational models from verified passing tests based on dynamic invariant detection. In this paper, we propose to mine common operational models, which are not always true in all observed traces, from a set of unverified tests based on mining predicate rules. Specifically, we collect values of simple predicates at runtime and then generate and evaluate predicate rules as potential operational models after running all the tests. We then select tests that violate the mined predicate rules for result inspection. Preliminary results on the Siemens suite and the grep program show the effectiveness of our approach.

Original languageEnglish (US)
Title of host publication2009 31st International Conference on Software Engineering - Companion Volume, ICSE 2009
Pages219-222
Number of pages4
DOIs
StatePublished - 2009
Externally publishedYes
Event2009 31st International Conference on Software Engineering, ICSE 2009 - Vancouver, BC, Canada
Duration: May 16 2009May 24 2009

Publication series

Name2009 31st International Conference on Software Engineering - Companion Volume, ICSE 2009

Other

Other2009 31st International Conference on Software Engineering, ICSE 2009
Country/TerritoryCanada
CityVancouver, BC
Period5/16/095/24/09

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Test selection for result inspection via mining predicate rules'. Together they form a unique fingerprint.

Cite this